Through a referal I had a quick and no-nonsense phone interview. Just the way I like it. The interview lasted around an hour. The interviewer seemed monotone, but answered any questions I had. Of course there were some introductory questions on behavioral.
Questions d'entretien [1]
Question 1
Given two arrays, write a function to compute their intersection.
Interview process
I interviewed for a Meta summer internship and the process consisted of two 45-minute live coding interviews. Each interview followed a similar structure: one easier warm-up problem followed by one medium-level problem.
Both sessions were fast-paced. The interviewer expected me to clarify requirements quickly, propose an approach, and implement efficiently within the time limit. There wasn’t much slack for long exploration, so it helped to communicate clearly, write clean code, and validate edge cases as I went.
Interview questions
The questions were standard data structures and algorithms style. The “easy” question typically checked basic implementation and correctness, while the “medium” question required a more structured approach and careful handling of edge cases and complexity.
(I won’t share exact questions, but expect common DS/Algo patterns.)
What went well
The interviews were structured and consistent (easy → medium).
Interviewers cared about communication (explaining reasoning and trade-offs), not just the final code.
Complexity discussion and edge cases mattered.
What was challenging
Time pressure: two problems in 45 minutes means you need to move quickly.
The medium question often required both correctness and optimization (thinking about time/space complexity early).
Tips for candidates
Practice solving two problems in 45 minutes (simulate the pacing).
Focus on core DS/Algo patterns (arrays/strings, hash maps, two pointers, sliding window, stacks/queues, BFS/DFS, heaps, basic DP).
Get in the habit of: clarify constraints → outline approach → code cleanly → test a few edge cases → state complexity.
Questions d'entretien [1]
Question 1
One of the key questions was a typical array/string problem solved with a two-pointer or sliding-window technique: maintain a window, update a frequency map/counters as the pointers move, and ensure the solution runs in linear time. I was also asked a graph-style BFS question that required using a queue, tracking visited states, and returning the minimum number of steps under constraints, with careful handling of corner cases.
Two medium questions with in 45min, no bq. Need to complete all the two questions to pass. Need to hand write tests yourself. Interviewer is friendly and the whole process is professional.
Technical interview over zoom, with something like CodePad to write code to. I was asked two LeetCode-style questions, each for 20 minutes, with a remaining 5 minute for "do you have any questions for me".
Questions d'entretien [1]
Question 1
Both questions were LeetCode medium-ish. Questions themselves weren't too hard to solve but required more lines of code than LC medium usually takes, plus multiple auxiliary data structures. Also included a lot of details that tripped me up.