This repository serves as a personal log of solved LeetCode problems, designed for quick revision and concept reinforcement. It helps streamline review sessions by organizing solutions for fast lookup and pattern recognition.
- Track progress across various problem types and difficulty levels
- Revisit previously solved questions efficiently
Problems are grouped by topic, such as:
- Arrays
- Dynamic Programming (DP)
- Graphs
- Strings
- Trees
- Sliding Window
- Two Pointers
- Binary Search
- Stack / Queue
- Recursion / Backtracking
- Rapid pre-interview brushing
- Spotting patterns across similar problems
- Building a personal knowledge base of techniques and templates
| 0191-number-of-1-bits |
| 0137-single-number-ii |
| 0191-number-of-1-bits |
| 0231-power-of-two |
| 0861-flipping-an-image |
| 1444-number-of-steps-to-reduce-a-number-to-zero |
| 0231-power-of-two |
| 1444-number-of-steps-to-reduce-a-number-to-zero |
| 1448-maximum-69-number |
| 0231-power-of-two |
| 0033-search-in-rotated-sorted-array |
| 0540-single-element-in-a-sorted-array |
| 0792-binary-search |
| 0882-peak-index-in-a-mountain-array |
| 1046-max-consecutive-ones-iii |
| 1185-find-in-mountain-array |
| 0957-minimum-add-to-make-parentheses-valid |
| 1448-maximum-69-number |
| 1185-find-in-mountain-array |
| 0957-minimum-add-to-make-parentheses-valid |
| 1894-merge-strings-alternately |
| 0957-minimum-add-to-make-parentheses-valid |
| 0001-two-sum |
| 0560-subarray-sum-equals-k |
| 0121-best-time-to-buy-and-sell-stock |
| 0560-subarray-sum-equals-k |
| 1046-max-consecutive-ones-iii |
| 0088-merge-sorted-array |
| 0861-flipping-an-image |
| 1894-merge-strings-alternately |
| 0861-flipping-an-image |
| 0861-flipping-an-image |
| 1046-max-consecutive-ones-iii |
| 0056-merge-intervals |
| 0088-merge-sorted-array |