{
   "backtracking": {
      "list": {
         "knight's_tour": "Knights tour problem",
         "n_queens": "N Queens Problem"
      },
      "name": "Backtracking"
   },
   "cryptography": {
      "list": {
         "affine_cipher": "Affine Cipher",
         "caesar_cipher": "Caesar Cipher"
      },
      "name": "Cryptography"
   },
   "dp": {
      "list": {
         "catalan_number": "Catalan Number",
         "fibonacci": "Fibonacci Sequence",
         "integer_partition": "Integer Partition",
         "knapsack_problem": "Knapsack Problem",
         "longest_common_subsequence": "Longest Common Subsequence",
         "longest_increasing_subsequence": "Longest Increasing Subsequence",
         "longest_palindromic_subsequence": "Longest Palindromic Subsequence",
         "max_subarray": "Maximum Subarray",
         "max_sum_path": "Maximum Sum Path",
         "pascal_triangle": "Pascal's Triangle",
         "shortest_common_supersequence": "Shortest Common Supersequence",
         "sliding_window": "Sliding Window",
         "ugly_numbers": "Ugly Numbers"
      },
      "name": "Dynamic Programming"
   },
   "graph_search": {
      "list": {
         "bellman_ford": "Bellman-Ford",
         "bfs": "BFS",
         "bridges": "Find-Bridges",
         "dfs": "DFS",
         "dls": "Depth-Limited Search",
         "dijkstra": "Dijkstra",
         "floyd_warshall": "Floyd-Warshall",
         "page_rank": "PageRank Algorithm",
         "topological_sort": "Topological-Sort"
      },
      "name": "Graph Search"
   },
   "greedy": {
      "list": {
         "job_scheduling": "Job Scheduling Problem",
         "majority_element": "Majority Element(BoyerMoore majority vote algorithm)"
      },
      "name": "Greedy"
   },
   "mst": {
      "list": {
         "kruskal": "Kruskal's Algorithm",
         "prim": "Prim's Algorithm"
      },
      "name": "Minimum Spanning Tree"
   },
   "number_theory": {
      "list": {
        "euclidean_algorithm": "Euclidean Algorithm",
        "sieve_of_eratosthenes": "Sieve of Eratosthenes"
      },
      "name": "Number Theory"
   },
   "search": {
      "list": {
         "binary_search": "Binary Search"
      },
      "name": "Search"
   },
   "sorting": {
      "list": {
         "bucket": "Bucket Sort",
         "bubble": "Bubble Sort",
         "comb": "Comb Sort",
         "counting": "Counting Sort",
         "cycle": "Cycle Sort",
         "heap": "Heapsort",
         "insertion": "Insertion Sort",
         "merge": "Merge Sort",
         "pigeonhole": "Pigeonhole Sort",
         "quick": "Quicksort",
         "radix": "Radix Sort",
         "selection": "Selection Sort",
         "shell": "Shellsort",
         "pancake": "Pancake Sort"
      },
      "name": "Sorting"
   },
   "string": {
      "list": {
         "edit_distance": "Edit Distance",
         "knuth_morris_pratt": "KMP Substring Search",
         "rabin_karp_algorithm": "Rabin-Karp Algorithm",
         "suffix_array": "Suffix Array (construction & usage)",
         "z_algorithm": "Z Algorithm"
      },
      "name": "String"
   },
   "tree": {
      "list": {
         "binary_search_tree": "Binary Search Tree",
         "binary_tree_traversal": "Binary Tree Traversal",
         "lowest_common_ancestor": "Lowest Common Ancestor"
      },
      "name": "Tree"
   },
   "etc": {
      "list": {
         "flood_fill": "Flood Fill",
         "cellular_automata": "Cellular Automata",
         "create_maze": "Create Maze",
         "magic_square": "Magic Square"
      },
      "name": "Uncategorized"
   }
}