Google

1st round: Coding Asked about a data structure for efficient caching and how to implement it using a list versus a dictionary. Then discussed a medium-level Dynamic Programming question. Was not able to provide the most optimal solution.

You are given pi in the form of a string, e.g., `pi = "314159265359"`. You have to return a list of indices where `i = pi[i]`. Consider 1-based indices. For multi-digit indices, this is the matching criteria: If `i = 456`, then `pi[454] = '4'`, `p

One coding question regarding Trees was not very clear to me. I should have clarified the question before going for the solution. This was the first DSA round. Before that, I had a telephonic conversation with HR.