ADI

Advanced Data Structures in JAVA. Questions done in classroom.

Linked List

• LRU cache (Interview Bit)

Binary Tree

• Convert Binary search tree to doubly linked list(Singly LL applied)
• Calculate difference of sum of even and sum of odd nodes
• Find the rank of a key in Balanced Search Tree
• Sum root to leaf numbers (Interview Bit)
• All possible paths from root to leaves (Interview Bit)
• All possible paths from root to leaves with given sum (Interview Bit)(ArrayList Solution)
• Flatten Binary Tree to Linked List (Interview Bit)
• Zig Zag Traversal (Interview Bit)
• Next Right Pointer (Interview Bit)

Trie Tree

• Trie Tree
• Hotel Reviews (Interview Bit)
• Shortest Unique Prefix (Interview Bit)

Heap

• Median of a running array
• Merge K sorted Linked List (Interview Bit)
• N max pair combinations

Hash

• Two sum (Interview Bit)
• Longest substring without repeat (Interview Bit)
• Colorful Numebers (Interview Bit)
• Anagrams (Interview Bit)

Graph

• Leaves of a subtree (DFS)

Others

• Visualizing a binary tree (Not perfect works for almost all cases, currently under development)