数组

LeetCode notes on the Next Permutation problem.

LeetCode notes on the Permutations problem.

LeetCode notes on the Subsets problem.

LeetCode notes on the Unique Paths problem.

LeetCode notes on the Number of Islands problem.

LeetCode notes on the Maximal Square problem.

LeetCode notes on the Partition Equal Subset Sum problem.

LeetCode notes on the Perfect Squares problem.

LeetCode notes on the Target Sum problem.

LeetCode notes on the Combination Sum problem.

LeetCode notes on the Coin Change problem.

LeetCode notes on the Burst Balloons problem.

LeetCode notes on the House Robber problem.

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

LeetCode notes on the Minimum Path Sum problem.

LeetCode notes on the Longest Increasing Subsequence problem.

LeetCode notes on the Jump Game problem.

LeetCode notes on the Maximum Product Subarray problem.

LeetCode notes on the Maximum Subarray problem.

LeetCode notes on the First Missing Positive problem.

LeetCode notes on the 3Sum problem.

LeetCode notes on the Find the Duplicate Number problem.

LeetCode notes on the Two Sum problem.

LeetCode notes on finding all disappeared numbers in an array.

LeetCode notes on the Subarray Sum Equals K problem.

LeetCode notes on the Longest Consecutive Sequence problem.

LeetCode notes on binary-search upper bound.

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

LeetCode notes on binary-search upper bound.

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

LeetCode notes on searching in a rotated sorted array.

LeetCode notes on searching in a rotated sorted array.

Merge two sorted integer arrays into one sorted array.

LeetCode notes on the Find Peak Element problem.

Find the K-th largest element in an array using sorting or quicksort partitioning.

Use binary search to find a target value in a sorted ascending integer array.

LeetCode notes on finding the minimum in a rotated sorted array.

LeetCode notes on computing an integer square root.

Traverse a matrix in clockwise spiral order.

Find the smallest letter greater than the target in a cyclically ordered character list.

LeetCode notes on the Trapping Rain Water problem.

LeetCode notes on the Container With Most Water problem.

Sort first and then insert by position to reconstruct a queue described by height and preceding-person counts.

Rearrange non-negative integers so their concatenation forms the largest integer.

Find the top K frequent elements using frequency counting with sorting or a min-heap.

Find the majority element using a counting map or candidate cancellation.

Find the element that appears only once using counting or XOR.

Move all zeroes to the end of the array while preserving the relative order of non-zero elements.

Compute the product of array elements except self using left and right product arrays.

Sort 0, 1, and 2 in place using quicksort, bucket sort, or the move-zeroes idea.

Search a matrix whose rows and columns are both sorted, starting from the top-right corner.

LeetCode notes on the Maximum Product Subarray problem.

LeetCode notes on the brute-force solution for Subarray Sum Equals K.

LeetCode notes on the brute-force solution for Maximal Square.

LeetCode notes on the brute-force solution for Daily Temperatures.

LeetCode notes on Daily Temperatures with brute force and a monotonic stack.

LeetCode notes on Sliding Window Maximum using brute force, a priority queue, and a monotonic deque.

LeetCode notes on merging overlapping intervals.

LeetCode notes on implementing a stack that retrieves the minimum element in constant time.

LeetCode notes on sorting an array with merge sort and quicksort.

LeetCode notes on finding the median of two sorted arrays by merging them.

LeetCode notes on the Jump Game problem.

LeetCode notes on finding the shortest continuous subarray that must be sorted.

LeetCode notes on maximizing profit from one stock transaction.

LeetCode notes on rotating an n x n matrix 90 degrees clockwise.