摘要：
The problem:Sort a linked list inO(nlogn) time using constant space complexity.My analysis:The idea behind this problem is easy : merge sort !But we s... 阅读全文
摘要：
The problem:Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must b... 阅读全文
摘要：
The problem:Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a... 阅读全文
摘要：
Problem:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target... 阅读全文
摘要：
The problem:Implementint sqrt(int x).Compute and return the square root ofx.My analysis:The problem could be solved amazingly by using binary search.W... 阅读全文