3407. Substring Matching Pattern
3407. Substring Matching Pattern
Description
You are given a string s and a pattern string p, where p contains exactly one '*' character.
3405. Count the Number of Arrays with K Matching Adjacent Elements
3405. Count the Number of Arrays with K Matching Adjacent Elements
Description
You are given three integers n, m, k. A good array arr of size n is defined as follows:
3404. Count Special Subsequences
3404. Count Special Subsequences
Description
You are given an array nums consisting of positive integers.
3403. Find the Lexicographically Largest String From the Box I
3403. Find the Lexicographically Largest String From the Box I
Description
You are given a string word, and an integer numFriends.
3399. Smallest Substring With Identical Characters II
3399. Smallest Substring With Identical Characters II
Description
You are given a binary string s of length n and an integer numOps.
3397. Maximum Number of Distinct Elements After Operations
3397. Maximum Number of Distinct Elements After Operations
Description
You are given an integer array nums and an integer k.
3396. Minimum Number of Operations to Make Elements in Array Distinct
3396. Minimum Number of Operations to Make Elements in Array Distinct
Description
You are given an integer array nums. You need to ensure that the elements in the array are distinct . To achieve this, you can perform the following operation any number of times:
3394. Check if Grid can be Cut into Sections
3394. Check if Grid can be Cut into Sections
Description
You are given an integer n representing the dimensions of an n x n grid, with the origin at the bottom-left corner of the grid. You are also given a 2D array of coordinates rectangles, where rectangles[i] is in the form [startx, starty, endx, endy], representing a rectangle on the grid. Each rectangle is defined as follows:
3393. Count Paths With the Given XOR Value
3393. Count Paths With the Given XOR Value
Description
You are given a 2D integer array grid with size m x n. You are also given an integer k.