Welcome to the Java DSA Practics repository! This project is dedicated to practising and mastering Data Structures and Algorithms (DSA) using Java, with a focus on technical interviews and coding challenges.
This repository serves as a personal collection of DSA problems solved in Java. It is structured to:
- Strengthen your problem-solving skills.
- Prepare for coding interviews at top tech companies.
- Cover a wide range of topics from basic to advanced levels.
- ✅ Arrays
- ✅ Strings
- ✅ Linked Lists
- ✅ Stacks and Queues
- ✅ Trees and Binary Trees
- ✅ Binary Search Trees
- ✅ Graphs
- ✅ Recursion and Backtracking
- ✅ Searching and Sorting
- ✅ Hashing
- ✅ Dynamic Programming
- ✅ Greedy Algorithms
- ✅ Sliding Window & Two Pointer Techniques
- ✅ Bit Manipulation
Java_DSA_Practics/ │ ├── Arrays/ │ └── ArrayProblem1.java │ ├── Strings/ │ └── ReverseString.java │ ├── Trees/ │ └── BinaryTreeTraversal.java │ ├── ... │ └── README.md
- Java 17+
- IntelliJ IDEA
- Git & GitHub
This is a personal learning repository, but please feel free to make sure you think or suggest improvements. If you spot anything, you can also open an issue.
Created with ❤️ by Durgesh Sawant
📧 LinkedIn | 🌐 GitHub