* The solutions are all written in **Python**.
* `a1.py` is an abbreviation of `all in one`. i.e.,  if a problem can be solved in multiple ways, then `a1.py` has all the solutions in a single file. (Just to make it easy, to compare and get the flow of how brute force can be changed to optimal solution)

To run the programs, 
* First clone the repository
* Then cd into xxx folder,
* Now use `python3 filename.py` command to execute the code.🤝

-- Need to complete --
* Sorting Algorithm.
* Searching Algorithm

1. Array & Hashing.
2. Two Pointers.
3.  Sliding Window.
4.  Stack.
5.  Binary Search.
6.  Linked List.
7.  Trees.
8.  Heaps.
9.  Back Tracking.
10.  Graphs.
11.  Dynamic Programming.
12.  Greedy.
13.  Tries.
14.  Intervals.
15.  Bit Manipulation.