google logo
Google· SWE3

Google Phone screen | SWE3 | SWEIII | L4 | Bangalore

Location
Bangalore
Posted
22 Dec 2024
463 reads

Summary

I recently had a phone screen interview with Google for the SWE3 position in Bangalore. During the interview, I was presented with a challenging string manipulation problem involving index matching.

How it went

I had a phone screen interview with Google for the SWE3 role in Bangalore. The interviewer presented a rather interesting problem centered around string processing and index matching. The problem involved working with a large string representing pi and finding specific indices that matched their corresponding digits in a 1-based indexing system, which required careful handling of multi-digit indices.

Questions asked (1)

  1. 01

    Pi String Index Match

    Data Structures & Algorithms · Medium

    You are given pi in form of a string e.g. pi = "314159265359". You have to return a list of indexes where i = pi[i].

    • Consider 1 based indexes.
    • For multi digit indexes this is the matching criteria: i = 456 and pi[454] = '4' pi[455] = '5' pi[456] = '6'.
    • String length can go up to 10^6.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!