J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez TikTok en sept. 2023
Entretien
Some coding questions related to array. My experience with the interviewer was quite positive, mainly due to their exceptional patience throughout the interview. As the interview progressed, there were moments when I felt a bit nervous and stumbled over my words or needed a moment to think about my responses.
Questions d'entretien [1]
Question 1
You are given an array of integers, and your task is to write a function that finds the two numbers in the array that add up to a specific target sum. If there are multiple pairs that add up to the target sum, return any one of them. If no such pair exists, return an empty array.
J'ai passé un entretien chez TikTok (San Francisco, CA)
Entretien
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.
Questions d'entretien [1]
Question 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.
