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 c...

hard

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, th...

hard

300. Longest Increasing Subsequence

Problem Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is an a...

medium hard

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 store...

hard

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,...

hard

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-l...

hard

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] = [...

hard

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 labell...

hard

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_i, y_i, r_i] d...

hard