Amazon Intern Swe interview questions

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 and it will automatically contact the police if two adjacent houses were broken into on the same night. You have two Arrays A and B, Find k pairs of numbers from the array that have the greatest sum such that one number of the pair is from A and the other is from B.

Simple Bahavioral question with one leetcode medium