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