5 stories
Given a node in a binary tree, implement the algorithm for finding its next in-order node in the containing tree.
755 views
Return the Nth element of the Fibonacci series (1, 1, 2, 3, 5, 8, 13, 21, ...) efficiently without using any FOR or WHILE loops.
779 views
Write the algorithm that LinkedIn.com uses to tell you how many professionals you have access to.
698 views
How many binary tree topologies are possible given n nodes?
795 views
The first job is a chicken and egg problem. How can I get the first job that gives me experience, when the first job itself needs experience?
10,628 views
