Meta interview write-ups can be frustratingly brief about the actual problems. This guide keeps the useful distinction: one phone-screen account names its prompts, while an E4 candidate describes the round difficulty but leaves the problem titles out. Unnamed questions stay unnamed here.
\nA candidate described an easy and a medium question in the same phone screen. The first was Max Top K Elements in an array, solved with a min-heap. The second asked for a class with get, put, delete, and last operations, where last returns the most recently accessed non-deleted key. The author discussed several data-structure choices and reported an O(n) target for the operations. Both prompts come from the Meta phone-screen report on LeetCode Discuss (2025).
The account also mentions a rough start caused by a webcam problem. That detail is practical: test the equipment and keep a backup ready before the call, so a setup issue does not consume problem-solving time.
\nAn E4 candidate described two interviews, each with a pair of problems that moved from easy or medium toward harder follow-ups. The candidate did not publish the problem names. The Meta E4 interview report (2025) therefore supports a note about pacing and problem-reading, but it cannot support a named question list.
\nThe candidate's advice was to slow down, read the prompt aloud, restate the task, and explain an approach before coding. Those are reflections from one interview, not official Meta scoring criteria.
\nFor the top-k prompt, compare a heap with sorting and be ready to explain how the cost changes with input size. For the key-value interface, clarify whether operations need to be constant time before choosing a list, map, or other structure. The original phone-screen post says the proposed operations were expected to run in O(n), so do not silently replace that requirement with a different one.
\nThis is a small source set. It does not establish Meta's current loop or prove that these prompts recur. Use the interview question guide for practice structure and the company interview hub to compare other firsthand accounts.
\nA separate E4 report records two follow-ups to a binary-range problem, followed by three behavioral questions. The captured notes do not include the initial coding prompt, so only the reported follow-ups are listed:
\nstart > end? (same report)Another candidate described a 15-minute task to print a binary tree in a specific format. The post title does not identify the role or level, so this is kept separate from the E4 and phone-screen reports. (LeetCode Meta report)
\nNo. That candidate described the difficulty and progression of two interviews but did not publish problem names. This page therefore reports the account without reconstructing or guessing the questions.
\nCreate a profile on Parlel to unlock hiring manager emails for roles you’re targeting.
\n\nDheeraj Kumar, founder building Parlel, an open professional network for people, companies, and jobs. Find him on his Parlel profile.
","related":[{"slug":"tech-company-interview-experiences","title":"Tech Company Interview Experiences by Role and Level","description":"Compare software, platform, and AI company interview reports by role and level, with candidate-reported questions linked to their original sources.","url":"https://parlel.com/guides/tech-company-interview-experiences"},{"slug":"interview-questions-and-answers","title":"Top Interview Questions and Answers (2026 Bank)","description":"Top interview questions and answers: 25+ proven responses with STAR method so you clear every round in 2026 — HR, technical, phone and video rounds covered.","url":"https://parlel.com/guides/interview-questions-and-answers"},{"slug":"system-design-interview-questions","title":"System Design Interview Questions + 10 Walkthroughs","description":"System design interview questions with a clear framework, building blocks, capacity estimates, and 10 concise practice walkthroughs. Reviewed September 2026.","url":"https://parlel.com/guides/system-design-interview-questions"}]}