9 YOE, IoT Company
Phone Screen:
~mid May
- Check if a string permutation can form a palindrome LC 266.
- Given an array, sort it and print the previous indexes, in case of duplicates print the first index for all duplicate positions.
Virtual Onsite
~mid July
No NDA, google meet and google docs as main tools
Coding:
Given a list of limits, return the valid range e.g.
Input: x <= 3, x >= 2
Output: [2, 3]
Input: x <= -2, x<= -100, x >= 5, x >= 100
Output: [0, 0]
Additionally to the algorithm, the interviewer was interested to talk about how I came up with the DS to hold this information and query it.
Follow up: list can contain duplicates, count total number of valid items (including duplicates ranges)
Coding:
small algorithm questions that required map, set, deque and talk about complexity and alternatives, they were really simple.
Coding:
Given two Binary Trees BT1, BT2 determine if they are similar, "similar" meant that I could invert BT1 tree or a sub tree multiple times so it can be converted to BT2, output is YES or NO.
I came up with a naive recursive solution, interviewer follow up with: how could I do it with transversal.
Edit: Thanks to kmess024 Flip Equivalent Binary Trees
System Design:
Design a metrics collector system.
- Think about metrics that we need to react immediately like latency to scale up/down services.
- Think about metrics that we need it for later (etl, queries)
Used google draw inside google docs
Behavioral:
Very classic questions, but this surprised me: did you have a diversity situation within your team and how have you handle it.
Preparation:
Leetcode Daily challenges, Elements of Programming Interviews + EPIJudge (I covered the one month plan) and Gro... the System Design...
I'm quite impressed how polite and good attitude google interviewers are, compared to others.