原文链接: https://leetcode-cn.com/problems/split-a-string-into-the-max-number-of-unique-substrings 英文原文Given a string s, return the maximum number of unique substrings that the given string can be split into. You can split string s into any list of non-e…

原文链接: https://leetcode-cn.com/problems/minimum-cost-to-connect-two-groups-of-points 英文原文You are given two groups of points where the first group has size1 points, the second group has size2 points, and size1 >= size2. The cost of the connection betwe…

原文链接: https://leetcode-cn.com/problems/crawler-log-folder 英文原文The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../" : Move to the parent folder of the current folder. (I…

原文链接: https://leetcode-cn.com/problems/maximum-profit-of-operating-a-centennial-wheel 英文原文You are the operator of a Centennial Wheel that has four gondolas, and each gondola has room for up to four people. You have the ability to rotate the gondolas …

原文链接: https://leetcode-cn.com/problems/throne-inheritance 英文原文A kingdom consists of a king, his children, his grandchildren, and so on. Every once in a while, someone in the family dies or a child is born. The kingdom has a well-defined order of inhe…

原文链接: https://leetcode-cn.com/problems/maximum-number-of-achievable-transfer-requests 英文原文We have n buildings numbered from 0 to n - 1. Each building has a number of employees. It's transfer season, and some employees want to change the building they…

原文链接: https://leetcode-cn.com/problems/number-of-sets-of-k-non-overlapping-line-segments 英文原文Given n points on a 1-D plane, where the ith point (from 0 to n-1) is at x = i, find the number of ways we can draw exactly k non-overlapping line segments s…

原文链接: https://leetcode-cn.com/problems/coordinate-with-maximum-network-quality 英文原文You are given an array of network towers towers, where towers[i] = [xi, yi, qi] denotes the ith network tower with location (xi, yi) and quality factor qi. All the coo…

原文链接: https://leetcode-cn.com/problems/fancy-sequence 英文原文Write an API that generates fancy sequences using the append, addAll, and multAll operations. Implement the Fancy class: Fancy() Initializes the object with an empty sequence. void append(val)…

原文链接: https://leetcode-cn.com/problems/special-array-with-x-elements-greater-than-or-equal-x 英文原文You are given an array nums of non-negative integers. nums is considered special if there exists a number x such that there are exactly x numbers in nums…

原文链接: https://leetcode-cn.com/problems/even-odd-tree 英文原文A binary tree is named Even-Odd if it meets the following conditions: The root of the binary tree is at level index 0, its children are at level index 1, their children are at level index 2, et…

原文链接: https://leetcode-cn.com/problems/minimum-one-bit-operations-to-make-integers-zero 英文原文Given an integer n, you must transform it into 0 using the following operations any number of times: Change the rightmost (0th) bit in the binary representati…

原文链接: https://leetcode-cn.com/problems/maximum-number-of-visible-points 英文原文You are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordinates on the X-Y plane. …

原文链接: https://leetcode-cn.com/problems/maximum-nesting-depth-of-the-parentheses 英文原文A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string "", or a single character not equal to "(" or ")", It can…

原文链接: https://leetcode-cn.com/problems/split-two-strings-to-make-palindrome 英文原文You are given two strings a and b of the same length. Choose an index and split both strings at the same index, splitting a into two strings: aprefix and asuffix where a …

原文链接: https://leetcode-cn.com/problems/count-subtrees-with-max-distance-between-cities 英文原文There are n cities numbered from 1 to n. You are given an array edges of size n-1, where edges[i] = [ui, vi] represents a bidirectional edge between cities ui …

原文链接: https://leetcode-cn.com/problems/sort-array-by-increasing-frequency 英文原文Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasin…

原文链接: https://leetcode-cn.com/problems/widest-vertical-area-between-two-points-containing-no-points 英文原文Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the are…

原文链接: https://leetcode-cn.com/problems/count-substrings-that-differ-by-one-character 英文原文Given two strings s and t, find the number of ways you can choose a non-empty substring of s and replace a single character by a different character such that th…

原文链接: https://leetcode-cn.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary 英文原文You are given a list of strings of the same length words and a string target. Your task is to form target using the given words under the following r…

原文链接: https://leetcode-cn.com/problems/largest-substring-between-two-equal-characters 英文原文Given a string s, return the length of the longest substring between two equal characters, excluding the two characters. If there is no such substring return -1…

原文链接: https://leetcode-cn.com/problems/lexicographically-smallest-string-after-applying-operations 英文原文You are given a string s of even length consisting of digits from 0 to 9, and two integers a and b. You can apply either of the following two opera…

原文链接: https://leetcode-cn.com/problems/best-team-with-no-conflicts 英文原文You are the manager of a basketball team. For the upcoming tournament, you want to choose the team with the highest overall score. The score of the team is the sum of scores of al…

原文链接: https://leetcode-cn.com/problems/slowest-key 英文原文A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time. You are given a string keysPressed of length n, where keysPressed[i] was the ith key pressed in the…

原文链接: https://leetcode-cn.com/problems/arithmetic-subarrays 英文原文A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is the same. More formally, a sequence s is …

原文链接: https://leetcode-cn.com/problems/path-with-minimum-effort 英文原文You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are si…

原文链接: https://leetcode-cn.com/problems/defuse-the-bomb 英文原文You have a bomb to defuse, and your time is running out! Your informer will provide you with a circular array code of length of n and a key k. To decrypt the code, you must replace every numb…

原文链接: https://leetcode-cn.com/problems/minimum-deletions-to-make-string-balanced 英文原文You are given a string s consisting only of characters 'a' and 'b'​​​​. You can delete any number of characters in s to make s balanced. s is balanced if there is no…

原文链接: https://leetcode-cn.com/problems/minimum-jumps-to-reach-home 英文原文A certain bug's home is on the x-axis at position x. Help them get there from position 0. The bug jumps according to the following rules: It can jump exactly a positions forward (…

原文链接: https://leetcode-cn.com/problems/distribute-repeating-integers 英文原文You are given an array of n integers, nums, where there are at most 50 unique values in the array. You are also given an array of m customer order quantities, quantity, where qu…