Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso TikTok (Singapore) nel mese di feb 2022
Colloquio
Approached by HR. Two rounds of technical interview (online). Both interviews were about past experiences and asked specific questions about the tech used + 1 medium LC question in each round.
The first interview was ok, although for some questions I'm not quite sure, algo AC.
The second interview was bad/terrible, the interviewer could not give clear instructions and kept interrupting while I was speaking. He asked to go through certain things but then interrupt in the middle and rush to the next question. Algo AC but he doesn't seem to care.
Overall a waste of time and effort, the feedback is total non-sense from the HR. If you do not want to hire then don't keep approaching people to waste their time.
Ho sostenuto un colloquio presso TikTok (San Francisco, CA)
Colloquio
OA - 1 arrays Medium, 1 Trie Hard. I had 45 minutes to complete that. I was able to do the medium in about 15-20 minutes but I am not that great with trie ds so I was not able to finish.
Four Round Process
Phone Interview with Human Resources
Coding Round; 1 DSA Leetcode Medium Q
Coding Round: 2 DSA Leetcode Medium Q
Manager Round: System Design Q and behavioural Q
It took about four weeks from application to offer, longer than I initially expected. The initial phone screen was straightforward, covering my resume and some basic algorithms. Then came the technical rounds, which were challenging. One question on minimum window substrings had me diving into a sliding-window approach using pointers and hashmaps. Funny enough, I recognized it mid-round as something I’d practiced on PracHub just days before. After a final system design discussion, I received the offer and happily accepted.
Domande di colloquio [1]
Domanda 1
Given two strings s and t, return the minimum window substring of s that contains every character of t including duplicates, or an empty string if no such window exists. Walk through the sliding-window approach using two pointers and a character-frequency hashmap, analyze the O(|s| + |t|) time complexity, and discuss how to adapt it when t contains characters not present in s or when s arrives as a stream that cannot be fully buffered.
