ThinkerQAQ

Data Structures & Algorithms

237 notes

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

  1. Regular Expression Matchinghistorical

    Regular expression matching with support for . and *.

    leetcode / 字符串
  2. Binary Search Upper Boundhistorical

    LeetCode notes on binary-search upper bound.

    leetcode / 数组 / 二分 / 上下界
  3. Longest Substring Without Repeating Charactershistorical

    Find the longest substring without repetition using a brute-force set approach and a sliding window.

    leetcode / 字符串 / 滑动窗口
  4. Find First and Last Position of Element in Sorted Arrayhistorical

    LeetCode notes on finding the first and last position of an element in a sorted array.

    leetcode / 数组 / 二分 / 上下界
  5. Evaluate Divisionhistorical

    Use weighted union-find to evaluate division relationships between variables.

    leetcode / 并查集
  6. Counting Bitshistorical

    Count the number of 1 bits in every integer from 0 through num.

    leetcode / 数字 / 位
  7. Hamming Distancehistorical

    Compute the Hamming distance between two integers using bitwise operations.

    leetcode / 数字 / 位
  8. Binary Search Upper Boundhistorical

    LeetCode notes on binary-search upper bound.

    leetcode / 数组 / 二分
  9. Reverse Integerhistorical

    Reverse the decimal digits of a 32-bit signed integer and handle overflow.

    leetcode / 数字
  10. Find First and Last Position of Element in Sorted Arrayhistorical

    LeetCode notes on finding the first and last position of an element in a sorted array.

    leetcode / 数组 / 二分