DSA-with-Java

Welcome to DSA-with-Java, a personal learning repository dedicated to mastering Data Structures and Algorithms (DSA) using Java. This repository contains implementations of various DSA concepts, problems, and solutions designed to strengthen algorithmic thinking and problem-solving skills.

---

📚 Contents

Data Structures

1. Arrays
2. Strings
3. Linked List
   • Singly Linked List
   • Doubly Linked List
   • Circular Linked List
4. Stacks
5. Queues
   • Circular Queue
   • Priority Queue
   • Deque
6. Hashing
   • HashMap
   • HashSet
7. Trees
   • Binary Trees
   • Binary Search Trees
   • AVL Trees
   • Segment Trees
   • Trie
8. Graphs
   • Adjacency Matrix
   • Adjacency List
   • Weighted Graphs
9. Heaps
   • Min Heap
   • Max Heap
10. Disjoint Set (Union-Find)
11. Bit Manipulation

---

Algorithms

1. Sorting Algorithms
   • Bubble Sort
   • Selection Sort
   • Insertion Sort
   • Merge Sort
   • Quick Sort
   • Heap Sort
   • Counting Sort
   • Radix Sort
2. Searching Algorithms
   • Linear Search
   • Binary Search
   • Ternary Search
3. Recursion and Backtracking
   • Subset Generation
   • Permutations and Combinations
   • N-Queens Problem
   • Sudoku Solver
4. Greedy Algorithms
   • Activity Selection Problem
   • Huffman Encoding
   • Kruskal's Algorithm
   • Prim's Algorithm
5. Dynamic Programming
   • Longest Common Subsequence
   • Longest Increasing Subsequence
   • Knapsack Problem
   • Matrix Chain Multiplication
   • Coin Change Problem
6. Graph Algorithms
   • Breadth-First Search (BFS)
   • Depth-First Search (DFS)
   • Dijkstra's Algorithm
   • Bellman-Ford Algorithm
   • Floyd-Warshall Algorithm
   • Topological Sorting
   • Minimum Spanning Tree (Kruskal, Prim)
7. Divide and Conquer
   • Merge Sort
   • Quick Sort
   • Binary Search
8. Sliding Window Techniques
   • Maximum Sum Subarray
   • Minimum Window Substring
9. Two Pointer Techniques
10. Bit Manipulation
    • Subset Generation using Bits
    • Bitwise Operations
11. Mathematical Algorithms
    • Sieve of Eratosthenes
    • GCD and LCM
    • Modular Arithmetic
12. String Algorithms
    • KMP Algorithm
    • Rabin-Karp Algorithm
    • Z-Algorithm
    • Trie Operations
13. Advanced Topics
    • Fenwick Tree
    • Segment Tree
    • Graph Coloring
    • Maximum Flow (Ford-Fulkerson)

---

🛠️ Tools and Environment

• Language: Java
• IDE: IntelliJ IDEA

---

💡 "Mastering Data Structures and Algorithms isn't just about cracking placements—it's about building the foundation to solve real-world problems efficiently. Your DSA journey is the gateway to acing interviews and excelling in your tech career." 💻