The repository holds the implementation of many basic and advanced Data Structures and Algorithms in Java. Feel free to fork the repo and use it for Problem Solving or Competitive Programming or simply understanding and modifying the implementation.

1. Binary Tree
2. Graph Concepts
3. Binary Heap
4. Disjoint Union Set
5. Tries / Prefix Tree
6. Linked List

1. Tree

   1. Building a Binary Tree from an Array.
   2. Finding the longest path in a Tree. Related Problem
   3. Depth First Search in a tree to compute on each path from Root too Leaf Nodes. Related Problem

2. Two Pointers

   1. Two Pointer approach for Rain Water Trapping problem

3. Graph Concept

   1. Making a Directed Graph
   2. Building a Weighted Directed Graph
   3. Computing Shortest Path - Dijkstra's with Min Heap (Optimised)
   4. Cycle Detection via single DFS iteration
   5. Water and Jug Problem (BFS) Problem Link
   6. Count number of Battleships on the board (DFS) Problem Link
   7. Returning a range of numbers in Lexicographical Order (DFS) Problem Link

4. Disjoin Union Set

   1. Union by Size
   2. Path Compression
   3. Finding Connected Components

5. Trie / Prefix Tree

   1. Implementation
   2. Insertion, Search and Prefix Search
   3. A Data Structure to Search Words and Patterns (BFS on Tries) Problem Link

6. Binary Heap

   1. Binary Max Heap implementation
   2. Finding K most frequent elements

7. Linked List

   1. Swapping adjacent nodes in a Linked List
   2. LRU Cache

8. Sliding Window

   1. Counting all possible subarrays with every distinct elements: Related Problem

9. Binary Search

   1. Finding peak in a Mountain Array: Problem Link
   2. Binary Search in a 2D Matrix: Problem Link

10. Fast IO for taking inputs in huge amount. Suited for Competitive Programming.

11. Helper Methods:

    1. A method which takes input a list of integers from the user and returns an array of integers.

All the DSA Problems' solution implements the Data Structures and Algorithms from this repo to achieve the above mentioned Runtime.