3306. Count of Substrings Containing Every Vowel and K Consonants II
3306. Count of Substrings Containing Every Vowel and K Consonants II
Description
You are given a string word and a non-negative integer k.
3303. Find the Occurrence of First Almost Equal Substring
3303. Find the Occurrence of First Almost Equal Substring
Description
You are given two strings s and pattern.
3302. Find the Lexicographically Smallest Valid Sequence
3302. Find the Lexicographically Smallest Valid Sequence
Description
You are given two strings word1 and word2.
3301. Maximize the Total Height of Unique Towers
3301. Maximize the Total Height of Unique Towers
Description
You are given an array maximumHeight, where maximumHeight[i] denotes the maximum height the i^th tower can be assigned.
3298. Count Substrings That Can Be Rearranged to Contain a String II
3298. Count Substrings That Can Be Rearranged to Contain a String II
Description
You are given two strings word1 and word2.
3296. Minimum Number of Seconds to Make Mountain Height Zero
3296. Minimum Number of Seconds to Make Mountain Height Zero
Description
You are given an integer mountainHeight denoting the height of a mountain.
3292. Minimum Number of Valid Strings to Form Target II
3292. Minimum Number of Valid Strings to Form Target II
Description
You are given an array of strings words and a string target.
3291. Minimum Number of Valid Strings to Form Target I
3291. Minimum Number of Valid Strings to Form Target I
Description
You are given an array of strings words and a string target.
3290. Maximum Multiplication Score
3290. Maximum Multiplication Score
Description
You are given an integer array a of size 4 and another integer array b of size at least 4.
3288. Length of the Longest Increasing Path
3288. Length of the Longest Increasing Path
Description
You are given a 2D array of integers coordinates of length n and an integer k, where 0 <= k < n.