File size: 9,425 Bytes
8a2dcce | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 | {
"linear_search.txt": {
"topic": "Linear Search",
"category": "Searching",
"difficulty": "Easy",
"prerequisites": ["Arrays"]
},
"binary_search.txt": {
"topic": "Binary Search",
"category": "Searching",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Sorting"]
},
"two_pointer_technique.txt": {
"topic": "Two Pointer Technique",
"category": "Array Techniques",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Loops"]
},
"sliding_window_technique.txt": {
"topic": "Sliding Window Technique",
"category": "Array Techniques",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Two Pointer Technique"]
},
"bubble_sort.txt": {
"topic": "Bubble Sort",
"category": "Sorting",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Loops"]
},
"selection_sort.txt": {
"topic": "Selection Sort",
"category": "Sorting",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Loops"]
},
"insertion_sort.txt": {
"topic": "Insertion Sort",
"category": "Sorting",
"difficulty": "Easy",
"prerequisites": ["Arrays"]
},
"merge_sort.txt": {
"topic": "Merge Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Recursion"]
},
"quick_sort.txt": {
"topic": "Quick Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Recursion", "Divide and Conquer"]
},
"heap_sort.txt": {
"topic": "Heap Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Heap"]
},
"counting_sort.txt": {
"topic": "Counting Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Hashing"]
},
"radix_sort.txt": {
"topic": "Radix Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Counting Sort", "Number Representation"]
},
"bucket_sort.txt": {
"topic": "Bucket Sort",
"category": "Sorting",
"difficulty": "Medium",
"prerequisites": ["Arrays", "Hashing"]
},
"singly_linked_list.txt": {
"topic": "Singly Linked List",
"category": "Linked Lists",
"difficulty": "Easy",
"prerequisites": ["Pointers", "Structures"]
},
"doubly_linked_list.txt": {
"topic": "Doubly Linked List",
"category": "Linked Lists",
"difficulty": "Easy",
"prerequisites": ["Pointers", "Singly Linked List"]
},
"circular_linked_list.txt": {
"topic": "Circular Linked List",
"category": "Linked Lists",
"difficulty": "Medium",
"prerequisites": ["Linked Lists", "Pointers"]
},
"stack.txt": {
"topic": "Stack",
"category": "Stacks and Queues",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Linked Lists"]
},
"queue.txt": {
"topic": "Queue",
"category": "Stacks and Queues",
"difficulty": "Easy",
"prerequisites": ["Arrays", "Linked Lists"]
},
"circular_queue.txt": {
"topic": "Circular Queue",
"category": "Stacks and Queues",
"difficulty": "Medium",
"prerequisites": ["Queue", "Arrays"]
},
"deque.txt": {
"topic": "Deque",
"category": "Stacks and Queues",
"difficulty": "Medium",
"prerequisites": ["Queue"]
},
"monotonic_stack.txt": {
"topic": "Monotonic Stack",
"category": "Stacks and Queues",
"difficulty": "Hard",
"prerequisites": ["Stack", "Arrays"]
},
"binary_tree.txt": {
"topic": "Binary Tree",
"category": "Trees",
"difficulty": "Easy",
"prerequisites": ["Recursion"]
},
"binary_search_tree.txt": {
"topic": "Binary Search Tree",
"category": "Trees",
"difficulty": "Medium",
"prerequisites": ["Binary Tree", "Searching"]
},
"avl_tree.txt": {
"topic": "AVL Tree",
"category": "Trees",
"difficulty": "Hard",
"prerequisites": ["Binary Search Tree", "Rotations"]
},
"heap_minmax.txt": {
"topic": "Heap (Min/Max)",
"category": "Trees",
"difficulty": "Medium",
"prerequisites": ["Binary Tree", "Arrays"]
},
"trie.txt": {
"topic": "Trie",
"category": "Trees",
"difficulty": "Medium",
"prerequisites": ["Trees", "Strings"]
},
"segment_tree.txt": {
"topic": "Segment Tree",
"category": "Trees",
"difficulty": "Hard",
"prerequisites": ["Trees", "Recursion"]
},
"fenwick_tree_binary_indexed_tree.txt": {
"topic": "Fenwick Tree (Binary Indexed Tree)",
"category": "Trees",
"difficulty": "Hard",
"prerequisites": ["Arrays", "Prefix Sum"]
},
"bfs.txt": {
"topic": "Breadth-First Search",
"category": "Graph Traversal",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Queues"]
},
"dfs.txt": {
"topic": "Depth-First Search",
"category": "Graph Traversal",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Recursion", "Stacks"]
},
"dijkstras_algorithm.txt": {
"topic": "Dijkstra's Algorithm",
"category": "Graph Algorithms",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Heap", "BFS"]
},
"bellman-ford_algorithm.txt": {
"topic": "Bellman-Ford Algorithm",
"category": "Graph Algorithms",
"difficulty": "Hard",
"prerequisites": ["Graphs", "Shortest Path"]
},
"floyd-warshall_algorithm.txt": {
"topic": "Floyd-Warshall Algorithm",
"category": "Graph Algorithms",
"difficulty": "Hard",
"prerequisites": ["Graphs", "Dynamic Programming"]
},
"kruskals_algorithm_mst.txt": {
"topic": "Kruskal's Algorithm (MST)",
"category": "Minimum Spanning Tree",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Union-Find"]
},
"prims_algorithm_mst.txt": {
"topic": "Prim's Algorithm (MST)",
"category": "Minimum Spanning Tree",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Heap"]
},
"topological_sort.txt": {
"topic": "Topological Sort",
"category": "Graph Traversal",
"difficulty": "Medium",
"prerequisites": ["Graphs", "DFS"]
},
"union-find_disjoint_set.txt": {
"topic": "Union-Find (Disjoint Set)",
"category": "Graph Algorithms",
"difficulty": "Medium",
"prerequisites": ["Graphs", "Trees"]
},
"01_knapsack.txt": {
"topic": "0/1 Knapsack",
"category": "Dynamic Programming",
"difficulty": "Medium",
"prerequisites": ["Recursion", "Dynamic Programming Overview"]
},
"activity_selection_problem.txt": {
"topic": "Activity Selection Problem",
"category": "Greedy",
"difficulty": "Medium",
"prerequisites": ["Sorting", "Greedy Algorithms Overview"]
},
"backtracking_overview.txt": {
"topic": "Backtracking Overview",
"category": "Recursion and Backtracking",
"difficulty": "Medium",
"prerequisites": ["Recursion"]
},
"bit_manipulation_basics.txt": {
"topic": "Bit Manipulation Basics",
"category": "Bit Manipulation",
"difficulty": "Easy",
"prerequisites": ["Number Representation"]
},
"coin_change_problem.txt": {
"topic": "Coin Change Problem",
"category": "Dynamic Programming",
"difficulty": "Medium",
"prerequisites": ["Dynamic Programming Overview"]
},
"dynamic_programming_overview.txt": {
"topic": "Dynamic Programming Overview",
"category": "Dynamic Programming",
"difficulty": "Medium",
"prerequisites": ["Recursion"]
},
"edit_distance.txt": {
"topic": "Edit Distance",
"category": "Dynamic Programming",
"difficulty": "Hard",
"prerequisites": ["Dynamic Programming Overview", "Strings"]
},
"fractional_knapsack.txt": {
"topic": "Fractional Knapsack",
"category": "Greedy",
"difficulty": "Medium",
"prerequisites": ["Sorting", "Greedy Algorithms Overview"]
},
"greedy_algorithms_overview.txt": {
"topic": "Greedy Algorithms Overview",
"category": "Greedy",
"difficulty": "Medium",
"prerequisites": ["Sorting"]
},
"hash_set_vs_hash_map.txt": {
"topic": "Hash Set vs Hash Map",
"category": "Hashing",
"difficulty": "Easy",
"prerequisites": ["Hash Table"]
},
"hash_table.txt": {
"topic": "Hash Table",
"category": "Hashing",
"difficulty": "Easy",
"prerequisites": ["Arrays"]
},
"longest_common_subsequence.txt": {
"topic": "Longest Common Subsequence",
"category": "Dynamic Programming",
"difficulty": "Medium",
"prerequisites": ["Dynamic Programming Overview", "Strings"]
},
"longest_increasing_subsequence.txt": {
"topic": "Longest Increasing Subsequence",
"category": "Dynamic Programming",
"difficulty": "Medium",
"prerequisites": ["Dynamic Programming Overview", "Arrays"]
},
"n-queens_problem.txt": {
"topic": "N-Queens Problem",
"category": "Recursion and Backtracking",
"difficulty": "Hard",
"prerequisites": ["Backtracking Overview"]
},
"recursion_overview.txt": {
"topic": "Recursion Overview",
"category": "Recursion and Backtracking",
"difficulty": "Easy",
"prerequisites": ["Functions"]
},
"subset_sum_power_set_generation.txt": {
"topic": "Subset Sum / Power Set Generation",
"category": "Recursion and Backtracking",
"difficulty": "Medium",
"prerequisites": ["Backtracking Overview", "Bit Manipulation Basics"]
},
"xor_tricks.txt": {
"topic": "XOR Tricks",
"category": "Bit Manipulation",
"difficulty": "Medium",
"prerequisites": ["Bit Manipulation Basics"]
}
} |