摘要：
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 n 阅读全文
摘要：
Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 阅读全文
摘要：
You are given a directed graph with n nodes labeled from 0 to n - 1, where each node has exactly one outgoing edge. The graph is represented by a give 阅读全文
摘要：
You are given an n x n integer matrix grid. Generate an integer matrix maxLocal of size (n - 2) x (n - 2) such that: maxLocal[i][j] is equal to the la 阅读全文
摘要：
Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentia 阅读全文
摘要：
On a single-threaded CPU, we execute a program containing n functions. Each function has a unique ID between 0 and n-1. Function calls are stored in a 阅读全文
摘要：
You are given a stream of records about a particular stock. Each record contains a timestamp and the corresponding price of the stock at that timestam 阅读全文
摘要：
There are n cars going to the same destination along a one-lane road. The destination is target miles away. You are given two integer array position a 阅读全文
摘要：
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level x such that the sum 阅读全文
摘要：
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 a including multiplicity. For exa 阅读全文
摘要：
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possibl 阅读全文
摘要：
Design a data structure that simulates an in-memory file system. Implement the FileSystem class: FileSystem() Initializes the object of the system. Li 阅读全文
摘要：
A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the di 阅读全文
摘要：
Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s. A subsequence of a string is a new string ge 阅读全文
摘要：
You are given an array of strings products and a string searchWord. Design a system that suggests at most three product names from products after each 阅读全文
摘要：
You are given two string arrays username and website and an integer array timestamp. All the given arrays are of the same length and the tuple [userna 阅读全文
摘要：
Let's define a function countUniqueChars(s) that returns the number of unique characters on s. For example, calling countUniqueChars(s) if s = "LEETCO 阅读全文
摘要：
You are given an integer array nums. The range of a subarray of nums is the difference between the largest and smallest element in the subarray. Retur 阅读全文
摘要：
Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may be large, return 阅读全文
摘要：
Given two nodes of a binary tree p and q, return their lowest common ancestor (LCA). Each node will have a reference to its parent node. The definitio 阅读全文