Google | Interview experiences | L4 | 2022 | Set-61

Question

Answer 1

Didn't have any technical phone screen. Had 3 coding rounds and 1 googliness.

 

Round 1:
Main question was simple coin change. Given a set of coins, output number of ways you can make from [1 to sum].
Given coins = [2, 5, 6] and target 10, return output [1 0 1 0 1 1 2 1 2 1 3].

 

Follow up was given the output like [1 0 1 0 1 1 2 1 2 1 3] return the possible set of coins. if it's not possible return -1.

 

Round 2:
Given a set of intervals, count number of overlapping intervals. Binary search.

 

Round 3:
Similar to jump game. Solved with dp in o(n^2) later with o(n).
Eg: stones = [1 0 4 6 3 2 4 2 1] = 6 * 4 + 3 * 4 + 2 * 1 + 1 * 1.
you start before the start index and you aim to reach the end with max score. if you jump from j to i the score is calculated as abs(i-j) * stones[i].

 

Round 4:
Googliness. Around 5-7 HR questions.