A linked list is defined as circular if the last node points at another node in the list.
So if you were to keep traversing the linked list, you would never stop, because there would be no end.
How can you determine if a linked list is circular?
Thinking about getting rich at the next tech startup?
by Troy 0 comments
The thing that struck true, is can you really make it big without being one of the first 5 founders?
After that, you need an exit like Google, Facebook, or YouTube. Oh wait. Facebook hasn't exitted yet.
Got this at Amazon. I think the standard way is you overwrite the pointer to where you should call back to. And overflow some code to that location, so it starts executing it.
Find the number of trailing 0s for n!
"Quick Brown Fox" => "Fox Brown Quick"
Implement and code the solution
Given an arbitrarily long string. Find the longest repeated substring.
abcabcabc => abcabc
Given a sorted array. Write an algorithm to create a binary tree of minimum height.
You are in a building with 100 floors. If you drop a marble from the Nth floor, it will break. How do you determine N with only 2 marbles?
Do this in the least number of drops.

Tags: 
