Meta CodeSignal assessment interview

Round 2 of 7 · 8 questions reported

See the whole loop
Length
90 min
Format
Four levels on one class: basic operations, a ranking query, timestamps and expiry, then merge or snapshot and restore
They grade
Every test passing; partial passes on the last level usually fall short
AI use
No AI
Heads-up
Not every pipeline has it.

Questions Meta asks in this round 8

  • Anthropic OA: leveled in-memory record storeCodingA timed, multi-level exercise building an in-memory store of records with fields: create and read first, then scans and filters, then timestamps with expiry, then backup and…
    Last asked Sep 2026
  • Cloud storage with user quotas and backupsCodingDesign an in-memory cloud storage service. The interview has four parts. Each part adds methods, and every earlier method must keep working. Implement a class CloudStorage. File…
    Last asked Feb 2026
  • Product of array except selfCodingReturn an array where each position holds the product of every other element, without division and in linear time, using prefix and suffix products; then do it with constant extra…
    Possibly retired
  • Design a fitness tracking appSystem designDesign a fitness tracking app: users record workouts such as runs and rides from their phone, see their history, and view the route of each workout on a map. Cover uploading…
    Last asked Mar 2026
  • Place Tetris-like shapes in the first spot that fitsCodingYou have an n x m grid and a sequence of shapes from a small fixed set. Place the shapes one at a time, in order; each goes into the first position where it fits, scanning rows…
    Last asked Feb 2026
  • Walls and gatesCodingA grid holds walls, gates and empty rooms. Fill every empty room with the distance to its nearest gate, leaving rooms that cannot reach a gate untouched. Use one multi-source BFS…
    Last asked Jan 2026
  • Merge two sorted linked listsCodingMerge two sorted linked lists into one sorted list and return its head, reusing the existing nodes. Do it iteratively with a dummy head, then discuss the recursive version.
    Possibly retired