Problem Given an array of characters chars, compress it using the following algorithm: Begin with an empty string s. For each...

跟 3254. Find the Power of K-Size Subarrays I 一模一样，只不过 n 的上限从 500 增加到 10⁵。 https://leetcode.cn/problems/find-the-power-of-k-si...

Problem You are given an array of integers nums of length n and a positive integer k. The power of an array is defined as: I...

Problem Given a non-negative integer c, decide whether there’re two integers a and b such that a² + b² = c. https://leetcode....

Problem There is a circle of red and blue tiles. You are given an array of integers colors and an integer k. The color of til...

Problem In LeetCode Store, there are n items to sell. Each item has a price. However, there are some special offers, and a sp...

Problem You are given two integer arrays energyDrinkA and energyDrinkB of the same length n by a futuristic sports scientist....

Problem There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG. You are given the inte...

Problem Given two integers a and b, return the sum of the two integers without using the operators + and -. https://leetcode....

Problem You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed...

Problem Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements o...

Problem Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According...

Problem Given an array of distinct integers nums and a target integer target, return the number of possible combinations that...

Problem Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder i...

Problem Given the root of a binary search tree, and an integer k, return the kᵗʰ smallest value (1-indexed) of all the values...

Problem Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, le...

Problem Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subse...

Problem Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follo...

Problem Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any o...

Problem You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mappin...

Problem You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed...

Problem Design a data structure that supports adding new words and finding if a string matches any previously added string. I...

Problem A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a...

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 2 positive integers l and r. For any number x, all positive divisors of x except x are called the prope...

Problem Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be co...

Problem Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0’s. You must do it in pla...

Problem Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islan...

Problem You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed...

Problem You are given an integer array coins representing coins of different denominations and an integer amount representing...

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 There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robo...