Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso TikTok
Colloquio
Emailed pre-screen. 1-1 code interview. The interviewer was clearly not paying attention throughout the whole process, even claiming that he was very busy and needed to work. After implementing the brute force solution, he made me waste time writing up unit tests and then refused to give hints or anything about a more optional solution. Then he ended the meeting abruptly a whole 15 minutes early. Worst interview experience so far.
Domande di colloquio [1]
Domanda 1
Difficult experience at previous company, leetcode medium
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.
