10. Regular Expression Matching
10. Regular Expression Matching
Description
Given an input string s
and a pattern p
, implement regular expression matching with support for '.'
and '*'
where:
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.
3251. Find the Count of Monotonic Pairs II
You are given an array of positive integers nums
of length n
.
3250. Find the Count of Monotonic Pairs I
You are given an array of positive integers nums
of length n
.
3249. Count the Number of Good Nodes
There is an undirected tree with n
nodes labeled from 0
to n - 1
, and rooted at node 0
. You are given a 2D integer array edges
of length n - 1
, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.
3244. Shortest Distance After Road Addition Queries II
You are given an integer n
and a 2D integer array queries
.
3243. Shortest Distance After Road Addition Queries I
You are given an integer n
and a 2D integer array queries
.