How would you perform in-order, pre-order and post order traversals in a Binary Tree?
Given the pre-order and in-order traversals of the tree, how would you reconstruct the tree?
How would you generate N rows of the Pascal's triangle?
How would you design a performant service to store unique web URLs?
Given an array of stock prices, how would you maximise profit?
How would you implement a view scrolling service in Android using multiple threads?