2290. Minimum Obstacle Removal to Reach Corner
Problem You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values: 0 represents an empt...
Problem You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values: 0 represents an empt...
Problem A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecti...
Problem You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one numbe...
Problem Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be cons...
Problem Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every c...
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...
Problem Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is an a...
Problem Serialization is the process of converting a data structure or object into a sequence of bits so that it can be store...
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,...
Problem You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-l...
Problem You are given a binary string s and an integer k. You are also given a 2D integer array queries, where queries[i] = [...
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...
Problem You are given two positive integers xCorner and yCorner, and a 2D array circles, where circles[i] = [xᵢ, yᵢ, rᵢ] deno...