Meta interview guide¶
Builds Facebook, Instagram, WhatsApp, Threads, Meta AI and Reality Labs; known for fast two-problem LeetCode rounds and, since late 2025, an AI-enabled coding round. Updated October 2026.
| Meta at a glance | |
|---|---|
| Category | FAANG |
| Intern level | Software Engineer Intern (BS/MS/PhD; also Production Engineer and Network Production Engineer interns). Meta University (the 1st/2nd-year program) closed in 2025. |
| New grad level | E3 (IC3), posted as 'Software Engineer, University Grad' or similar; Production Engineer new grad is a separate track. |
| 0 to 3 years | E3 for 0 to about 2 years; E4 (IC4) typically from about 1 to 2+ years (Levels.fyi E4 data points start at 1 YOE). Some loops evaluate across two levels (E4/E5) based on design and behavioral signal. |
| Online assessment | CodeSignal (proctored: webcam, microphone, screen share) : New grad: 90 min, either a single 4-stage progressive practical problem (in-memory DB, file storage service) or 4 independent LeetCode-style questions. Intern: about 70 min, 4 questions of escalating difficulty (Aced). Bangalore E4 2025: hard 4-question OA plus a Likert behavioral assessment. |
| Coding rounds | New grad: phone screen (sometimes skipped) + 2 coding rounds in the loop, one of which may be AI-enabled. Intern: 1 to 2 coding interviews. |
| Behavioral | Meta values plus five behavioral focus areas: Resolving conflict, Growing continuously, Embracing ambiguity, Driving results, Communicating effectively (Meta full loop guide); STAR recommended |
| Timeline | Typically 4 to 12 weeks from recruiter screen to offer (Hello Interview); E3 example above took about 3.5 months including the holiday period. Phone screen results often within 1 to 6 business days; loop results 1 to 2 weeks. New grad and intern roles post in the fall; Meta University closed (memo Jan 2025). Team matching happens after the loop and can stall when headcount closes, especially in Bangalore. |
| New grad pay | Levels.fyi (fetched Oct 4, 2026), US Software Engineer E3: average total comp $181,313 from 42 recent data points; p25 $170,750, median $181,500, p75 $193,400 (page range $152K to $214K+); median base $141,000, median stock $35,000/yr. E4: average $299,140. India IC3 (Bangalore) offers reported Nov 2025 and Jan 2026: base INR 30.87 lakh, 10% bonus, $51K RSUs over 4 years, first-year total about INR 49 to 54 lakh including sign-on and relocation (LeetCode posts). |
| Official links | Careers, Students, Official interview prep, Values |
Interview process¶
New grad¶
- Recruiter screen. About 30 min: background, why Meta, logistics, timeline (Hello Interview E3 guide). Many new grads are contacted after applying with a referral.
- Online assessment (CodeSignal). CodeSignal, proctored with camera, mic and screen sharing. Two formats reported: (1) since mid-2025, one practical problem in 4 progressive stages in 90 min (e.g. in-memory database, cloud file storage service), unit tests visible, reference docs allowed but no AI or solution searching (Hello Interview; Jun 2025 candidate post on the 'new 4-level' OA); (2) 4 separate LeetCode-style questions (a US E3 new grad offer post, Mar 2025: 1 easy, 2 medium, 1 hard; Hello Interview's alternative format: 4 easy/medium questions in 70 min).
- Technical phone screen. 45 min with an engineer in a shared online editor where code is not compiled; typically 2 medium problems, often Meta-tagged LeetCode or close variants; sometimes 1 or 2 short project questions first (Mar 2026 report). Two US E3 offer posts (Jan and Mar 2025) describe going straight from the OA to the 3-round loop with no technical phone screen.
- Full loop (usually virtual). Usually 3 interviews: 2 coding (45 min, about 2 problems each) and 1 behavioral (45 min). Since Oct 2025 one coding round can be the AI-enabled coding round (about 60 min in CoderPad with file explorer, editor and AI chat; multi-file codebase: fix bugs, build a feature, optimize). Hello Interview's AI-enabled post scopes it to E5 to E7 and M2 SWE loops, but its E3 guide says it may replace one of the two E3 coding rounds, and a Bangalore University Grad candidate (Nov 2025) was told the loop was 1 coding + 1 AI-enabled coding + 1 behavioral.
- Team matching and offer. After passing, conversations with potential hiring managers, then offer and negotiation; whole process usually 4 to 12 weeks (Hello Interview E3). Example US E3 (2024 to 2025 cycle): applied with referral Sep 30, 2024, OA Oct 10, all 3 rounds Dec 10, verbal offer Jan 3, 2025, written Jan 13. A Bangalore candidate (Dec 2025) was rejected after the full loop because 'they are out of positions'.
Intern¶
- Apply. Meta posts SWE intern roles in the fall; as of Oct 1, 2026 the main Summer 2027 SWE intern requisition had not been posted (Extern; first 2027 req was a Data Engineer intern on Sep 29). Referrals matter; the intern loop is short and standardized (Aced).
- Online assessment. CodeSignal, about 70 min, usually 4 questions of increasing difficulty; some candidates also get an optional hour-long scenario-based behavioral survey (Aced intern guide).
- Technical interviews. Official Meta post (updated Oct 2022): stage one phone screen and stage two interview (video), 'identical expectations', about 5 min intro, 30 to 35 min coding with 'one to two coding questions', then Q&A. 2025 reports: two back-to-back interviews, two Meta-tagged LeetCode problems each (e.g. Kth Missing Positive Number, Interval List Intersections, Custom Sort String, Right Side View). Aced says many recent interns had a single 40-min tech screen after the OA.
- No system design, light behavioral. Interns are not asked system design. Hiring managers are rarely in the intern loop (Aced). Return offers depend on mentor and manager feedback.
With 1 to 3 years of experience¶
For 1 to 3 years (E4): OA sometimes, phone screen with 2 coding problems, then a full loop; Meta's full loop guide (PDF titled 'SWE _Full Loop_IC4-6') says '4 to 6 of 45 minute interviews' covering coding, design and behavioral. Hello Interview's E4 guide lists 4 onsite rounds: 1 traditional coding, 1 AI-enabled coding (60 min), 1 System Design or Product Architecture, 1 behavioral; 4 to 8 weeks total. A 2026 Bay Area infra loop (5+ YOE candidate) showed 2 design rounds and the recruiter evaluating across E4/E5. A Bangalore 2025 software engineer loop (2.5 YOE candidate, level not stated) added an 'elimination stage': a live DSA interview, a hard 4-question OA, and a Likert-scale behavioral assessment, before a 4-round loop (behavioral, product architecture, AI-enabled coding, pure DSA).
Online assessment¶
- Platform: CodeSignal (proctored: webcam, microphone, screen share)
- Format: New grad: 90 min, either a single 4-stage progressive practical problem (in-memory DB, file storage service) or 4 independent LeetCode-style questions. Intern: about 70 min, 4 questions of escalating difficulty (Aced). Bangalore E4 2025: hard 4-question OA plus a Likert behavioral assessment.
- Notes: Correctness per stage matters more than speed; most candidates do not finish all 4 stages (Hello Interview). Reference docs allowed, AI and solution search are not. OA results are weighed with the phone screen.
Prepare with How to pass an OA and compare formats in OA formats by company.
Coding rounds¶
- Rounds: New grad: phone screen (sometimes skipped) + 2 coding rounds in the loop, one of which may be AI-enabled. Intern: 1 to 2 coding interviews.
- Style: LeetCode style, mostly Meta-tagged mediums and their twists (merge two interval lists, left and right side views, calculator with only + and *); about 2 problems per 40 min so speed matters. Meta's full loop guide (IC4 to IC6 version) says 'We do not ask dynamic programming questions'; E3 reports show occasional DP where a recursive solution was accepted.
- Environment: Shared online editor; 'the interviewer will not compile your code' and Meta's guide tells you to practice 'with just a plain text editor with no compiler, linter, syntax highlighter, autocomplete'. AI-enabled round: CoderPad with a runnable multi-file project and an AI chat (Hello Interview lists GPT-4o mini, GPT-5, Claude Haiku/Sonnet/Opus, Gemini 2.5 Pro and Llama 4 Maverick). Outside the AI round, no outside assistance including AI tools like ChatGPT, and filters (including virtual or blurred backgrounds) must be off (official guide).
- Graded on: Four focus areas from Meta's guide: Communication, Problem solving (reasoning, multiple approaches, complexity), Coding (organized, correct structure), Verification (test cases, finding your own bugs). The AI-enabled round is graded on Problem Solving, Code Quality, Verification and Communication (Hello Interview).
- Reported focus topics: Arrays and strings with two pointers and hashing, Binary trees: BFS level order, side views, zigzag, diameter, LCA, Intervals (merge, intersect two lists), Stacks and parsing (parentheses, calculators, path simplification), Graphs and grids: BFS/DFS, islands, shortest exit, Heaps and top K, Binary search (Kth missing positive), Design-a-class basics (LRU cache), Recursion and backtracking (combinations), Reading and extending an unfamiliar multi-file codebase with an AI assistant
Run every practice problem through the 45-minute framework and the code quality rubric.
What they ask (data)¶
Based on 404 distinct problems tagged to Meta in the last 6 months (78 in the last 30 days, 226 in the last 3 months, 1320 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 57%, Easy 32%, Hard 11%
Most tagged topics (share of problems): Array 53%, String 24%, Hash Table 20%, Two Pointers 14%, Math 14%, Dynamic Programming 14%, Depth-First Search 13%, Sorting 12%, Breadth-First Search 12%, Binary Search 11%
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Two Sum | Easy | 30 days | Array, Hash Table |
| 2 | Add Two Numbers | Medium | 30 days | Linked List, Math, Recursion |
| 3 | Palindrome Number | Easy | 30 days | Math |
| 4 | Kth Largest Element in an Array | Medium | 30 days | Array, Divide and Conquer, Sorting, Heap (Priority Queue) |
| 5 | Longest Substring Without Repeating Characters | Medium | 30 days | Hash Table, String, Sliding Window |
| 6 | Median of Two Sorted Arrays | Hard | 30 days | Array, Binary Search, Divide and Conquer |
| 7 | Subarray Sum Equals K | Medium | 30 days | Array, Hash Table, Prefix Sum |
| 8 | Next Permutation | Medium | 30 days | Array, Two Pointers |
| 9 | Best Time to Buy and Sell Stock | Easy | 30 days | Array, Dynamic Programming |
| 10 | Maximum Subarray | Medium | 30 days | Array, Divide and Conquer, Dynamic Programming |
| 11 | Group Anagrams | Medium | 30 days | Array, Hash Table, String, Sorting |
| 12 | Remove Duplicates from Sorted Array | Easy | 30 days | Array, Two Pointers |
| 13 | 3Sum | Medium | 30 days | Array, Two Pointers, Sorting |
| 14 | Minimum Size Subarray Sum | Medium | 30 days | Array, Binary Search, Sliding Window, Prefix Sum |
| 15 | Max Consecutive Ones III | Medium | 30 days | Array, Binary Search, Sliding Window, Prefix Sum |
| 16 | Longest Palindromic Substring | Medium | 30 days | Two Pointers, String, Dynamic Programming, Manacher |
| 17 | Merge Sorted Array | Easy | 30 days | Array, Two Pointers, Sorting |
| 18 | Move Zeroes | Easy | 30 days | Array, Two Pointers |
| 19 | Reverse Integer | Medium | 30 days | Math |
| 20 | Find Peak Element | Medium | 30 days | Array, Binary Search |
| 21 | Coin Change | Medium | 30 days | Array, Dynamic Programming, Breadth-First Search, Knapsack Problem |
| 22 | Merge Intervals | Medium | 30 days | Array, Sorting, Quicksort |
| 23 | Product of Array Except Self | Medium | 30 days | Array, Prefix Sum |
| 24 | Search in Rotated Sorted Array | Medium | 30 days | Array, Binary Search |
| 25 | Symmetric Tree | Easy | 30 days | Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 26 | Valid Palindrome | Easy | 30 days | Two Pointers, String |
| 27 | Koko Eating Bananas | Medium | 30 days | Array, Binary Search |
| 28 | Remove Nth Node From End of List | Medium | 30 days | Linked List, Two Pointers |
| 29 | Jump Game | Medium | 30 days | Array, Dynamic Programming, Greedy |
| 30 | Remove Element | Easy | 30 days | Array, Two Pointers |
| 31 | Find First and Last Position of Element in Sorted Array | Medium | 30 days | Array, Binary Search |
| 32 | Binary Search | Easy | 30 days | Array, Binary Search |
| 33 | Container With Most Water | Medium | 30 days | Array, Two Pointers, Greedy |
| 34 | Majority Element | Easy | 30 days | Array, Hash Table, Divide and Conquer, Sorting |
| 35 | Sort Characters By Frequency | Medium | 30 days | Hash Table, String, Sorting, Heap (Priority Queue) |
| 36 | Maximum Product Subarray | Medium | 30 days | Array, Dynamic Programming |
| 37 | N-Queens | Hard | 30 days | Array, Backtracking, Algorithm X |
| 38 | Maximum Length Substring With Two Occurrences | Easy | 30 days | Hash Table, String, Sliding Window |
| 39 | Contains Duplicate | Easy | 30 days | Array, Hash Table, Sorting |
| 40 | Merge Strings Alternately | Easy | 30 days | Two Pointers, String |
| 41 | Fibonacci Number | Easy | 30 days | Math, Dynamic Programming, Recursion, Memoization |
| 42 | Sort Colors | Medium | 30 days | Array, Two Pointers, Sorting, Quicksort |
| 43 | Single Number | Easy | 30 days | Array, Bit Manipulation |
| 44 | Permutation in String | Medium | 30 days | Hash Table, Two Pointers, String, Sliding Window |
| 45 | Middle of the Linked List | Easy | 30 days | Linked List, Two Pointers |
| 46 | Plus One | Easy | 30 days | Array, Math |
| 47 | Integer Break | Medium | 30 days | Math, Dynamic Programming |
| 48 | Sort an Array | Medium | 30 days | Array, Divide and Conquer, Sorting, Heap (Priority Queue) |
| 49 | Find the Index of the First Occurrence in a String | Easy | 30 days | Two Pointers, String, String Matching, Z Algorithm |
| 50 | Roman to Integer | Easy | 30 days | Hash Table, Math, String |
Signature problems¶
Problems where Meta accounts for a large share of all recent tags across companies. These are the most Meta-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Remove Nth Node From End of List | Medium | 30 days | Linked List, Two Pointers |
| 2 | Valid Word Abbreviation | Easy | 3 months | Two Pointers, String |
| 3 | Vertical Order Traversal of a Binary Tree | Hard | 30 days | Hash Table, Tree, Depth-First Search, Breadth-First Search |
| 4 | Minimum Remove to Make Valid Parentheses | Medium | 3 months | String, Stack |
| 5 | Binary Tree Vertical Order Traversal | Medium | 3 months | Hash Table, Tree, Depth-First Search, Breadth-First Search |
| 6 | Nested List Weight Sum | Medium | 3 months | Depth-First Search, Breadth-First Search |
| 7 | Sum Root to Leaf Numbers | Medium | 3 months | Tree, Depth-First Search, Binary Tree |
| 8 | Sort Characters By Frequency | Medium | 30 days | Hash Table, String, Sorting, Heap (Priority Queue) |
| 9 | Lowest Common Ancestor of a Binary Tree III | Medium | 3 months | Hash Table, Two Pointers, Tree, Binary Tree |
| 10 | Kth Missing Positive Number | Easy | 3 months | Array, Binary Search |
| 11 | First Bad Version | Easy | 30 days | Binary Search, Interactive |
| 12 | Kids With the Greatest Number of Candies | Easy | 30 days | Array |
| 13 | Sort an Array | Medium | 30 days | Array, Divide and Conquer, Sorting, Heap (Priority Queue) |
| 14 | Valid Number | Hard | 3 months | String |
| 15 | Clone Graph | Medium | 3 months | Hash Table, Depth-First Search, Breadth-First Search, Graph Theory |
| 16 | Integer Break | Medium | 30 days | Math, Dynamic Programming |
| 17 | Online Stock Span | Medium | 30 days | Stack, Design, Monotonic Stack, Data Stream |
| 18 | Number of Substrings Containing All Three Characters | Medium | 30 days | Hash Table, String, Sliding Window |
| 19 | Find the Highest Altitude | Easy | 30 days | Array, Prefix Sum |
| 20 | Remove Linked List Elements | Easy | 30 days | Linked List, Recursion |
Reported in 2025 to 2026 interviews¶
Questions candidates said they got, each linked to the post where it was reported.
| Question | Role | When | Source |
|---|---|---|---|
| Convert BST to Sorted Doubly Linked List (in place) | E3 new grad, US | 2025-03 | post |
| Merge two sorted interval lists (Merge Intervals variation) | E3 new grad, US | 2025-03 | post |
| Nested List Weight Sum | E3 new grad, US | 2025-03 | post |
| Basic calculator with only '+' and '*' (Basic Calculator II variation), with a space-optimal follow-up | E3 new grad, US | 2025-03 | post |
| Diameter of Binary Tree | E3 new grad, US (virtual onsite) | 2025-02 | post |
| Diagonal Traverse | E3 new grad, US (virtual onsite) | 2025-02 | post |
| Combinations from a given list of numbers (variation of Combinations) | E3 new grad, US (virtual onsite) | 2025-02 | post |
| Merge k sorted arrays (easier version of Merge k Sorted Lists) | E3 new grad, US (virtual onsite) | 2025-02 | post |
| Kth Missing Positive Number | SWE intern | 2025-01 | post |
| Interval List Intersections | SWE intern | 2025-01 | post |
| Custom Sort String | SWE intern | 2025-01 | post |
| Binary Tree Right Side View | SWE intern | 2025-01 | post |
| Binary Tree Right Side View variant: return both the left and right side views; also a Merge Intervals variant that merges two sorted interval lists | Phone screen (passed) | 2025-07 | post |
| Kth Missing Positive Number variant: return the missing number counting from the leftmost element (binary search); asked with the left and right side views variant | Phone screen (passed next day) | 2025-07 | post |
| Binary Tree Zigzag Level Order Traversal, starting right to left | Phone screen | 2025-07 | post |
| Simplify Path | Software Engineer phone screen (Mar 2026) | 2026-03 | post |
| Maximum Level Sum of a Binary Tree | Software Engineer phone screen (Mar 2026) | 2026-03 | post |
| Nearest Exit from Entrance in Maze | Technical screen (Aug 2026) | 2026-08 | post |
| Remove Duplicates from Sorted Array | Technical screen (Aug 2026) | 2026-08 | post |
| Valid Word Abbreviation (missed the leading-zero case) | E4 London phone screen | 2025-08 | post |
| Pow(x, n) | E4 London phone screen | 2025-08 | post |
| Validate IP Address | Phone screen (Oct 2025) | 2025-10 | post |
| Folder and File classes with nested folders: return duplicate file names | Phone screen (Oct 2025) | 2025-10 | post |
| Buildings With an Ocean View | Software engineer, Bangalore (elimination interview; 2.5 YOE) | 2025-11 | post |
| LRU Cache | Software engineer, Bangalore (full loop, pure DSA round; 2.5 YOE) | 2025-11 | post |
| AI-enabled round: partially built game codebase; understand it, fill in missing logic, optimize the final strategy | Software engineer, Bangalore (full loop, 2.5 YOE) | 2025-11 | post |
| Making A Large Island | Software engineer, Bengaluru phone screen (4+ YOE; asked with Sort Array By Parity) | 2025-10 | post |
Beyond LeetCode¶
AI-enabled coding round (about 60 min): partially built multi-file codebase, often a game or puzzle (candidates and creators describe 'Game of Fifteen' and 'The Puzzle' practice sets); phases are bug fixing, core implementation and optimization; you choose the model; graded on judgment and verification, not prompting. CodeSignal progressive 4-stage OA (build a working system step by step). Product Architecture design round for E4+. Bangalore 2025 Likert-scale behavioral assessment.
System design¶
None for E3 new grads and interns. E4 (about 1 to 3 years) adds one design interview: System Design (distributed systems, scale) or Product Architecture (APIs, data models, product features) depending on the role (Meta full loop guide via swe-prep-onsite).
Start with who needs system design, then the framework.
Behavioral¶
Framework: Meta values plus five behavioral focus areas: Resolving conflict, Growing continuously, Embracing ambiguity, Driving results, Communicating effectively (Meta full loop guide); STAR recommended (official page)
What they look for:
- Values: Move fast; Build awesome things; Be direct and respect your colleagues; Focus on long-term impact; Live in the future; Meta, Metamates, me
- Addressing conflict directly with empathy
- Learning from failure and feedback
- Productive decisions with missing information
- Self-directed delivery and measurable impact
- Clear communication with cross-functional partners
- Honest reflection under rapid follow-up questions
- How you use AI responsibly to ship faster (2026)
Questions to prepare:
- Tell me about the project you are most proud of.
- Tell me about a time you disagreed with a design choice. How did it affect the outcome?
- Tell me about a time you had limited information and still had to proceed.
- What do you feel you lack, and how are you improving it?
- Tell me about a conflict with a teammate.
- Tell me about a time you had to follow someone else's opinion.
- Tell me about a time you used AI to deliver something faster than you otherwise could have.
- How do you use AI safely in your day-to-day work?
Build your answers with the story bank. Company detail: behavioral guide.
Tips¶
- Drill Meta-tagged problems by recent frequency and their known variants; Hello Interview's most common E3 list starts with Basic Calculator II, Valid Word Abbreviation, Valid Palindrome II, Buildings With an Ocean View and Binary Tree Right Side View.
- Budget about 15 to 20 minutes per problem: state the approach, get a nod, code, then walk through test cases yourself (no compiler).
- Practice coding in a plain text editor with autocomplete off; Meta's guide asks you to practice exactly that.
- Prepare for the AI-enabled round: break the task down yourself, give the AI small focused tasks, read and test every chunk, and catch its mistakes; blindly pasting output scores worse than not using AI.
- Ask your recruiter which loop format you have (AI-enabled vs two classic coding rounds); Jugal's Jul 2026 post notes recruiters tell candidates in advance.
- Prepare 4 to 5 STAR stories mapped to the five focus areas plus one honest story about using AI at work.
- For the CodeSignal OA, practice building a small system in stages (key-value store with TTL and versioning) and prioritize passing each stage's tests.
- Jugal's Part 1 post (Jul 2025) summarizes Meta prep as graphs and trees, hash tables, two pointers, tries, and production-grade code with edge cases.
4-week plan for Meta¶
Do this after you finish a core list like Grind 75 or NeetCode 150.
- Week 1: Solve problems 1 to 20 from the most frequent list. Time-box each at 30 minutes.
- Week 2: Solve problems 21 to 40. Re-solve any you failed in week 1 without looking.
- Week 3: Solve the signature problems and every reported question above. Do 2 timed mock interviews.
- Week 4: Write 8 stories for the Meta values plus five behavioral focus areas: Resolving conflict, Growing continuously, Embracing ambiguity, Driving results, Communicating effectively (Meta full loop guide); STAR recommended round. Do 2 full mock loops. Review the online assessment and system design notes above.
Sources¶
- Question data: liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged and ranked by scripts/build_question_data.py.
- https://www.metacareers.com/
- https://www.metacareers.com/careerprograms/students
- https://www.metacareers.com/swe-prep-onsite/
- https://www.metacareers.com/facebook-life/
- https://www.metacareers.com/blog/acing-your-software-engineering-internship-interview-at-meta/
- https://www.hellointerview.com/guides/meta/e3
- https://www.hellointerview.com/guides/meta/e4
- https://www.hellointerview.com/blog/meta-ai-enabled-coding
- https://www.businessinsider.com/meta-job-candidates-use-ai-coding-interviews-2025-7
- https://www.wired.com/story/meta-ai-job-interview-coding/
- https://interviewing.io/blog/how-to-use-ai-in-meta-s-ai-assisted-coding-interview-with-real-prompts-and-examples
- https://interviewing.io/guides/hiring-process/meta-facebook
- https://interviewing.io/blog/how-software-engineering-behavioral-interviews-are-evaluated-meta
- https://www.aced.io/guides/meta-software-engineer-intern-interview
- https://www.aced.io/guides/meta-software-engineer-interview
- https://www.aced.io/blog/the-meta-facebook-interview-process
- https://www.extern.com/post/meta-internship-guide
- https://workshift.org/with-meta-universitys-closure-a-sign-of-changing-times-in-tech/
- https://www.levels.fyi/companies/meta/salaries/software-engineer/levels/e3
- https://github.com/liquidslr/leetcode-company-wise-problems
- https://jugaldb.substack.com/p/how-to-crack-faang-interviews-part
- https://jugaldb.substack.com/p/how-to-prepare-for-faang-ai-engineer
- https://leetcode.com/discuss/post/6575634/meta-got-offer-swe-e3-us-new-grad-by-ano-640h/
- https://leetcode.com/discuss/post/6463713/meta-vo-e3-us-offer-by-anonymous_user-wcwk/
- https://leetcode.com/discuss/post/6242211/meta-swe-intern-by-anonymous_user-dm4b/
Watch out: Re-verified Oct 4, 2026 by a second agent: every URL in sources returned HTTP 200 or loaded via WebFetch (metacareers blocks plain curl with HTTP 400 but serves browsers); LeetCode Discuss posts and problem slugs re-checked through LeetCode's GraphQL API. Meta's Software Engineer Full Loop Interview Guide was downloaded from the swe-prep-onsite page (signed fbcdn PDF link, so cite the swe-prep-onsite page): PDF title 'SWE _Full Loop_IC4-6_access_v1'; confirmed quotes include '4 to 6 of 45 minute interviews', 'about two problems in the course of about 40 minutes', 'We do not ask dynamic programming questions', 'the interviewer will not compile your code', the four coding focus areas, the two design types (Systems Design, Product Architectural Design) and the five behavioral focus areas [VERIFIED]. The AI-enabled round is confirmed by Business Insider (Jul 29, 2025; Meta confirmed) and Wired/404 Media, and Hello Interview dates the rollout to Oct 2025 [VERIFIED secondary]. Scope is inconsistent across sources: Hello Interview's AI-enabled post says E5 to E7 and M2, its E3 and E4 guides include it, and candidates report it in E3 University Grad loops; ask your recruiter. CORRECTED in this pass: the 'both side views' variant was attributed to the Jan 2025 intern post but comes from Jul 2025 phone-screen posts (now a separate entry); '4 easy/medium in 70 min' is Hello Interview's description, not '2026 reports'; the Bangalore elimination-stage loop does not state E4; the 'rejected after strong loops' claim was softened to what the post says; the E3 example dates are the 2024 to 2025 cycle; 'no syntax highlighting' is Meta's practice advice, not a documented property of the interview editor. Meta values list is from the official Culture page (six values, re-fetched). Intern process sources disagree (official Oct 2022 post: phone screen plus a second interview with identical expectations; Aced: OA plus one 40-min screen with two problems); state it as varying. Meta Summer 2027 intern posting status comes from Extern (updated Oct 2026) [VERIFIED page; secondary claim]; Extern's claim that Meta University 'opens later' is contradicted by the Apr 2025 closure reporting.
Next: All companies