Leetcode medium, prepare lots of leetcode and get practice talking through your thought process. Several levels of questions and extensions and also talk through run time and test cases. interviewers were friendly
Interview questions [1]
Question 1
given a sequence s of n digits, find a subsequence of k digits such that the number formed by these k didgits (in order) is the largest
It was very professional and the interview questions were very clear.
There were two 45 minutes long meetings, one after another, hosted by two different Google Engineers. Every interviewer had a Google Sheet Document prepared with an algorithmic problem.
Interview questions [1]
Question 1
Basic Complexity problems for different sorting and searching algorithms.
Not too difficult, guess i got down on details, i was not the best in my communication skills.How ever it is typical gooogle, 2 back to back interviews of 1 h each with 2 different engineers, was not easy to get both, but its possible!