全站内容
hard
76. Minimum Window Substring
#Problem Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty …
3244. Shortest Distance After Road Addition Queries II
#Problem You are given an integer n and a 2D integer array queries. There are n cities numbered from 0 to n - 1. Initially, there is a unidirectional road from city i to city i + 1 for all 0 <= i < n - 1. queries[i] = [uᵢ, vᵢ] represents …
300. Longest Increasing Subsequence
#Problem Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the …
297. Serialize and Deserialize Binary Tree
#Problem Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the …
295. Find Median from Data Stream
#Problem The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of the two middle values. For example, for arr = [2,3,4], the median is 3. For …
23. Merge k Sorted Lists
#Problem You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. https://leetcode.com/problems/merge-k-sorted-lists/ Example 1: …
3261. Count Substrings That Satisfy K-Constraint II
#Problem You are given a binary string s and an integer k. You are also given a 2D integer array queries, where queries[i] = [lᵢ, rᵢ]. A binary string satisfies the k-constraint if either of the following conditions holds: The number of 0’s …
1547. Minimum Cost to Cut a Stick
#Problem Given a wooden stick of length n units. The stick is labelled from 0 to n. For example, a stick of length 6 is labelled as follows: stickGiven an integer array cuts where cuts[i] denotes a position you should perform a cut at. You …
3235. Check if the Rectangle Corner Is Reachable
#Problem You are given two positive integers xCorner and yCorner, and a 2D array circles, where circles[i] = [xᵢ, yᵢ, rᵢ] denotes a circle with center at (xᵢ, yᵢ) and radius rᵢ. There is a rectangle in the coordinate plane with its bottom …