摘要：
Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < 阅读全文
摘要：
HTML entity parser is the parser that takes HTML code as input and replace all the entities of the special characters by the characters itself. The sp 阅读全文
摘要：
A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of c 阅读全文
摘要：
You are given a 0-indexed integer array nums. The array nums is beautiful if: nums.length is even. nums[i] != nums[i + 1] for all i % 2 == 0. Note tha 阅读全文
摘要：
Given a 0-indexed string s, permute s to get a new string t such that: All consonants remain in their original places. More formally, if there is an i 阅读全文
摘要：
There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi, weighti] represents a bidirectional and weighted edge b 阅读全文
摘要：
You are given four integers sx, sy, fx, fy, and a non-negative integer t. In an infinite 2D grid, you start at the cell (sx, sy). Each second, you mus 阅读全文
摘要：
You are given a binary string s consisting only of zeroes and ones. A substring of s is considered balanced if all zeroes are before ones and the numb 阅读全文
摘要：
Given an integer array arr of distinct integers and an integer k. A game will be played between the first two elements of the array (i.e. arr[0] and a 阅读全文
摘要：
You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers. You should rearrange the 阅读全文
摘要：
Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree. Note: Th 阅读全文
摘要：
Given a 0-indexed integer array nums, find a 0-indexed integer array answer where: answer.length == nums.length. answer[i] = |leftSum[i] - rightSum[i] 阅读全文
摘要：
(This problem is an interactive problem.) Each ship is located at an integer point on the sea represented by a cartesian plane, and each integer point 阅读全文
摘要：
You are given an integer array gifts denoting the number of gifts in various piles. Every second, you do the following: Choose the pile with the maxim 阅读全文
摘要：
A transaction is possibly invalid if: the amount exceeds $1000, or; if it occurs within (and including) 60 minutes of another transaction with the sam 阅读全文
摘要：
Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d) such that a * b = c * d where a, b, c, and d are elements 阅读全文
摘要：
Given four integers length, width, height, and mass, representing the dimensions and mass of a box, respectively, return a string representing the cat 阅读全文
摘要：
You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0. In one operation: choose an index i such that 0 <= i < 阅读全文
摘要：
Given a positive integer num, split it into two non-negative integers num1 and num2 such that: The concatenation of num1 and num2 is a permutation of 阅读全文
摘要：
There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holdin 阅读全文