leetcode508. Most Frequent Subtree Sum

2019-11-14

1.6k
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return al...

leetcode506. Relative Ranks

2019-11-12

1.7k
Given scores ofNathletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".

2019-11-10

2k

leetcode452. Minimum Number of Arrows to Burst Balloons

2019-11-08

1.6k
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is ...

2019-11-08

2.5k

leetcode421. Maximum XOR of Two Numbers in an Array

2019-11-06

1.7k
Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai&lt; 231.

2019-11-03

8.3k

leetcode472. Concatenated Words

2019-11-01

2.5k
Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words.A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the given array.

leetcode501. Find Mode in Binary Search Tree

2019-10-31

1.7k
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.

leetcode473. Matchsticks to Square

2019-10-30

1.3k
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

leetcode493. Reverse Pairs

2019-10-29

1.8k
Given an array nums , we call(i, j)an important reverse pair if i &lt; j andnums[i] &gt; 2*nums[j].

2019-10-23

1.3k

2019-10-15

1.9k

2019-10-15

2.5k

2019-10-14

1.7k

2019-10-12

2k

2019-10-11

1.6k

2019-10-09

2.1k

2019-10-08

1.5k

2019-10-07

2.7k

2019-10-06

1.7k

2019-10-05

1.6k

2019-10-02

1.7k

2019-10-02

1.7k

2019-09-30

1.7k

2019-09-29

1.2k

2019-09-29

14.9k

2019-08-10

1.6k

2019-08-10

1.4k

2019-07-02

1.9k