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!
| 0017-letter-combinations-of-a-phone-number |
| 0022-generate-parentheses |
| 0079-word-search |
| 0115-distinct-subsequences |
| 0131-palindrome-partitioning |
| 0132-palindrome-partitioning-ii |
| 0139-word-break |
| 0022-generate-parentheses |
| 0115-distinct-subsequences |
| 0131-palindrome-partitioning |
| 0132-palindrome-partitioning-ii |
| 0139-word-break |
| 0039-combination-sum |
| 0040-combination-sum-ii |
| 0051-n-queens |
| 0079-word-search |
| 0090-subsets-ii |
| 0139-word-break |
| 0216-combination-sum-iii |
| 0980-unique-paths-iii |
| 0090-subsets-ii |
| 0980-unique-paths-iii |
| 0017-letter-combinations-of-a-phone-number |
| 0139-word-break |
| 0079-word-search |
| 0079-word-search |
| 0980-unique-paths-iii |
| 0139-word-break |
| 0139-word-break |