It is easier than I thought, the most easiest one tbf.
very classic amazon, design parking garage
leetcode 1603
follow up is type is not constrain in parking
2 small can park in one medium
1 big and park in 4 small
find the duplicate in a list of length n, list start from 1
need to be in O(1) space and not use sum as it can be overflow
similar to leetcode 268
increment, decrement, incre then decre, decre then incre.
define the input array which type
in O(1) time and space
Is similar to leetcode 207
you have a string, and a already written function where you can get a list of string.
from the first string to final string return min steps
I have been interviewing with other companies as well and here are my other posts about Facebook onsite , Google onsite and Apple onsite
Haven't check for years but btw i got in google out of all, life here been good, keep up the good work buddy, you will get it one day as well.