A curated collection of my LeetCode solutions to strengthen problem-solving skills and ace coding interviews.
Explore my progress and solved problems on LeetCode: 👉 https://leetcode.com/u/mandavavenkatasrisaisurya/
This repository contains my solutions to LeetCode problems covering core data structures and algorithms. It serves as a personal archive to improve problem-solving ability and prepare for coding interviews.
Problems are organized by their LeetCode titles. Each folder contains:
- Problem statement link
- Solution code
- Practice data structures and algorithms consistently
- Write clean and optimized solutions
- Strengthen interview problem-solving skills
- Track learning progress over time
This repository is actively updated as I continue solving new problems on LeetCode.
| 0380-insert-delete-getrandom-o1 |
| 0528-random-pick-with-weight |
| 0295-find-median-from-data-stream |
| 0703-kth-largest-element-in-a-stream |
| 0901-online-stock-span |
| 0933-number-of-recent-calls |
| 2013-detect-squares |
| 0146-lru-cache |
| 0460-lfu-cache |
| 0023-merge-k-sorted-lists |
| 0148-sort-list |
| 0912-sort-an-array |
| 0347-top-k-frequent-elements |
| 0692-top-k-frequent-words |
| 0912-sort-an-array |
| 0215-kth-largest-element-in-an-array |
| 0347-top-k-frequent-elements |
| 0973-k-closest-points-to-origin |
| 0459-repeated-substring-pattern |
| 0572-subtree-of-another-tree |
| 0796-rotate-string |
| 3474-lexicographically-smallest-generated-string |
| 0572-subtree-of-another-tree |
| 0705-design-hashset |
| 0706-design-hashmap |
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 0149-max-points-on-a-line |
| 0973-k-closest-points-to-origin |
| 3464-maximize-the-distance-between-points-on-a-square |
| 0239-sliding-window-maximum |
| 0918-maximum-sum-circular-subarray |
| 0399-evaluate-division |
| 0743-network-delay-time |
| 0787-cheapest-flights-within-k-stops |
| 0332-reconstruct-itinerary |
| 0274-h-index |
| 0912-sort-an-array |
| 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree |
| 1584-min-cost-to-connect-all-points |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 0070-climbing-stairs |
| 0139-word-break |
| 0140-word-break-ii |
| 0329-longest-increasing-path-in-a-matrix |
| 0509-fibonacci-number |
| 0698-partition-to-k-equal-sum-subsets |
| 1137-n-th-tribonacci-number |
| 0062-unique-paths |
| 1863-sum-of-all-subset-xor-totals |
| 1851-minimum-interval-to-include-each-query |
| 0204-count-primes |
| 0258-add-digits |
| 1492-the-kth-factor-of-n |
| 2709-greatest-common-divisor-traversal |
| 2807-insert-greatest-common-divisors-in-linked-list |
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
| 0204-count-primes |
| 1863-sum-of-all-subset-xor-totals |
| 1995-count-special-quadruplets |
| 2259-remove-digit-from-number-to-maximize-result |
| 3546-equal-sum-grid-partition-i |
| 3548-equal-sum-grid-partition-ii |
| 0374-guess-number-higher-or-lower |
| 1095-find-in-mountain-array |
| 0895-maximum-frequency-stack |
| 2336-smallest-number-in-infinite-set |
| 1622-fancy-sequence |
| 0473-matchsticks-to-square |
| 0698-partition-to-k-equal-sum-subsets |
| 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree |
| 0877-stone-game |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 0173-binary-search-tree-iterator |
| 0912-sort-an-array |