The interview began with an initial exchange of intros. Then, two DSA questions were asked. Once I wrote the code, I was asked to dry-run it. The interview was 45 minutes long.

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. The only constraint stopping you from robbing each of them is that adjacent houses have security systems connected. These systems will automatically contact the police if two adjacent houses are broken into on the same night.

You have two arrays, A and B. Find k pairs of numbers, one from A and one from B, that have the greatest sum.