Welcome to my LeetCode repository!
This repository contains my accepted Java solutions to LeetCode problems as part of my Data Structures & Algorithms preparation for Software Engineering interviews.
- Solve LeetCode problems consistently
- Master core DSA patterns
- Prepare for Google, Microsoft, Amazon and other top tech companies
- Improve problem-solving and coding speed
- Java
- Arrays
- Strings
- HashMap & HashSet
- Two Pointers
- Sliding Window
- Binary Search
- Linked List
- Stack & Queue
- Trees
- Binary Search Trees
- Heaps / Priority Queue
- Graphs
- Backtracking
- Recursion
- Dynamic Programming
- Greedy Algorithms
- Bit Manipulation
- Trie
- Segment Tree
- Union Find
- ✔️ Solving problems daily
- ✔️ Following a structured roadmap
- ✔️ Focusing on interview-quality solutions
- ✔️ Writing clean and optimized Java code
Preparing for:
- Microsoft
- Amazon
- Atlassian
- Adobe
- Uber
- Walmart Global Tech
0001-two-sum/
README.md
Solution.java
0042-trapping-rain-water/
README.md
Solution.java
0200-number-of-islands/
README.md
Solution.java
2026
⭐ If you find this repository helpful, feel free to star it!
| 0079-word-search |
| 0785-is-graph-bipartite |
| 3310-remove-methods-from-project |
| 0037-sudoku-solver |
| 0079-word-search |
| 0085-maximal-rectangle |
| 0980-unique-paths-iii |
| 0139-word-break |
| 0139-word-break |
| 0785-is-graph-bipartite |
| 3310-remove-methods-from-project |
| 0785-is-graph-bipartite |
| 0785-is-graph-bipartite |
| 0997-find-the-town-judge |
| 3310-remove-methods-from-project |
| 0735-asteroid-collision |
| 1929-concatenation-of-array |
| 2507-smallest-value-after-replacing-with-sum-of-prime-factors |
| 3069-distribute-elements-into-two-arrays-i |
| 0050-powx-n |
| 0231-power-of-two |
| 0486-predict-the-winner |
| 0190-reverse-bits |
| 0191-number-of-1-bits |
| 0204-count-primes |
| 2259-remove-digit-from-number-to-maximize-result |
| 3345-smallest-divisible-digit-product-i |
| 0204-count-primes |
| 2507-smallest-value-after-replacing-with-sum-of-prime-factors |
| 3116-kth-smallest-amount-with-single-denomination-combination |
| 3348-smallest-divisible-digit-product-ii |
| 0069-sqrtx |
| 0532-k-diff-pairs-in-an-array |
| 3116-kth-smallest-amount-with-single-denomination-combination |
| 0146-lru-cache |
| 0155-min-stack |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0460-lfu-cache |
| 0901-online-stock-span |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0239-sliding-window-maximum |
| 0042-trapping-rain-water |
| 0532-k-diff-pairs-in-an-array |
| 3302-find-the-lexicographically-smallest-valid-sequence |
| 0402-remove-k-digits |
| 2029-stone-game-ix |
| 2259-remove-digit-from-number-to-maximize-result |
| 3302-find-the-lexicographically-smallest-valid-sequence |
| 3348-smallest-divisible-digit-product-ii |
| 0239-sliding-window-maximum |
| 2958-length-of-longest-subarray-with-at-most-k-frequency |
| 3090-maximum-length-substring-with-two-occurrences |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0901-online-stock-span |
| 0486-predict-the-winner |
| 0877-stone-game |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 1872-stone-game-viii |
| 2029-stone-game-ix |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 1872-stone-game-viii |
| 2029-stone-game-ix |
| 1140-stone-game-ii |
| 1406-stone-game-iii |
| 1510-stone-game-iv |
| 1872-stone-game-viii |
| 2029-stone-game-ix |
| 0532-k-diff-pairs-in-an-array |
| 2996-smallest-missing-integer-greater-than-sequential-prefix-sum |
| 3731-find-missing-elements |
| 0146-lru-cache |
| 0460-lfu-cache |
| 0146-lru-cache |
| 0460-lfu-cache |
| 1140-stone-game-ii |
| 1872-stone-game-viii |
| 1510-stone-game-iv |
| 2029-stone-game-ix |
| 1510-stone-game-iv |
| 2213-longest-substring-of-one-repeating-character |
| 2213-longest-substring-of-one-repeating-character |
| 2029-stone-game-ix |
| 3116-kth-smallest-amount-with-single-denomination-combination |