ThinkerQAQ

Data Structures & Algorithms

237 notes

Some notes are currently available only in Chinese. English translations are shown when available.

  1. Partition Equal Subset Sumhistorical

    LeetCode notes on the Partition Equal Subset Sum problem.

    leetcode / 数组 / DFS / 求和
  2. Word Breakhistorical

    Word Break using DFS and DFS with memoization.

    leetcode / 字符串 / DFS
  3. Perfect Squareshistorical

    LeetCode notes on the Perfect Squares problem.

    leetcode / 数组 / DFS / 求和
  4. Word Searchhistorical

    Word search in a two-dimensional grid using DFS.

    leetcode / 字符串 / DFS
  5. Target Sumhistorical

    LeetCode notes on the Target Sum problem.

    leetcode / 数组 / DFS / 求和
  6. Longest Common Substringhistorical

    A note for the longest common substring problem.

    leetcode / 字符串 / DFS
  7. Combination Sumhistorical

    LeetCode notes on the Combination Sum problem.

    leetcode / 数组 / DFS / 求和
  8. Design an LRU Cachehistorical

    Design an LRU cache with a map and a doubly linked list, with Go and Java implementations.

    leetcode / lru
  9. Coin Changehistorical

    LeetCode notes on the Coin Change problem.

    leetcode / 数组 / DFS / 求和
  10. Longest Common Subsequencehistorical

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

    leetcode / 字符串 / DFS