Given an array of size n, how do you find all the possible subsets of the array of size k?
How do I write a program that, given two sorted arrays of N int values, prints all elements that appear in both arrays, in sorted order?