| # | Title | Solution | Difficulty | Related Topics |
|---|---|---|---|---|
| 13 | Roman to Integer | C++ | Easy | String Hash Table |
| 30 | Substring with Concatenation of All Words | C++ | Hard | String Hash Table Sliding Window |
| 32 | Longest Valid Parentheses | C++ | Hard | Parentheses Stack |
| 51 | N-Queens | C++ | Hard | Matrix Backtracking Bit Manipulation |
| 52 | N-Queens II | C++ | Hard | Matrix Backtracking Bit Manipulation |
| 63 | Unique Paths II | C++ | Medium | Matrix Dynamic Programming |
| 88 | Merge Sorted Array | C++ | Easy | Two Pointers Sorting |
| 98 | Validate Binary Search Tree | C++ | Medium | Binary Search Tree |
| 108 | Convert Sorted Array to Binary Search Tree | C++ | Easy | Array Divide and Conquer Binary Search Tree Binary Tree |
| 191 | Number of 1 Bits | C++ | Easy | Bit Manipulation |
| 235 | Lowest Common Ancestor of a Binary Search Tree | C++ | Easy | Binary Search Tree Lowest Common Ancestor |
| 268 | Missing Number | C++ | Easy | Set |
| 300 | Longest Increasing Subsequence | C++ C++ |
Medium | Array Binary Search Dynamic Programming |
| 304 | Range Sum Query 2D - Immutable | C++ | Medium | Matrix Prefix Sum |
| 322 | Coin Change | C++ | Medium | Dynamic Programming |
| 329 | Longest Increasing Path in a Matrix | C++ | Hard | Matrix Topological Sort |
| 354 | Russian Doll Envelopes | C++ | Hard | Longest Increasing Subsequence Dynamic Programming Dichotomic Search |
| 474 | Ones and Zeroes | C++ | Medium | String Dynamic Programming Knapsack |
| 647 | Palindromic Substrings | C++ | Medium | String Manacher |
| 823 | Binary Trees With Factors | C++ | Medium | Array Hash Table Dynamic Programming |
| 867 | Transpose Matrix | C++ | Easy | Simulation |
| 1091 | Shortest Path in Binary Matrix | C++ | Medium | Matrix Breadth-First Search |
| 1192 | Critical Connections in a Network | C++ | Hard | Graph Depth-First Search Tarjan (Bridge) |
| 1302 | Deepest Leaves Sum | C++ | Medium | Binary Tree Breadth-First Search |
| 1342 | Number of Steps to Reduce a Number to Zero | C++ | Easy | Bit Manipulation |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | C++ | Easy | Binary Tree Recursion |
| 1480 | Running Sum of 1d Array | C++ | Easy | Prefix Sum |
GameShiba/LeetCode
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|