📘 DSA in Java

This repository contains my solutions to Data Structures and Algorithms (DSA) problems implemented in Java.
The aim of this repo is to build a well-structured reference of problems – starting from basics and moving towards advanced concepts.

---

📂 Folder Structure

DSA-in-Java/

• ├── Arrays/
• ├── Searching/
• ├── Sorting/
• ├── Strings/
• ├── Recursion/
• └── ...
• Each folder contains Java programs related to that topic.
• File names are self-explanatory (e.g., BinarySearchRecursive.java).

---

✅ Topics Covered

• 🔹 Arrays → palindrome check, reverse array, merge arrays, largest & smallest element, etc.
• 🔹 Searching → linear search, binary search (iterative & recursive), position of element.
• 🔹 Sorting → bubble sort, insertion sort, merge sort, quick sort, heap sort.
• 🔹 Strings → palindrome string, anagram check, reverse words, character frequency.
• 🔹 Recursion → factorial, Fibonacci, tower of Hanoi, binary search recursion.
• 🔹 Advanced (coming soon) → dynamic programming, graphs, backtracking, greedy algorithms.

---

🚀 How to Run

1. Clone the repository

   git clone https://github.com/Arpita01-work/DSA-in-Java.git

2. Navigate into the folder

   cd DSA-in-Java

3. Compile and run any program using:

   javac Arrays/Palindrome.java
   java Arrays.Palindrome
   

📊 Progress Tracker

• Arrays – 10+ problems
• Searching – 5+ problems
• Sorting – in progress
• Strings – in progress
• Recursion – upcoming
• Dynamic Programming – upcoming

🏆 Why This Repo?

• Organized topic-wise for easy navigation
• Well-commented Java solutions
• Covers problems from basic → advanced
• Continuously updated as part of my DSA learning journey

🤝 Contribute

• If you have suggestions, optimizations, or additional problems to add, feel free to:
• Fork the repo
• Create a new branch
• Submit a pull request 🚀

🔗 Connect with Me

✨ This repository is part of my preparation for coding interviews and placements. The goal is to keep improving every day – one problem at a time!