Domanda di colloquio di Google

String manipulation problems, such as a medium-level problem involving string operations and edge case handling. Graph-based problems, including medium-level questions on topics like topological sorting and hard-level graph problems where candidates may be asked to explain the approach and complexity without writing code. Dynamic Programming (DP) problems, with one interviewee reporting a DP question during the process.