https://www.lintcode.com/problem/183 The obvious intuition is to try every possible length to cut the wood and see if they meet the requirement, during which we find the max value. So this is similar to search through a number within a range… Read More »Lintcode 183 Wood Cut
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description Obviously this problem can be solved by looping through the array once and find the first element that’s smaller then the previous one. Easy! But we are actually asked to solve it in O(log n) time. As soon as… Read More »Leetcode 153 Find Minimum in Rotated Sorted Array
https://leetcode.com/problems/heaters/description This is a very interesting problem because it has a couple of train of thoughts for the solution. First let’s take a look at the assumptions, looks like the heaters and houses are not guaranteed to be sorted arrays.… Read More »Leetcode 475 Heaters