Practice problems across 75+ categories
Practice problems frequently asked at Meta • 2900 problems | 652 Easy | 1528 Medium | 703 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 316 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 317 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 318 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | ArrayHash TableDivide and Conquer |
| 319 | Construct K Palindrome Strings | Medium | Hash TableStringGreedy |
| 320 | Construct Product Matrix | Medium | ArrayMatrixPrefix Sum |
| 321 | Construct Quad Tree | Medium | ArrayDivide and ConquerTree |
| 322 | Construct Smallest Number From DI String | Medium | StringBacktrackingStack |
| 323 | Construct String with Minimum Cost | Hard | ArrayStringDynamic Programming |
| 324 | Construct String with Minimum Cost (Easy) | Unknown | StringTrieDynamic Programming |
| 325 | Construct String With Repeat Limit | Medium | Hash TableStringGreedy |
| 326 | Construct Target Array With Multiple Sums | Hard | ArrayHeap (Priority Queue) |
| 327 | Construct the Lexicographically Largest Valid Sequence | Medium | ArrayBacktracking |
| 328 | Construct the Longest New String | Medium | MathDynamic ProgrammingGreedy |
| 329 | Construct the Minimum Bitwise Array I | Easy | ArrayBit Manipulation |
| 330 | Construct the Minimum Bitwise Array II | Medium | ArrayBit Manipulation |
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.
