Problem You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge. Th...

Problem There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1. The edges in the graph...

Problem There exist two undirected trees with n and m nodes, numbered from 0 to n - 1 and from 0 to m - 1, respectively. You ...

Problem A company is organizing a meeting and has a list of n employees, waiting to be invited. They have arranged for a larg...

Problem In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all othe...

Problem There is a strange printer with the following two special requirements: On each turn, the printer will print a solid...

Problem You are given a 0-indexed array heights of positive integers, where heights[i] represents the height of the iᵗʰ build...

Problem There is a strange printer with the following two special properties: The printer can only print a sequence of the s...

Problem You are given an array points, an integer angle, and your location, where location = [pos_x, pos_y] and points[i] = [...

Problem There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 2D integer array ...

Problem Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of ev...

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 (rep...

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