La procedura ha richiesto 5 giorni. Ho sostenuto un colloquio presso TikTok (Timişoara)
Colloquio
They will send you an automated invjte to an OA 2-3 days after your application, you have 5 days to complete it.
You will have 2h to complete it, 2 multiple choice questions (mine were multithreading) and 3 leetcode style questions, mine were 1 med-hard, 2 hards, all of them DP.
I did not finish the test because it kept saying my camera is not detected, but it worked on any other websites. I emailed them but got ghosted.
For an internship, the questions are very hard, imo you need to be very prepared to even have a chance.
Domande di colloquio [1]
Domanda 1
Given an amount of money and a set of banknotes (unlimited number of each one) return the minimum amount of banknotes to retrieve the sum or -1 if its not possible to retrieve it
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.
