排序

三数之和

Given an integer array, return all unique triplets where the sum is zero using two-pointer scanning with careful duplica…

最接近的三数之和

Find the sum of three integers in an array that is closest to a given target using two-pointer scanning.

四数之和

The 4Sum problem requires finding all unique quadruplets in an array that sum to a specific target value.

全排列 II

Generate all unique permutations of an array containing duplicates using backtracking and pruning to avoid repeated sequ…

字母异位词分组

Group the anagrams in a list of strings using efficient hash table-based methods, focusing on array scanning.

合并区间

Merge Intervals requires sorting an array of interval pairs and combining overlaps efficiently using sequential comparis…

颜色分类

Sort Colors requires in-place reordering of an array using a two-pointer scanning strategy to group 0s, 1s, and 2s effic…

合并两个有序数组

Merge two sorted arrays into the first array in non-decreasing order, using a two-pointer approach.

对链表进行插入排序

Sort a singly linked list using insertion sort by carefully manipulating pointers to maintain a sorted order efficiently…

排序链表

Sort List requires sorting a singly linked list efficiently using pointer manipulation and merge sort for optimal perfor…

最大间距

Find the largest difference between successive elements in a sorted array efficiently using linear time techniques and b…

多数元素

Find the majority element in an array, where the element appears more than n/2 times, using efficient algorithms.

最大数

The problem asks to arrange integers to form the largest possible number, focusing on greedy algorithms and string handl…

数组中的第K个最大元素

Find the kth largest element in an unsorted array using optimal approaches like Quickselect or heaps.

存在重复元素

Determine if an integer array contains any duplicate values by efficiently scanning with a hash lookup to ensure fast de…

存在重复元素 III

The problem involves finding a pair of indices in an array where the index and value differences are within given limits…

多数元素 II

Identify all elements in an integer array appearing more than ⌊ n/3 ⌋ times using efficient array scanning and hash coun…

有效的字母异位词

Check if two strings are anagrams using hashing or sorting techniques.

丢失的数字

Find the missing number in an array containing distinct numbers in the range [0, n].

H 指数

Determine a researcher's h-index by analyzing citations using array sorting and counting techniques efficiently and accu…

数据流的中位数

Implement a MedianFinder class that supports adding numbers and finding the median from a data stream.

摆动排序 II

Rearrange an array in a way that every odd-indexed element is greater than its adjacent even-indexed elements.

前 K 个高频元素

Find the k most frequent elements from an array using efficient algorithms like hashing and sorting.

两个数组的交集

Find the intersection of two arrays while ensuring unique elements using efficient array scanning and hash lookups.