This repository is a structured collection of DSA (Data Structures & Algorithms) solutions using Java.
It's designed for students, job seekers, and coding enthusiasts who want to build their problem-solving skills from basic to advanced levels.
| β Topic | π Folder Link |
|---|---|
| Arrays | 01-arrays |
| Strings | 02-strings |
| Linked List | 03-linked-list |
| Stack | 04-stack |
| Queue | 05-queue |
| Hashing / HashMap | 06-hashing |
| Recursion | 07-recursion |
| Sorting | 08-sorting |
| Searching | 09-searching |
| Binary Search | 10-binary-search |
| Sliding Window | 11-sliding-window |
| Two Pointers | 12-two-pointers |
| Bit Manipulation | 13-bit-manipulation |
| Mathematics | 14-mathematics |
| Greedy Algorithms | 15-greedy |
| Backtracking | 16-backtracking |
| Divide and Conquer | 17-divide-and-conquer |
| Dynamic Programming | 18-dynamic-programming |
| Graphs | 19-graphs |
| Trees | 20-trees |
| Tries | 21-tries |
| Heap / Priority Queue | 22-heap |
| Disjoint Set (Union-Find) | 23-disjoint-set |
| Segment Tree / BIT | 24-segment-tree |
| Topological Sort | 25-topological-sort |
| Game Theory | 26-game-theory |
| Interview Puzzles | 27-interview-puzzles |
| Practice Sheet | 28-practice-sheet |
- Java π§
- VS Code / IntelliJ
- Git & GitHub for version control
- Community support π
We welcome all contributors! π
- β Star this repo
- Fork this repository
- Create a new branch:
git checkout -b feature-name - Add your Java file in the correct folder with a clear filename
- Commit:
git commit -m "Added ReverseArray.java in arrays" - Push:
git push origin feature-name - Create a Pull Request (PR)
- Code must be in Java
- Add short description as comment in code
- One file = One problem
- Add your name in code as author (optional)
Contribute and unlock GitHub badges:
- β Pull Shark
- β Pair Extraordinaire (collaborative PRs)
- β First PR
- β Galaxy Brain (discussion/issue)
To all contributors and coders learning & building together.
Let's crack DSA with Java β one problem at a time! π