Interview Questions:
1. Zigzag binary tree traversal
2. No of ways to reach a node in a tree/graph.
3. Graph with DP - how to make sum of graph equal to initial sum while removing some element or add new node. Need to optimize the number of steps.
4. Stock cost minimization
5. Find pairs of the number which constitutes given sum. Same for a single pair, three element pair, 4 element pair.
6. Binary Search tree - no of steps required to reach a node.
7.
2. No of ways to reach a node in a tree/graph.
3. Graph with DP - how to make sum of graph equal to initial sum while removing some element or add new node. Need to optimize the number of steps.
4. Stock cost minimization
5. Find pairs of the number which constitutes given sum. Same for a single pair, three element pair, 4 element pair.
6. Binary Search tree - no of steps required to reach a node.
7.
Comments
Post a Comment