| Add Binary | Easy | LeetCode |
| alien-dictionary | Hard | Other |
| All Nodes Distance K in Binary Tree | Medium | LeetCode |
| As Far from Land as Possible | Medium | LeetCode |
| Balanced Binary Tree | Easy | LeetCode |
| BFS of graph | Practice | Easy | GeeksforGeeks |
| Binary Search Tree Iterator | Medium | LeetCode |
| Binary Tree Cameras | Hard | LeetCode |
| Binary Tree Level Order Traversal | Medium | LeetCode |
| Binary Tree Maximum Path Sum | Hard | LeetCode |
| Binary Tree Paths | Easy | LeetCode |
| Binary Tree Right Side View | Medium | LeetCode |
| Binary Tree Zigzag Level Order Traversal | Medium | LeetCode |
| BST with Dead End | Practice | Easy | GeeksforGeeks |
| Cheapest Flights Within K Stops | Medium | LeetCode |
| Check if it is possible to finish all task from given dependencies (Course Schedule I) | Medium | GeeksforGeeks |
| Check whether a given graph is Bipartite or not | Medium | GeeksforGeeks |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | LeetCode |
| Construct BST from Preorder Traversal | Hard | GeeksforGeeks |
| Convert Sorted Array to Binary Search Tree | Easy | LeetCode |
| Count BST nodes that lie in a given range | Practice | Medium | GeeksforGeeks |
| Critical Connections in a Network | Hard | LeetCode |
| Decode String | Medium | LeetCode |
| Depth First Search or DFS for a Graph | Easy | GeeksforGeeks |
| Detect a negative cycle in a Graph | (Bellman Ford) | Medium | GeeksforGeeks |
| Detect Cycle in a Directed Graph | Easy | GeeksforGeeks |
| Diameter of Binary Tree | Easy | LeetCode |
| Evaluate Division | Medium | LeetCode |
| Excel Sheet Column Title | Easy | LeetCode |
| Find Eventual Safe States | Medium | LeetCode |
| Find median of BST | Hard | GeeksforGeeks |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | LeetCode |
| Flatten Binary Tree to Linked List | Medium | LeetCode |
| Flood Fill | Easy | LeetCode |
| Floyd Warshall | Practice | Medium | GeeksforGeeks |
| Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’ | Medium | GeeksforGeeks |
| Happy Number | Easy | LeetCode |
| https://leetcode.com/problems/binary-tree-inorder-traversal/ | Easy | LeetCode |
| https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1 | Hard | GeeksforGeeks |
| Introduction to Graph Coloring | Medium | GeeksforGeeks |
| Invert Binary Tree | Easy | LeetCode |
| Kth Smallest Element in a BST | Medium | LeetCode |
| Largest BST in a Binary Tree | Hard | GeeksforGeeks |
| Longest Increasing Path in a Matrix | Hard | LeetCode |
| Lowest Common Ancestor of a Binary Search Tree | Easy | LeetCode |
| Lowest Common Ancestor of a Binary Tree | Medium | LeetCode |
| Making A Large Island | Hard | LeetCode |
| Max Points on a Line | Medium | LeetCode |
| Maximum Depth of Binary Tree | Easy | LeetCode |
| Maximum Product of Three Numbers | Easy | LeetCode |
| Maximum size rectangle binary sub-matrix with all 1s | Medium | GeeksforGeeks |
| Maximum Width of Binary Tree | Medium | LeetCode |
| Merge Two Binary Trees | Easy | LeetCode |
| Min distance between two given nodes of a Binary Tree | Practice | Medium | GeeksforGeeks |
| Minimize Cash Flow among a given set of friends who have borrowed money from each other | Hard | GeeksforGeeks |
| Minimum Absolute Difference in BST | Easy | LeetCode |
| Minimum Moves to Equal Array Elements | Easy | LeetCode |
| Missing Number | Easy | LeetCode |
| Most Stones Removed with Same Row or Column | Medium | LeetCode |
| Number of Islands | Medium | GeeksforGeeks |
| Number of Islands | Easy | LeetCode |
| Number of Operations to Make Network Connected | Medium | LeetCode |
| Palindrome Number | Easy | LeetCode |
| Path Sum | Easy | LeetCode |
| Path Sum III | Medium | LeetCode |
| Populating Next Right Pointers in Each Node | Medium | LeetCode |
| Power of Two | Easy | LeetCode |
| Predecessor and Successor | Practice | Easy | GeeksforGeeks |
| Preorder to BST | Practice | Medium | GeeksforGeeks |
| Prim’s Algorithm for Minimum Spanning Tree (MST) | Medium | GeeksforGeeks |
| Print all k-sum paths in a binary tree | Hard | GeeksforGeeks |
| Range Sum of BST | Easy | LeetCode |
| Rat in a Maze Problem - I | Practice | Easy | GeeksforGeeks |
| Recover Binary Search Tree | Medium | LeetCode |
| Redundant Connection | Medium | LeetCode |
| Remove Boxes | Hard | LeetCode |
| Reverse Integer | Easy | LeetCode |
| Rotate Image | Medium | LeetCode |
| Same Tree | Easy | LeetCode |
| Serialize and Deserialize Binary Tree | Hard | LeetCode |
| Shortest Bridge | Medium | LeetCode |
| Snakes and Ladders | Medium | LeetCode |
| Spiral Matrix | Medium | LeetCode |
| Steps by Knight | Practice | Medium | GeeksforGeeks |
| Strongly Connected | Practice | Medium | GeeksforGeeks |
| Subtree of Another Tree | Easy | LeetCode |
| Sum of Distances in Tree | Hard | LeetCode |
| Sum of Left Leaves | Easy | LeetCode |
| Symmetric Tree | Easy | LeetCode |
| The kth Factor of n | Medium | LeetCode |
| Time Needed to Inform All Employees | Medium | LeetCode |
| Topological sort | Practice | Medium | GeeksforGeeks |
| Total number of Spanning Trees in a Graph | Hard | GeeksforGeeks |
| Travelling Salesman Problem using Dynamic Programming | Hard | GeeksforGeeks |
| Undirected Graph Cycle | Practice | Easy | GeeksforGeeks |
| Unique Binary Search Trees | Medium | LeetCode |
| Unique Binary Search Trees II | Medium | LeetCode |
| Valid Square | Medium | LeetCode |
| Validate Binary Search Tree | Medium | LeetCode |
| Vertical Order Traversal of a Binary Tree | Hard | LeetCode |
| Water Jug problem using BFS | Hard | GeeksforGeeks |
| Word Ladder | Hard | LeetCode |