Table of content

Author: AdiChat

README.md

@@ -7,3 +7,45 @@ This is the best way to prepare Algorithmic and Data Structure problems for Codi
 | Problem # | Difficulty Level | Concepts |
 | :---         |     :---:      |          ---: |
 | [Problem 1](/src/Problem-01) | Easy | Hash Set, Binary Search, Two Pointer |
+| [Problem 2](/src/Problem-02) | Easy | Stack |
+| [Problem 3](/src/Problem-03) | Easy | Linked List, Bi-Traversal |
+| [Problem 4](/src/Problem-04) | Easy | Array, Dynamic Programming |
+| [Problem 5](/src/Problem-05) | Easy | String, Two Pointer approach |
+| [Problem 6](/src/Problem-06) | Easy | Binary Tree, Recursion |
+| [Problem 7](/src/Problem-07) | Easy | String, Frequency counting |
+| [Problem 8](/src/Problem-08) | Easy | Graph / Matrix, BFS / DFS |
+| [Problem 9](/src/Problem-09) | Easy | Graph, BFS / DFS |
+| [Problem 10](/src/Problem-10) | Easy | Binary Tree, Height, Recursion |
+| [Problem 11](/src/Problem-11) | Easy | Linked List, Fast Slow Pointer |
+| [Problem 12](/src/Problem-12) | Easy | Queue, Stack, Augmented Data Structure |
+| [Problem 13](/src/Problem-13) | Easy | Array, Search, Binary Search |
+| [Problem 14](/src/Problem-14) | Easy | Fibonacci sequence, Dynamic Programming, Binet Formula |
+| [Problem 15](/src/Problem-15) | Easy | String, Frequency counting |
+| [Problem 16](/src/Problem-16) | Easy | Linked List |
+| [Problem 17](/src/Problem-17) | Easy | Array, Frequency counting |
+| [Problem 18](/src/Problem-18) | Easy | String, Bitwise operations |
+| [Problem 19](/src/Problem-19) | Easy | Binary Tree, Height, Recursion |
+| [Problem 20](/src/Problem-20) | Easy | Binary Tree, Height, Recursion |
+| [Problem 21](/src/Problem-21) | Easy | Linked List, Fast Slow Pointer |
+| [Problem 22](/src/Problem-22) | Easy | Array, Frequency Counting, Hash Set |
+| [Problem 23](/src/Problem-23) | Easy | Array, Mapping / Hash Set |
+| [Problem 24](/src/Problem-24) | Easy | String, Stack, Two Pointer  |
+| [Problem 25](/src/Problem-25) | Easy | Bitwise operation, Dynamic Programming |
+| [Problem 26](/src/Problem-26) | Easy | Binary Tree, Recursion |
+| [Problem 27](/src/Problem-27) | Easy | Bitwise operation |
+| [Problem 28](/src/Problem-28) | Easy | Array, Frequency counting, XOR |
+| [Problem 29](/src/Problem-29) | Easy | Array, Two Pointer Approach, Swap |
+| [Problem 30](/src/Problem-30) | Easy | Array, Sorting, XOR |
+| [Problem 31](/src/Problem-31) | Easy | Bitwise operation |
+| [Problem 32](/src/Problem-32) | Easy | Linked List, Slow Fast Pointer |
+| [Problem 33](/src/Problem-33) | Easy | Binary Tree, Recursion |
+| [Problem 34](/src/Problem-34) | Easy | Array, Sorting, Two Pointer Approach |
+| [Problem 35](/src/Problem-35) | Easy | Triangle, Mathematics |
+| [Problem 36](/src/Problem-36) | Easy | Array, Prefix Sum |
+| [Problem 37](/src/Problem-37) | Easy | Array, Greedy |
+| [Problem 38](/src/Problem-38) | Easy | Array, Sorting, Hash Set |
+| [Problem 39](/src/Problem-39) | Easy | Array, Frequency counting |
+| [Problem 40](/src/Problem-40) | Easy | String, Dynamic Programming, Two Pointer Approach |
+| [Problem 41](/src/Problem-41) | Easy | Game Theory, Dynamic Programming |
+| [Problem 42](/src/Problem-42) | Easy | Array, Dynamic Programming |
+| [Problem 43](/src/Problem-43) | Easy | String, Sliding Window |