Ho presentato la mia candidatura online. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso TikTok (New York, NY) nel mese di giu 2020
Colloquio
3 round tech interview. You can have next round interview only if you got positive feedback from last round interview. The process of each round: First self-intro, then mainly focus on solving coding problem, finally ask interviewer question. After pass 3 round tech interview, go to team match stage. Then offer call.
Domande di colloquio [1]
Domanda 1
round1: leetcode 403 frog jump
round2: leetcode 286, 735
round3: find peak element in array then in matrix
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.
