Technical interview using Google Docs. The interview involved a question requiring a solution presented in pseudocode and Java code. The interviewer also asked about the Big O time and space complexity of the provided solution.
Given a number n up to 12, prove that it is strictly non-palindrome in all bases from 2 to n-2. For example, 6 is a strictly non-palindrome number, represented as 110 in base 2, 20 in base 3, and 12 in base 4.
The following metrics were computed from 2 interview experiences for the Google Software Engineer II role in Bucharest, București-Ilfov.
Google's interview process for their Software Engineer II roles in Bucharest, București-Ilfov is extremely selective, failing the vast majority of engineers.
Candidates reported having mixed feelings for Google's Software Engineer II interview process in Bucharest, București-Ilfov.