| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0442 | Find All Duplicates in an Array | View | Medium |
| 1437 | Check If All 1's Are at Least Length K Places Away | View | Medium |
| 1475 | Final Prices With a Special Discount in a Shop | View | Easy |
| 1277 | Count Square Submatrices with All Ones | View | Medium |
| 1475 | Final Prices With a Special Discount in a Shop | View | Easy |
| 0287 | Find the Duplicate Number | View | Medium |
| 1481 | Least Number of Unique Integers after K Removals | View | Medium |
| 0004 | Median of Two Sorted Arrays | View | Hard |
| 0918 | Maximum Sum Circular Subarray | View | Medium |
| 0496 | Next Greater Element I | View | Easy |
| 0503 | Next Greater Element II | View | Medium |
| 0556 | Next Greater Element III | View | Medium |
| 0238 | Product of Array Except Self | View | Medium |
| 1338 | Reduce Array Size to The Half | View | Medium |
| 0905 | Sort Array By Parity | View | Easy |
| 0922 | Sort Array By Parity II | View | Easy |
| 0713 | Subarray Product Less Than K | View | Medium |
| 1476 | Subrectangle Queries | View | Medium |
| 1471 | The k Strongest Values in an Array | View | Medium |
| 0941 | Valid Mountain Array | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0034 | Find First and Last Position of Element in Sorted Array | View | Medium |
| 0153 | Find Minimum in Rotated Sorted Array | View | Medium |
| 0162 | Find Peak Element | View | Medium |
| 0744 | Find Smallest Letter Greater Than Target | View | Easy |
| 0275 | H-Index II | View | Medium |
| 1482 | Minimum Number of Days to Make m Bouquets | View | Medium |
| 0852 | Peak Index in a Mountain Array | View | Easy |
| 1300 | Sum of Mutated Array Closest to Target | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0200 | Number of Islands | View | Medium |
| 1020 | Number of Enclaves | View | Medium |
| 0130 | Surrounded Regions | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0322 | Coin Change | View | Medium |
| 0518 | Coin Change 2 | View | Medium |
| 0338 | Counting Bits | View | Medium |
| 0740 | Delete and Earn | View | Medium |
| 0174 | Dungeon Game - Memoization | View | Hard |
| 0174 | Dungeon Game - Tabulation | View | Hard |
| 0198 | House Robber | View | Easy |
| 0368 | Largest Divisble Subset | View | Medium |
| 0300 | Longest Increasing Subsequence | View | Medium |
| 1048 | Longest String Chain | View | Medium |
| 0978 | Longest Turbulent Subarray | View | Medium |
| 1035 | Uncrossed Lines | View | Medium |
| 0062 | Unique Paths | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0002 | Add Two Numbers | View | Medium |
| 0445 | Add Two Numbers II | View | Medium |
| 0141 | Linked List Cycle | View | Easy |
| 0142 | Linked List Cycle II | View | Medium |
| 0876 | Middle of the Linked List | View | Easy |
| 0021 | Merge Two Sorted Lists | View | Easy |
| 1019 | Next Greater Node In Linked List | View | Medium |
| 0328 | Odd Even Linked List | View | Medium |
| 0082 | Remove Duplicates from Sorted List II | View | Medium |
| 0061 | Rotate List | View | Medium |
| 0206 | Reverse Linked List | View | Easy |
| 0092 | Reverse Linked List II | View | Medium |
| 0019 | Remove Nth Node From End of List | View | Medium |
| 0024 | Swap Nodes in Pairs | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0028 | Implement strStr() - KMP Algorithm | View | Easy |
| 0028 | Implement strStr() - Rabin Karp Algorithm | View | Easy |
| 0459 | Repeated Substring Pattern - KMP Algorithm | View | Easy |
| 0686 | Repeated String Match - KMP Algorithm | View | Easy |
| 1487 | Making File Names Unique | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0904 | Fruit Into Baskets | View | Medium |
| 1052 | Grumpy Bookstore Owner | View | Medium |
| 1004 | Max Consecutive Ones III | View | Medium |
| 1358 | Number of Substrings Containing All Three Characters | View | Medium |
| 1234 | Replace the Substring for Balanced String | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0938 | Range Sum of BST | View | Easy |
| 0617 | Merge Two Binary Trees | View | Easy |
| 0700 | Search in a Binary Search Tree | View | Easy |
| 0897 | Increasing Order Search Tree | View | Easy |
| 0559 | Maximum Depth of N-ary Tree | View | Easy |
| 0104 | Maximum Depth of Binary Tree | View | Easy |
| 0226 | Invert Binary Tree | View | Easy |
| 0530 | Minimum Absolute Difference in BST | View | Easy |
| 0993 | Cousins in Binary Tree | View | Easy |
| 0783 | Minimum Distance Between BST Nodes | View | Easy |
| 0543 | Diameter of Binary Tree | View | Easy |
| 0110 | Balanced Binary Tree | View | Easy |
| 1008 | Construct Binary Search Tree from Preorder Traversal | View | Medium |
| 1448 | Count Good Nodes in Binary Tree | View | Medium |
| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | View | Medium |
| 0429 | N-ary Tree Level Order Traversal | View | Medium |
| 0230 | Kth Smallest Element in a BST | View | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 0547 | Friend Circles | View | Medium |
| 1319 | Number of Operations to Make Network Connected | View | Medium |
| 0684 | Redundant Connection | View | Medium |
| 0990 | Satisfiability of Equality Equations | View | Medium |