This repository contains structured Java implementations of Data Structures and Algorithms (DSA) using IntelliJ IDEA. It is organized by topic, with each topic in its own package and problems implemented as individual classes.
src/
└── dsa/
├── arrays/
├── linkedlist/
├── stack/
├── queue/
├── recursion/
├── sorting/
├── tree/
└── Main.java
Each topic contains:
- Well-commented Java implementations
- Testable main methods
- Code written for clarity and reusability
-
Clone the repository:
git clone git@github.com:yourusername/dsa-java-practice.git
-
Open in IntelliJ:
- Select:
File > Open > dsa-java-practice - Ensure Java SDK is set correctly
- Run
Main.javaor any specific problem class
- Select:
- ✅ Arrays
- ✅ Linked Lists
- ✅ Stack and Queue
- ✅ Recursion
- ✅ Sorting Algorithms
- ✅ Trees (Binary, BST, etc.)
- 🔜 Graphs, Tries, Heaps (coming soon)
This repository is maintained to:
- Reinforce DSA fundamentals
- Practice clean and modular Java coding
- Version control across multiple devices
- Java (JDK 17+)
- IntelliJ IDEA
- Git & GitHub
- Each class contains a
main()method with sample usage or test cases. .gitignoreexcludes build files, IDE configs, and logs for a clean repository.
This is a personal learning repo, but feel free to fork and use for your own practice.
This project is open-sourced and free to use under the MIT License.