Coding & Algorithms interview questions

Showing 1681–1710 of 3276 results

• Find target using robot movement APIMedium

  This question evaluates a candidate's ability to design exploration and state-space search strategies for a robot operating in an unknown, partially blocked 2D grid using a constrained movement and sensing API, testing competency in traversal algorithms, state management, and handling limited observability.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Find the Unique Pair of Array Indices Whose Values Sum to a TargetMedium

  Given an integer array and a target, return the indices of the only pair of different elements whose values add up to the target, smaller index first. Arrays hold up to 10,000 values of up to one billion in magnitude, and the task is a common warm-up that tests clean, efficient array reasoning.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find the kth largest elementMedium

  This question evaluates a candidate's mastery of finding the k-th largest element using selection algorithms and heap data structures, along with algorithmic time and space complexity analysis and techniques for adapting solutions to streaming inputs.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find top-K frequent elements in a streamMedium

  This question evaluates understanding of streaming algorithms, frequency estimation, and data-structure-based top-K selection, emphasizing space/time and accuracy trade-offs when processing large or unbounded data.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Generate unique permutations with duplicatesMedium

  This question evaluates a candidate's understanding of permutation generation and duplicate handling within algorithm design, testing combinatorial reasoning, correctness proofs, and time/space complexity analysis.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Group Binary Tree Nodes by Vertical Column, Top to Bottom and Left to RightMedium

  Return a binary tree's node values grouped by vertical column from left to right, ordering each column top to bottom and breaking ties within a row by left-to-right position. The tree arrives as a level-order list, and the task tests coordinate tracking during traversal and precise tie handling.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Group a tree by vertical columnsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Group a tree by vertical columns states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Guide a mouse to find cheese with APIsHard

  This problem tests your ability to navigate an unknown environment by maintaining internal state and implementing an efficient search algorithm to reach a target.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Handle palindrome & decimal additionMedium

  This question evaluates string manipulation and numeric representation skills, specifically handling decimal-point addition with arbitrary precision and reasoning about palindrome/permutation properties.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement BST Iterator and Ticket QueueMedium

  This problem tests your ability to implement an iterator for a Binary Search Tree (BST) using controlled traversal, and your skill in designing a priority-based queue that handles multi-criteria ordering.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement LRU cache and copy random listMedium

  This problem tests your ability to handle complex pointer manipulation through linked-list deep copying and your proficiency in designing a thread-safe-capable cache using hash maps and doubly-linked lists.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• 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 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