ThinkerQAQ

DFS

Data Structures & Algorithms · 6 notes

  1. Word Breakhistorical

    Word Break using DFS and DFS with memoization.

  2. Word Searchhistorical

    Word search in a two-dimensional grid using DFS.

  3. Longest Common Substringhistorical

    A note for the longest common substring problem.

  4. Longest Common Subsequencehistorical

    Longest common subsequence using recursion, DFS with memoization, and dynamic programming.

  5. Letter Combinations of a Phone Numberhistorical

    Letter combinations of a phone number using DFS to enumerate combinations.

  6. Edit Distancehistorical

    Edit distance using recursion and recursion with memoization.