Practice problems across 75+ categories
Practice coding problems across all companies and topics • 3600 problems | 879 Easy | 1856 Medium | 842 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 106 | Convert Sorted List to Binary Search Tree | Medium | Linked ListDivide and ConquerTree |
| 107 | Binary Tree Level Order Traversal II | Medium | TreeBreadth-First SearchBinary Tree |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | ArrayDivide and ConquerTree |
| 109 | Path Sum | Easy | TreeDepth-First SearchBreadth-First Search |
| 110 | Balanced Binary Tree | Easy | TreeDepth-First SearchBinary Tree |
| 110 | Path Sum II | Medium | BacktrackingTreeDepth-First Search |
| 111 | Flatten Binary Tree to Linked List | Medium | Linked ListStackTree |
| 111 | Minimum Depth of Binary Tree | Easy | TreeDepth-First SearchBreadth-First Search |
| 113 | Populating Next Right Pointers in Each Node | Medium | Linked ListTreeDepth-First Search |
| 115 | Distinct Subsequences | Hard | StringDynamic Programming |
| 117 | Populating Next Right Pointers in Each Node II | Medium | Linked ListTreeDepth-First Search |
| 118 | Pascal's Triangle | Easy | ArrayDynamic Programming |
| 119 | Pascal's Triangle II | Easy | ArrayDynamic Programming |
| 120 | Triangle | Medium | ArrayDynamic Programming |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
