Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso AppsFlyer (Tel Aviv) nel mese di gen 2021
Colloquio
The interview process :
first interview - technical questions - 2 developers .
second interview with a designer - design questions.
third interview against vp - didn't reach to this round.
last one is against HR - an offer.
Domande di colloquio [1]
Domanda 1
first interview questions:
implement non blocking queue.
implement cashing data structure
sort an array of 0,1.
second interview - design interview:
describe a design of tiny url system.
Phone call with someone from the HR to invite you to the interview. Two technical questions, HR and the last one is with the CTO and the V&P r&d (sometimes the main architect instead).
Domande di colloquio [1]
Domanda 1
* Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up
to the target, where index1 < index2. Please note that your returned answers
(both index1 and index2 ) are not zero-based.
Put both these numbers in order in an array and return the array from your function
( Looking at the function signature will make things clearer ).
Note that, if no pair exists, return empty list.
If multiple solutions exist, output the one where index2 is minimum.
If there are multiple solutions with the minimum index2, choose the one with minimum index1 out of them.