This repository contains Data Structures and Algorithms (DSA) solutions implemented in Java, primarily focused on LeetCode problems. The purpose of this repository is to demonstrate strong problem‑solving skills, clean Java implementation, and consistency in DSA practice, targeting software engineering recruiters and interviewers.
All solutions are written from scratch with an interview‑oriented mindset, emphasizing clarity, correctness, and optimal time/space complexity.
- Software Engineering Recruiters
- Interviewers evaluating DSA fundamentals
- Students preparing for technical interviews
The repository is organized topic‑wise for easy navigation:
- Linear Search
- Binary Search
- Sorting Algorithms
- Recursion
- Mathematics for DSA
- Stacks (including monotonic stack problems)
- Queues
- Linked Lists
- Trees
- Large Number Computation
Each folder contains Java files solving multiple LeetCode problems related to that topic.
- Primary Platform: LeetCode
- Problems range from Easy → Medium → Hard
- Many solutions are written after analyzing multiple approaches and edge cases
Where applicable, problems are optimized to meet LeetCode constraints.
- Language: Java
- Paradigm: Object‑Oriented Programming
- Focus: Time & Space Optimization
-
Clone the repository:
git clone https://github.com/dhruvrajsinghgaur/DSA-java.git
-
Open the project in any Java‑supported IDE (IntelliJ IDEA / Eclipse / VS Code).
-
Navigate to the topic folder.
-
Run individual
.javafiles (each file is self‑contained).
- Consistent DSA practice in Java
- Clean, readable, and modular code
- Topic‑wise structured repository
- Covers core interview‑critical problems (Stacks, Trees, Searching, etc.)
- Demonstrates strong grasp of data structures and algorithmic thinking
- Adding more LeetCode Medium & Hard problems
- Including problem numbers and titles in file names
- Adding time & space complexity analysis as comments
Dhruvraj Singh Gaur B.Tech – Computer Science & Engineering Focused on Software Engineering roles
⭐ If you are a recruiter reviewing this repository, thank you for your time and consideration.