ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Burst Balloonshistorical

    LeetCode notes on the Burst Balloons problem.

    leetcode / 数组 / DFS / 求最值
  2. Letter Combinations of a Phone Numberhistorical

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

    leetcode / 字符串 / DFS
  3. House Robberhistorical

    LeetCode notes on the House Robber problem.

    leetcode / 数组 / DFS / 求最值
  4. Edit Distancehistorical

    Edit distance using recursion and recursion with memoization.

    leetcode / 字符串 / DFS
  5. Best Time to Buy and Sell Stock with Cooldownhistorical

    LeetCode notes on the Best Time to Buy and Sell Stock with Cooldown problem.

    leetcode / 数组 / DFS / 求最值
  6. Group Anagramshistorical

    Group anagrams using a brute-force method and hashing.

    leetcode / 字符串 / map
  7. Minimum Path Sumhistorical

    LeetCode notes on the Minimum Path Sum problem.

    leetcode / 数组 / DFS / 求最值
  8. Find All Anagrams in a Stringhistorical

    Find all anagrams in a string using brute force and a sliding window with counts.

    leetcode / 字符串 / map
  9. Longest Increasing Subsequencehistorical

    LeetCode notes on the Longest Increasing Subsequence problem.

    leetcode / 数组 / DFS / 求最值
  10. Longest Common Prefixhistorical

    Longest common prefix using a brute-force approach, with a trie idea noted.

    leetcode / 字符串 / map