Meta
The most precisely documented timings of the three — and the tightest.
The loop
- 1Technical screenPractice problems →
Meta publishes the breakdown: roughly 40 minutes, as 5 minutes of introductions, 35 minutes of coding, and 5 minutes of questions — with **two problems** inside that 35. That is the fact worth preparing around, because it makes fluency matter more than cleverness.
- Meta Careers — Preparing for your software engineering interview at Meta · published 2022-10-06
- 2Full loopSystem Design labs →
Three parts: coding, design, and behavioural. The coding round runs 45 minutes with the same shape — 5 minutes of introductions, 35 of coding, 5 of questions.
- Meta Careers — Preparing for your software engineering interview at Meta · published 2022-10-06
Worth knowing
Meta asks for the reasoning explicitly: "Think out loud. We pay a lot of attention to the way you solve problems, which can be as important as having the right answer." It also tells you to ask — "If you are stuck, ask questions. Usually, the interviewer knows the question well enough to provide information that may help you move forward."
- Meta Careers — Preparing for your software engineering interview at Meta · published 2022-10-06
Problems tagged Meta
Widely-reported associations, not verified reports — a rough signal about what gets asked here rather than evidence that it was.
0 / 24 solved(showing 1–15 of 24)
| Solved | Problem | Topic | Difficulty |
|---|---|---|---|
| Two Sum | hashing | easy | |
| Valid Anagram | hashing | easy | |
| Group Anagrams | hashing | hard | |
| Longest Consecutive Sequence | hashing | medium | |
| Maximum Subarray | arrays | medium | |
| Search in Rotated Sorted Array | binary-search | medium | |
| Longest Palindromic Substring | dynamic-programming | medium | |
| Number of Islands | graphs | medium | |
| Kth Largest Element | heaps | medium | |
| Top K Frequent Elements | heaps | medium | |
| Longest Substring Without Repeats | sliding-window | medium | |
| Valid Parentheses | stacks-queues | easy | |
| Maximum Depth of a Tree | trees | medium | |
| Validate Binary Search Tree | trees | medium | |
| Remove Duplicates from Sorted Array | two-pointers | medium |
Every source above was read on 2026-08-31 and said what it is quoted as saying. The oldest is from 2022-10-06 — hiring processes change, so treat the timings as a guide rather than a promise.
If this disagrees with what a recruiter tells you, believe the recruiter.