1. First Round Print All Leaf Nodes of a Binary Tree from left to right( one stack and two stack both implementation ) Write a function to get the intersection point of two Linked Lists Time Complexity of program Types of binary tree BFS vs DFS graph traversing Comparison of Dijkstra’s and Floyd–Warshall algorithms Second Round Object oriented design principle Fail-safe and Fail-Fast Iterator Synchronization, Monitor Lock, Inter Thread Communication difference between notify() and notifyAll()