- Cracking the Coding Interview via HackerRank Playlist using Java
- CS Dojo Coding interview questions and solutions Playlist
- CS Dojo Dynamic Programming Playlist
- Algorithms playlist by Hackerrank channel
- Datastructures playlist by Hackerrank channel
- Project Euler
- Project Euler on Hackerrank
- Must do Coding questions Company Wise on GeekForGeeks
- Must do Coding questions Topic Wise for Amazon, Adobe, Microsoft on GeekForGeeks
- Must do Coding questions Topic wise on GeekForGeeks
If you have any more good references then comment down below, I will add it to the list. Usually it is best to stick to not more than 2 resources at one time.
- Longest Common Subsequence
- Longest Increasing Subsequence
- Edit Distance
- Minimum Partition
- Ways to Cover a Distance
- Longest Path In Matrix
- Subset Sum Problem
- Optimal Strategy for a Game
- 0-1 Knapsack Problem
- Boolean Parenthesization Problem
- Shortest Common Supersequence
- Matrix Chain Multiplication
- Partition problem
- Rod Cutting
- Coin change problem
- Word Break Problem
- Maximal Product when Cutting Rope
- Dice Throw Problem
- Box Stacking
- Egg Dropping Puzz
- Check if two given binary trees are identical or not | Iterative & Recursive
- Calculate height of a binary tree | Iterative & Recursive
- Delete given Binary Tree | Iterative & Recursive
- Inorder Tree Traversal | Iterative & Recursive
- Preorder Tree Traversal | Iterative & Recursive
- Postorder Tree Traversal | Iterative & Recursive
- Level Order Traversal of Binary Tree
- Spiral Order Traversal of Binary Tree
- Reverse Level Order Traversal of Binary Tree
- Print all nodes of a given binary tree in specific order
- Print Left View of a Binary Tree
- Print Right View of a Binary Tree
- Print Bottom View of Binary Tree
- Print Top View of Binary Tree
- Find next node in same level for given node in a binary tree
- Check if given binary tree is complete binary tree or not
- Determine if given two nodes are cousins of each other
- Print cousins of given node in a binary tree
- In-place convert given binary tree to its sum tree
- Check if given binary tree is a sum tree or not
- Combinations of words formed by replacing given numbers with corresponding alphabets
- Determine if given binary tree is a subtree of another binary tree or not
- Find diameter of a binary tree
- Check if given binary Tree has symmetric structure or not
- Convert binary tree to its mirror
- Check if binary tree can be converted to another by doing any no. of swaps of left & right child
- Find Lowest Common Ancestor (LCA) of two nodes in a binary tree
- Print all paths from root to leaf nodes in given binary tree
- Find ancestors of given node in a Binary Tree
- Find the distance between given pairs of nodes in a binary tree
- Find Vertical Sum in a given Binary Tree
- Print nodes in vertical order of a given Binary Tree (Vertical Traversal)
- Find the diagonal sum of given binary tree
- Print Diagonal Traversal of Binary Tree
- Print corner nodes of every level in binary tree
- In-place convert convert given Binary Tree to Doubly Linked List
- Sink nodes containing zero to the bottom of the binary tree
- Convert given binary tree to full tree by removing half nodes
- Truncate given binary tree to remove nodes which lie on a path having sum less than K
- Find maximum sum root-to-leaf path in a binary tree
- Check if given binary tree is height balanced or not
- Convert normal binary tree to Left-child right-sibling binary tree
- Determine if given Binary Tree is a BST or not
- Convert a Binary Tree to BST by maintaining its original structure
- Invert given Binary Tree | Recursive and Iterative solution
- Print leaf to root path for every leaf node in a binary tree
- Find maximum width of given binary tree
- Build Binary Tree from given Parent array
- Find all nodes at given distance from leaf nodes in a binary tree
- Count all subtrees having same value of nodes in a binary tree
- Find Maximum Difference Between a Node and its Descendants in a Binary Tree
- Construct a Binary Tree from Ancestor Matrix
- Calculate height of a binary tree with leaf nodes forming a circular doubly linked list