This repository serves as a personal archive for my daily problem-solving journey on LeetCode and other competitive programming platforms. It is specifically structured to track my progress through Striver’s A-Z DSA Sheet, focusing on building a deep understanding of complex algorithms and data structures.
- Objective: To master problem-solving patterns and optimize time/space complexity for technical interviews.
- Primary Focus: Currently deep-diving into Graphs, Dynamic Programming (DP), Stacks, and Queues.
- Primary Language: C++.
- Cp Platforms: LeetCode, Codeforces.
For Educational Purposes Only This repository is a personal log of my journey. The solutions provided here are intended to track my progress and provide a reference for my own learning process.
Academic Integrity These solutions are shared to help the community understand different approaches and logic, not to encourage plagiarism. Please attempt problems independently first.
Optimization Some solutions may not be the most optimal (
$O(n)$ vs $O(n^2)$), as they reflect my initial thought process and subsequent improvements during my learning journey.
“Turning data into insights and code into solutions.”
| 0070-climbing-stairs |
| 0077-combinations |
| 0494-target-sum |
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n |
| 1980-find-unique-binary-string |
| 0002-add-two-numbers |
| 0025-reverse-nodes-in-k-group |
| 0044-wildcard-matching |
| 1545-find-kth-bit-in-nth-binary-string |
| 0904-fruit-into-baskets |
| 1838-frequency-of-the-most-frequent-element |
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating |
| 2760-longest-even-odd-subarray-with-threshold |
| 1009-complement-of-base-10-integer |
| 3877-minimum-removals-to-achieve-target-xor |
| 0310-minimum-height-trees |
| 0785-is-graph-bipartite |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 0215-kth-largest-element-in-an-array |
| 0347-top-k-frequent-elements |
| 1878-get-biggest-three-rhombus-sums-in-a-grid |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero |
| 1622-fancy-sequence |
| 1622-fancy-sequence |
| 0310-minimum-height-trees |
| 0472-concatenated-words |
| 2452-words-within-two-edits-of-dictionary |
| 3546-equal-sum-grid-partition-i |
| 3548-equal-sum-grid-partition-ii |
| 0002-add-two-numbers |
| 0025-reverse-nodes-in-k-group |
| 0061-rotate-list |
| 0114-flatten-binary-tree-to-linked-list |
| 1669-merge-in-between-linked-lists |
| 2181-merge-nodes-in-between-zeros |
| 0347-top-k-frequent-elements |
| 0914-x-of-a-kind-in-a-deck-of-cards |
| 2423-remove-letter-to-equalize-frequency |
| 2833-furthest-point-from-origin |
| 3407-substring-matching-pattern |
| 3474-lexicographically-smallest-generated-string |
| 0914-x-of-a-kind-in-a-deck-of-cards |
| 3629-minimum-jumps-to-reach-end-via-prime-teleportation |
| 0215-kth-largest-element-in-an-array |
| 0347-top-k-frequent-elements |
| 0347-top-k-frequent-elements |
| 3464-maximize-the-distance-between-points-on-a-square |
| 0094-binary-tree-inorder-traversal |
| 0114-flatten-binary-tree-to-linked-list |
| 0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal |
| 0450-delete-node-in-a-bst |
| 0701-insert-into-a-binary-search-tree |
| 0127-word-ladder |