This repository contains my accepted solutions to LeetCode problems implemented in C++.
The repository serves as a record of my Data Structures and Algorithms practice, with solutions automatically synchronized using LeetHub. Problems are organized by topic, making it easy to explore different algorithmic patterns and data structures.
- Strengthen problem-solving skills
- Build proficiency in Data Structures and Algorithms
- Prepare for technical interviews
- Maintain a consistent coding practice
| Category | Technology |
|---|---|
| Language | C++ |
| Platform | LeetCode |
| IDE | IntelliJ IDEA |
| Version Control | Git & GitHub |
- Arrays
- Strings
- Hash Tables
- Linked Lists
- Stacks
- Queues
- Trees
- Binary Trees
- Binary Search Trees
- Graphs
- Heap / Priority Queue
- Greedy
- Sliding Window
- Two Pointers
- Prefix Sum
- Binary Search
- Dynamic Programming
- Backtracking
- Depth First Search
- Breadth First Search
- Divide and Conquer
- Union Find
- Segment Tree
- Sorting
- Counting Sort
- Memoization
- Math
- Combinatorics
Additional topics will be added as the repository grows.
LeetCode_DSA/
│
├── Problem Name/
│ ├── README.md
│ └── Solution.java
│
├── Problem Name/
│ ├── README.md
│ └── Solution.java
│
└── README.md
The sections below are maintained automatically as new problems are solved and synchronized using LeetHub.
| 1833-maximum-ice-cream-bars |
| 3517-smallest-palindromic-rearrangement-i |
| 0114-flatten-binary-tree-to-linked-list |
| 0148-sort-list |
| 1721-swapping-nodes-in-a-linked-list |
| 0148-sort-list |
| 3737-count-subarrays-with-majority-element-i |
| 3739-count-subarrays-with-majority-element-ii |
| 0297-serialize-and-deserialize-binary-tree |
| 2213-longest-substring-of-one-repeating-character |
| 3501-maximize-active-section-with-trade-ii |
| 3737-count-subarrays-with-majority-element-i |
| 3739-count-subarrays-with-majority-element-ii |
| 1569-number-of-ways-to-reorder-array-to-get-same-bst |
| 1569-number-of-ways-to-reorder-array-to-get-same-bst |
| 3312-sorted-gcd-pair-queries |
| 3518-smallest-palindromic-rearrangement-ii |
| 0114-flatten-binary-tree-to-linked-list |
| 1081-smallest-subsequence-of-distinct-characters |
| 1291-sequential-digits |
| 3020-find-the-maximum-number-of-elements-in-subset |
| 3345-smallest-divisible-digit-product-i |
| 3499-maximize-active-section-with-trade-i |
| 3514-number-of-unique-xor-triplets-ii |
| 1358-number-of-substrings-containing-all-three-characters |
| 2958-length-of-longest-subarray-with-at-most-k-frequency |
| 3090-maximum-length-substring-with-two-occurrences |
| 1260-shift-2d-grid |
| 1301-number-of-paths-with-max-score |
| 2812-find-the-safest-path-in-a-grid |
| 3286-find-a-safe-walk-through-a-grid |
| 3286-find-a-safe-walk-through-a-grid |
| 3620-network-recovery-pathways |
| 3620-network-recovery-pathways |
| 0692-top-k-frequent-words |
| 0692-top-k-frequent-words |
| 3513-number-of-unique-xor-triplets-i |
| 3514-number-of-unique-xor-triplets-ii |
| 3534-path-existence-queries-in-a-graph-ii |
| 3702-longest-subsequence-with-non-zero-bitwise-xor |
| 1260-shift-2d-grid |
| 3867-sum-of-gcd-of-formed-pairs |
| 1081-smallest-subsequence-of-distinct-characters |
| 0486-predict-the-winner |
| 0486-predict-the-winner |
| 0877-stone-game |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 1563-stone-game-v |
| 2029-stone-game-ix |
| 0572-subtree-of-another-tree |
| 0572-subtree-of-another-tree |
| 0257-binary-tree-paths |
| 3348-smallest-divisible-digit-product-ii |
| 2071-maximum-number-of-tasks-you-can-assign |
| 2071-maximum-number-of-tasks-you-can-assign |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 2029-stone-game-ix |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 2029-stone-game-ix |
| 1510-stone-game-iv |
| 2029-stone-game-ix |
| 1510-stone-game-iv |
| 2213-longest-substring-of-one-repeating-character |