3258. Count Substrings That Satisfy K-Constraint I
3258. Count Substrings That Satisfy K-Constraint I
Description
You are given a binary string s
and an integer k
.
3258. Count Substrings That Satisfy K-Constraint I
You are given a binary string s
and an integer k
.
3257. Maximum Value Sum by Placing Three Rooks II
You are given a m x n
2D array board
representing a chessboard, where board[i][j]
represents the value of the cell (i, j)
.
3255. Find the Power of K-Size Subarrays II
You are given an array of integers nums
of length n
and a positive integer k
.
3254. Find the Power of K-Size Subarrays I
You are given an array of integers nums
of length n
and a positive integer k
.
3235. Check if the Rectangle Corner Is Reachable
You are given two positive integers xCorner
and yCorner
, and a 2D array circles
, where circles[i] = [xi, yi, ri] denotes a circle with center at (xi, yi) and radius ri.
10. Regular Expression Matching
Given an input string s
and a pattern p
, implement regular expression matching with support for '.'
and '*'
where:
787. Cheapest Flights Within K Stops
There are n
cities connected by some number of flights. You are given an array flights
where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei.