Smarking Algorithm Contest 2是LeetCode举办的第十场正式周赛，共4道题目，比赛时长2.5小时。
比赛链接：https://leetcode.com/contest/smarking-algorithm-contest-2/
题解列表：
LeetCode 435. Non-overlapping Intervals
档案日期2016的43
2016年10月24日 - 2016年10月30日
[LeetCode]Smarking Algorithm Contest 2解题报告
[LeetCode]Sequence Reconstruction
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 444. Sequence Reconstruction
Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the integers from 1 to n, with 1 ≤ n ≤ 104 ...
[LeetCode]Arranging Coins
作者是
发布于
在
LeetCode.
题目描述：
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
Given n, find the total number of full staircase ...
[LeetCode]Find Right Interval
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 436. Find Right Interval
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i ...
[LeetCode]Non-overlapping Intervals
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 435. Non-overlapping Intervals
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Note:
- You may assume the interval's end point is always bigger than ...