Meta interview questions

Showing 451–480 of 666 results

• Implement Multi-Level In-Memory ServicesEasy

  This question evaluates a candidate's ability to design and implement mutable in-memory data structures and algorithms for stateful service simulations, covering account and file modeling, temporal operations with lazy expiration, ranking queries, merging entities, and capacity constraints.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Sparse Matrix OperationsMedium

  This question tests the ability to design an efficient data structure for sparse matrix storage and implement optimized multiplication between a sparse matrix and a dense vector.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a Streaming VMStat AlertMedium

  This question tests the ability to design a memory-efficient sliding window mechanism for monitoring high-frequency system metrics in real-time.

  MetaSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Implement a Timestamped Banking SystemHard

  This problem tests the ability to manage time-series data using efficient lookups and range queries, specifically requiring a balance between transactional updates and historical state retrieval.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement a versioned in-memory DB with CAS and historyMedium

  This question evaluates a candidate's ability to design and implement time-versioned in-memory data structures, conditional concurrency primitives (compare-and-set and compare-and-delete), TTL expiration semantics, and efficient historical reads.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement an Expiring Record StoreMedium

  This question evaluates skills in designing and implementing an in-memory, level-based key-field-value store with lexicographic scanning, time-based versioning, TTL semantics, and efficient mutation operations.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an in-memory key-field-value DB with TTLMedium

  This question evaluates implementation skills in efficient in-memory data structures, time-to-live (TTL) expiration semantics, ordered and prefix scans, and snapshot backup/restore mechanisms.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement array parity and tree level viewsEasy

  This problem tests your ability to handle two distinct sub-tasks: identifying array elements with unique parity and performing a level-order traversal of a binary tree.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement basic expression evaluatorMedium

  This question evaluates proficiency in expression parsing, operator precedence handling, integer arithmetic semantics (including truncating division), and efficient tokenization and evaluation within the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Implement cd and merge intervalsMedium

  This problem tests your ability to manipulate string-based file system paths using a stack-based approach and consolidate overlapping time intervals using sorting.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement exponentiation and fill grid distancesMedium

  This problem tests proficiency in efficient modular exponentiation (binary exponentiation) and multi-source Breadth-First Search (BFS) for computing shortest distances in a grid.

  MetaMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Implement exponentiation and link tree neighborsMedium

  This question evaluates numerical algorithm implementation and in-place tree traversal skills, specifically fast exponentiation with careful edge-case and precision handling and iterative linking of next pointers in a perfect binary tree.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement fast power and k-palindromeMedium

  This problem tests your ability to implement binary exponentiation for efficient numerical calculation and dynamic programming for optimal string manipulation.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement four coding challengesEasy

  This set of four problems evaluates algorithmic problem-solving and implementation skills across deterministic simulation (grid-based placement), dynamic interval/segment maintenance, incremental numeric tracking, and greedy array transformation, emphasizing correctness, state management, and complexity reasoning.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement held transfers with accept/cancelHard

  This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Implement held transfers with accept/cancel states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement in-place duplicate removalMedium

  This question evaluates proficiency in in-place array manipulation, handling duplicates in sorted sequences, and formal reasoning about space and time complexity.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement list cloning and k-frequency finderEasy

  The first part evaluates understanding of linked data structures and deep-copy semantics, focusing on preserving node values and both next and arbitrary random pointer relationships while reasoning about node identity and cycles, and is commonly asked to assess correctness in memory/reference handling and structural preservation.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement paginated, sortable dynamic table componentMedium

  This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Implement paginated, sortable dynamic table component states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Implement range-sum tree and sort merged listsMedium

  Implement range-sum tree and sort merged lists evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement right side view and local minimum searchMedium

  This question evaluates a candidate's understanding of binary tree traversal and array local-minimum detection, measuring skills in data structures (binary trees and arrays), algorithm design, and algorithmic time-complexity analysis.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement sparse vector dot productMedium

  Meta's sparse vector dot product question asks you to design a SparseVector class that stores only non-zero entries and computes dot products in time proportional to the number of non-zeros rather than the full vector length. It tests sparse data representation, two-pointer vs. hash-map trade-offs, and time/space complexity analysis.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Implement string dedup and mirror tree traversalMedium

  This question evaluates string-processing and tree-traversal algorithm skills, focusing on efficient group-deletion and streaming-capable string dedup operations and a mirrored boundary traversal of binary trees, and it tests algorithmic design, complexity guarantees, and correctness/termination reasoning.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement string sum and weighted city pickerMedium

  Implement string sum and weighted city picker evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement the Forward Pass of Multi-Head Attention From ScratchMedium

  An ML coding question that asks for the forward pass of multi-head attention from scratch. It tests query, key and value projections, splitting and merging heads, scaled dot-product attention with a stable softmax, causal and padding masks, complexity in sequence length, and self-made correctness checks.

  MetaMachine Learning EngineerMachine LearningTechnical Screen
• Implement tree column grouping and minimal parentheses fixesMedium

  This question evaluates proficiency in tree and string algorithms, specifically binary tree traversal and coordinate-based column grouping with ordering/tie-breaking semantics, as well as string processing for minimal-parentheses deletion, and probes competence with data structures, streaming/online processing, correctness guarantees, and in-place space management. It is commonly asked in the Coding & Algorithms domain to assess algorithmic reasoning, implementation-level trade-offs and complexity analysis, testing both conceptual understanding of ordering and correctness and practical application skills such as achieving linear-time and space-efficient solutions and scaling to large inputs.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement weighted random index pickerMedium

  Implement weighted random index picker evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Implement weighted random sampling with preprocessingMedium

  This problem tests your ability to optimize weighted random selection using binary search on prefix sums, balancing preprocessing time against query latency.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement, Debug, and Optimize a React TableHard

  Implement, Debug, and Optimize a React Table evaluates requirements, assumptions, structured reasoning, trade-offs, and verification in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Infer an Unknown Alphabet OrderMedium

  This question evaluates a candidate's competency in graph-based reasoning, inference of ordering constraints from sequences of strings, and algorithmic manipulation of characters and relations.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Interpreting confidence intervals to choose a treatmentMedium

  Evaluates confidence-interval interpretation for choosing among feed-ranking treatments with engagement losses. Strong answers compare statistical significance, magnitude, uncertainty, business thresholds, downside risk, and launch recommendations.

  MetaData ScientistAnalytics & ExperimentationOnsite