Problem Given an integer rowIndex, return the rowIndexᵗʰ (0-indexed) row of the Pascal’s triangle. In Pascal’s triangle, each...

Problem There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array pr...

Problem You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element n...

Problem You are given a 0-indexed array of positive integers nums and a positive integer limit. In one operation, you can cho...

Problem You are given a 0-indexed 2D integer array transactions, where transactions[i] = [costᵢ, cashbackᵢ]. The array descri...

Problem There exists an undirected tree rooted at node 0 with n nodes labeled from 0 to n - 1. You are given a 2D integer arr...

Problem You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell t...

Problem There are 3n piles of coins of varying size, you and your friends will take piles of coins as follows: In each step,...

Problem You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (...

Problem There are n piles of coins on a table. Each pile consists of a positive number of coins of assorted denominations. In...

Problem You are given a 0-indexed integer array arr, and an m x n integer matrix mat. arr and mat both contain all the intege...

Problem Given an integer array nums of size n, return the number with the value closest to 0 in nums. If there are multiple a...

Problem Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water ...

Problem Alice is texting Bob using her phone. The mapping of digits to letters is shown in the figure below. In order to add...

Problem Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently...

Problem 跟 3095. Shortest Subarray With OR at Least K I 一模一样，只是问题规模更大。 https://leetcode.cn/problems/shortest-subarray-with-or-...

Problem A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary ar...

Problem You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array,...

Problem You are given an array nums of non-negative integers and an integer k. An array is called special if the bitwise OR o...

Problem Given two positive integers num1 and num2, find the positive integer x such that: x has the same number of set bits ...

Problem You are given a 0-indexed integer array nums, and an integer k. In one operation, you will: Take the two smallest in...

Problem You are given two 0-indexed integer permutations A and B of length n. A prefix common array of A and B is an array C ...

Problem You are given a 0-indexed integer array nums, and an integer k. In one operation, you can remove one occurrence of th...

Problem You are given a 2D integer array intervals, where intervals[i] = [lᵢ, rᵢ, weightᵢ]. Interval i starts at position lᵢ ...

Problem You are given a string s. You can perform the following process on s any number of times: Choose an index i in the s...

Problem A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following condit...

Problem The bitwise AND of an array nums is the bitwise AND of all integers in nums. For example, for nums = [1, 5, 3], the ...

Problem Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strin...

Problem You are given three positive integers num1, num2, and num3. The key of num1, num2, and num3 is defined as a four-digi...

Problem You are given two string arrays words1 and words2. A string b is a subset of string a if every letter in b occurs in ...

Problem You are given an array of strings words and a string pref. Return the number of strings in words that contain pref as...

Problem 跟 3297. Count Substrings That Can Be Rearranged to Contain a String I 一模一样，只是多了一个注意点： Note that the memory limits in ...