LeetCode

Total Accepted: 11866 Total Submissions: 36548 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1

Total Accepted: 9358 Total Submissions: 30791 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its pat

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

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top public class Solution { publ

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?

Total Accepted: 9992 Total Submissions: 32850 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any poi

Total Accepted: 9269 Total Submissions: 36157 Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Fo

Total Accepted: 7514 Total Submissions: 27719 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space

Total Accepted: 7469 Total Submissions: 43163 Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partit