Although I'm too a beginner but I try to learn new things everyday, so here are the questions on DS which beginners like me find hard but are too easy if learned the DS nicely.
Arrays
Stacks
Index | Problem | Prerequisite |
---|---|---|
1 | Largest Rectangle in Histogram | None |
2 | Stock Span Problem | None |
3 | Reverse a Stack without using extra space | Recursion |
4 | Delete middle element of stack | Recursion |
5 | Sort a Stack | Recursion |
6 | Sed Max | None |
7 | Move Brackets | None |
8 | Power Set | Recursion |
Segment Trees
Index | Problem | Prerequisite |
---|---|---|
1 | Range Minimum Query | None |
2 | Help Ashu | None |
Greedy Algos
Index | Problem | Prerequisite |
---|---|---|
1 | Activity Selection | Caution: Wrong test case on Geeks for Geeks |
2 | Egyptian Factors | Mathematics |
3 | Job Sequencing Problem | None |
4 | Water Connection Problem | None |
5 | Police Catch Thieves | None |
DFS
Index | Problem | Prerequisite |
---|---|---|
1 | Connected Components in a Graph | DFS on undirected graph |
2 | Bishu and his Girlfriend | DFS on undirected graph |
3 | Is it a tree | Graph knowledge |
4 | A Bug’s Life | Bipartite graphs |
5 | Fire Escape Routes | Connected Components |
6 | Counting Rooms | DFS on 2D grid |
7 | Longest path in a tree | Diameter of tree |
8 | A Walk to Remember | Kosaraju's algo |
9 | Maximum Size | DFS on 2D grid |
10 | Detect cycle in an undirected graph | DFS |
11 | Detect cycle in a directed graph | DFS |
12 | Tree House | DFS |
13 | Rat in maze Problem 1 | DFS on 2D grid and Backtracking |
14 | Flood Fill | DFS on 2D grid |
15 | Number of Operations to Make Network Connected | Connected Components |
BFS
Index | Problem | Prerequisite |
---|---|---|
1 | Monk and the Islands | BFS on undirected graph |
2 | Prime Path | Sieve of Erosthenes and BFS |
3 | Feasible relations | BFS |
4 | Social Networking Graph | BFS |
5 | Jungle Run | BFS on 2D grid |
6 | Chess knight move | BFS on 2D grid |
7 | Bitmap | BFS on 2D grid |
8 | Lucius Dungeon | BFS on 2D grid |
9 | The Cats and the Mouse | BFS on 2D grid |
10 | Word Ladder | BFS |
11 | Jump Game VII | BFS |
Disjoint Set
Index | Problem | Prerequisite |
---|---|---|
1 | Teacher's Dilemma | None |
Bit Manipulation
Index | Problem | Prerequisite |
---|---|---|
1 | Number of 1 Bits | None |
2 | Non Repeating Numbers | None |
3 | Bit Difference | None |
4 | Power Set | None |
5 | Count Total Set Bits | None |
6 | And Then There Were K | None |