/  Back  /  Home  / 

• Algorithmic paradigms
  • Backtraking
    1. Generate permutations leetcode
    2. Generate combinations leetcode
    3. Generate all subsets of a given set leetcode
    4. Generate all Parentheses leetcode
    5. N-queens problem leetcode
    6. Sudoku leetcode
    7. Palindrome partitioning leetcode
  • Divide and conquer
    1. Merge Sort
    2. Quicksort
    3. Strassen’s algorithm for matrix multiplication: topcoder.com
    4. Towers of Hanoi: Briliant.org
    5. Majority Element: leetcode
    6. Median of Two Sorted Arrays: leetcode
  • Dynamic programming
    • Prefixes/Suffixes:
      1. TODO: Kadane
      2. TODO: Largest Sum Contiguous Subarray
      3. Largest Increasing Subsequence: topcoder.com
    • Interval:
      1. TODO: Longest Common Subsequence
      2. TODO: Edit Distance (Levenshtein distance)
      3. Bellman-Ford
      4. Floyd-Warshall
    • Bitmask:
      1. TODO: Bellman-Held-Karp (Shortest Superstring Problem)
    • Pseudo-polynomial:
      1. TODO: Rod cutting
      2. TODO: Knapsack 0-1
      3. TODO: Coin Change Problem
  • Greedy
    1. Single-Source Shortest Paths — Dijkstra’s Algorithm
    2. Kruskal’s Algorithm for finding Minimum Spanning Tree
    3. Prim’s Algorithm for finding Minimum Spanning Tree
    4. Graph Coloring Problem brilliant.org
    5. Gas Station leetcode
    6. Jump Game leetcode
    7. Container With Most Water leetcode
• Sort
• Search
• Graph
• Strings