Data Structures and Algorithms (DSA) in Java

This repository contains solutions to various Data Structures and Algorithms (DSA) questions in Java. It includes curated problems from the Blind 75 list, sorting algorithms, graph problems, tree problems, and basic interview live coding questions.

Table of Contents

• Blind 75 Questions
• Sorting Algorithms
• Graph Problems
• Tree Problems
• Basic Interview Questions
• How to Use This Repository
• Contributing
• License

Blind 75 Questions

This section contains solutions to the Blind 75 list of coding interview questions. These questions are known for covering the most important concepts and are frequently asked in technical interviews.

Sorting Algorithms

This section includes implementations of various sorting algorithms:

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Heap Sort

Graph Problems

Explore graph-related problems, including traversal techniques like BFS, DFS, and problems like:

• All Paths From Source to Target
• Shortest Path Algorithms
• Cycle Detection

Tree Problems

This section contains problems related to binary trees, binary search trees, and general trees:

• Binary Tree Traversals
• Lowest Common Ancestor
• Tree Serialization/Deserialization

Basic Interview Questions

Here you'll find solutions to common live coding questions that often come up in technical interviews:

• Two Sum
• Reverse a Linked List
• Palindrome Check
• Anagram Check

How to Use This Repository

1. Clone the Repository:

   git clone https://github.com/Riteek712/Java-DSA.git