224. Basic Calculator
Problem Given a string s representing a valid expression, implement a basic calculator to evaluate it, and return the result ...
Problem Given a string s representing a valid expression, implement a basic calculator to evaluate it, and return the result ...
Problem You are given a string s. A string t is called good if all characters of t occur the same number of times. You can pe...
Problem You are given an integer array prices where prices[i] is the price of a given stock on the iᵗʰ day, and an integer k....
Problem You are given a string target, an array of strings words, and an integer array costs, both arrays of the same length....
3291. Minimum Number of Valid Strings to Form Target I 的进阶版,题目一模一样,但 words 的长度从 5 * 10³ 增加到 5 * 10⁵,target 的长度从 5 * 10³ 增加到 5...
Problem You are given an array of strings words and a string target. A string x is called valid if x is a prefix of any strin...
Problem There is a hotel with n rooms. The rooms are represented by a 2D integer array rooms where rooms[i] = [roomIdᵢ, sizeᵢ...
Problem You are given an array prices where prices[i] is the price of a given stock on the iᵗʰ day. Find the maximum profit y...
Problem You are given two 0-indexed integer arrays nums1 and nums2 of equal length. Every second, for all indices 0 <= i &...
Problem You are given an integer array nums, an integer k, and an integer multiplier. You need to perform k operations on num...
Problem You are given a 0-indexed m * n integer matrix values, representing the values of m * n different items in m differen...
Problem You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array...
Problem You are given an array pairs, where pairs[i] = [xᵢ, yᵢ], and: There are no duplicates. xᵢ < yᵢ Let ways be the n...
Problem You are given an integer n representing the length of an unknown array that you are trying to recover. You are also g...
Problem You are given an n x n binary grid board. In each move, you can swap any two rows with each other, or any two columns...
Problem There is an 8 x 8 chessboard containing n pieces (rooks, queens, or bishops). You are given a string array pieces of ...
Problem The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each oth...
Problem Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated...
Problem The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each oth...
Problem You are given a 0-indexed 2D integer array pairs where pairs[i] = [startᵢ, endᵢ]. An arrangement of pairs is valid if...
Problem You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum tim...
跟 3250. Find the Count of Monotonic Pairs I 一模一样,只不过 nums[i] 的上限从 50 增加到 1000。 https://leetcode.cn/problems/find-the-count-of...
Problem You are given an array of positive integers nums of length n. We call a pair of non-negative integer arrays (arr1, ar...
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,...