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

1. Binary Tree

   1. Building a Binary Tree from an Array.

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. 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

6. Binary Heap

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

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

8. 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.