I have given my Google Phone screening interview, here's the question asked:

Given a list of pairs which represent length and width of a rectangle, you need to find the maximum level possible.

A level is like If you insert a small rectangle inside a large one, the level is one and If we're inserting another smaller inside this small rectangle, the level is 2.

I have first given a iterative solution with a couple of loops for brute force approach, but then the interviewer asked to dry run for an example and I immediately understood this is DP.

I have changed my code and the interviewer seems happy after I've memoized and explained TC and SC.