438. Find All Anagrams in a String # 题目 # Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 2
of digits match a pattern and string without using regular expressions warnsdorff's algorithm for knight's tour problem partition to k equal sum subsets print all possible path from source to destination n-queen problem print all subsequences of a string count unique path heap coding problems ...
448. Find All Numbers Disappeared in an Array # 题目# Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. Could you do it witho...
3 changes: 1 addition & 2 deletions 3 ...m-of-the-Power-of-All-Subsequences/3082.Find-the-Sum-of-the-Power-of-All-Subsequences.cpp Original file line numberDiff line numberDiff line change @@ -8,8 +8,7 @@ class Solution { int n = nums.size(); nums.insert(nums.begin(), 0)...
0097-interleaving-string.py 0098-validate-binary-search-tree.py 0100-same-tree.py 0102-binary-tree-level-order-traversal.py 0104-maximum-depth-of-binary-tree.py 0105-construct-binary-tree-from-preorder-and-inorder-traversal.py 0110-balanced-binary-tree.py 0115-distinct-...
1857-largest-color-value-in-a-directed-graph.rs 1929-concatenation-of-array.rs 1930-unique-length-3-palindromic-subsequences.rs 1963-minimum-number-of-swaps-to-make-the-string-balanced.rs 1984-minimum-difference-between-highest-and-lowest-of-k-scores.rs 2001-number-of-pairs-of-interchangeable-rec...