HashMap TreeMap Java String questions Print path between 2 nodes in BST Print max sum between root and leaf nodes along with their path Median of 2 sorted arrays Print even odd using 2 Threads Sum of given number equal to 2 numbers in array Sort hashmap by values Singleton class and write code for it Volatile keyword and Synchronised why we write wait method in while loop How to improve effeciency of finding index in hashmap-using & operation Why default size of hasmap is 16 Consistent hashing Load balencer Design book management system along with student records What are RestFull API Design end points for above design These are sample questions.....Prepare more on Trees