Software Engineer · Full Journey · Coding

[ OK ] 2185ff22-ecbb-4ed6-8343-c735b1fa34aa — full writeup

[ INFO ] category: Behavioral · Coding difficulty: 7 freq: first seen: 2026-01-25

[7][CODING]ArraysString ManipulationGreedy Algorithms

$ cat problem.md

Google — Software Engineer ✅ Passed

Level: Junior-Level · L3

Round: Full Journey · Type: Coding · Difficulty: 7/10 · Duration: 90 min · Interviewer: Unfriendly

Topics: Arrays, String Manipulation, Greedy Algorithms

Location: Mountain View, CA

Interview date: 2025-12-01

Round 1: Online Assessment

Question: Meeting Room II

Round 2: Online Assessment

Question: Given a string representation of Pi, find the indices i where i = pi[i]. Consider 1-based indexing and multi-digit indices for matching.

Meeting Room II: Understand greedy algorithm approaches to efficiently manage resource allocation.
Pi String Index Matching: Practice string manipulation and array indexing techniques. Pay close attention to handling multi-digit index matching and edge cases.

LeetCode similar: Meeting Rooms II

user@intervues:~/experiences/google$