Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Twilio (Los Angeles, CA) nel mese di set 2021
Colloquio
I had a phone screen with the recruiter and got a hackerrank challenge after that. I completed the challenge in 75-80 minutes instead of 90, wrote reasonably clean code and it passed all test cases. I followed up twice but got no response. Felt like a waste of time and energy.
Domande di colloquio [1]
Domanda 1
JSON parsing and some medium leetcode algorithm implementation.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Twilio
Colloquio
Three-stage process: recruiter screening, a test task and on-site interview. Both test task and the on-site were simple and straightforward, with focus on practical skills. On-site included the prospective team lead, VP and a team lead from another team in the same location.
Domande di colloquio [1]
Domanda 1
- What data structure would you use for variable-length phone number prefixes?
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Twilio nel mese di gen 2025
Colloquio
Interviewed for the L2 role on the Channels team. I did the online assessment (~3 hours), passed it, then was notified saying they filled the role and were no longer considering me. No referral to another role either. Long story short, don't let this awful company waste your time.
2 algo problems (listed below), 1 easy SQL problem, 1 easy API data retrieval problem, and 2 trivial multiple choice problems.
Domande di colloquio [2]
Domanda 1
Similar to LC1664 - Ways to Make a Fair Array except you don't need to count the number of ways to make it fair, you just have to find the 1 index to remove to make it fair.
If you google Hackerrank Approximate Matching you can find some material on it. Involves calculating a text score for substrings of a word based on a given prefix and suffix.