LeetCode

Total Accepted: 12408 Total Submissions: 34893

Longest Consecutive Sequence  Total Accepted: 17029 Total Submissions: 61041My Submissions Given an unsorted array of integers, find the length of the longest consecutive elements sequence

Valid Sudoku   Total Accepted: 12421 Total Submissions: 44620

Search in Rotated Sorted Array II  Total Accepted: 14625 Total Submissions: 47745 Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-

Total Accepted: 10972 Total Submissions: 40240

Total Accepted: 11464 Total Submissions: 40857

Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space?

Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]

Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3], Your function should return length = 5, and A is now [1,1,2,2,

Total Accepted: 9100 Total Submissions: 29949 Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place with c

Total Accepted: 8954 Total Submissions: 33737 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the foll

Total Accepted: 11913 Total Submissions: 37576 Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equ

Total Accepted: 12576 Total Submissions: 41038 Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one tran

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of