Binary Search

Search in Rotated Sorted Array LeetCode Solution

Leetcode Solution / Array, Binary Search, Bloomberg, C++ Solution, Facebook, Java Solution, JavaScript Solution, LeetCode Solution, Linkedin, Medium, Microsoft, Python Solution, Uber

Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

Median of Two Sorted Arrays LeetCode Solution

Leetcode Solution / Adobe, Apple, Array, Binary Search, C++ Solution, divide and conquer, Dropbox, Google, Hard, Java Solution, JavaScript Solution, LeetCode Solution, Microsoft, Python Solution, Yahoo, Zenefits

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).