An interesting problem I've run to recently is the following (I tried to express it using Jon Bentley's convention): Input: Two sorted integer arrays A and B in increasing order and of different sizes N and M, respectively. Output: A sorted integer array C in increasing order that contains elements that appear in both A and B Contraints: No duplicates are allowed in C Example: For input A = {3,6,8
![Intersecting Two Sorted Integer Arrays](https://cdn-ak-scissors.b.st-hatena.com/image/square/18af288dad6157b36d027dd8016a431acbca620e/height=288;version=1;width=512/http%3A%2F%2F4.bp.blogspot.com%2F-LC8f2YS94lE%2FTzvdhKexswI%2FAAAAAAAAAMA%2FOkty_oT5xhI%2Fw1200-h630-p-k-no-nu%2Fchart3.png)