Note: This is Part II of the article: The Painter’s Partition Problem. Please read Part I for more background information.

# Category Archives: binary search

# Find the k-th Smallest Element in the Union of Two Sorted Arrays

Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no duplicate elements.

# Finding intersection of two sorted arrays

Find the intersection of two sorted arrays.