Tag Archives: LeetCode

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. Actually I got no trick for this problem, I just find […]

Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = “ADOBECODEBANC” T = “ABC” Minimum window is “BANC”. The basic idea is to find a window which contain all characters in T first, this window does not necessary to be optimize, […]

Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’. A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region . The trick is to search from the edge, but not inside the whole region. These 4 images show how the trick works.

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. At first my thought was, given 2 points, we can get a line which connect these two points, and this line can be designated as: y =  k x + b Assume one of the two points is […]