Meta interview questions

Showing 571–600 of 666 results

• Simulate Monster Team BattlesHard

  This question tests the ability to implement a stateful, turn-based simulation engine using object-oriented principles, efficient queue management, and rule-based damage calculations.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Size opportunity for new product lineMedium

  This question evaluates a data scientist's skills in financial opportunity sizing, sensitivity analysis, and experimental design by requiring quantitative modeling of impacted users, incremental orders, revenue, and gross profit for a proposed product line.

  MetaData ScientistAnalytics & ExperimentationOnsite
• Solve Array, Matrix, and Recommendation ProblemsMedium

  This question evaluates algorithmic skills across array manipulation, grid pathfinding, and graph-based recommendation systems, testing competencies in in-place transformations, efficient traversal/search, and candidate ranking under constraints.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve Four Online Assessment ProblemsMedium

  This multi-part question evaluates algorithmic problem-solving across array manipulation, exact fraction comparison, scheduling and simulation with ordered event lists, matrix transformation operations, and string concatenation/counting, exercising skills in data structures, searching, and combinatorial counting.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Matrix, Tree, Nested, LCA, Maze TasksMedium

  This set of tasks evaluates algorithm design and data structure competencies across matrix traversal, tree path-sum aggregation, nested-list depth weighting, lowest common ancestor discovery using parent pointers, and several rolling-maze reachability and shortest-path variants.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve Maze and Suffix ProblemsMedium

  This two-part question evaluates stateful graph traversal and shortest-path reasoning under key-and-door constraints, alongside efficient string-suffix matching and scalable data-structure design, testing competencies in state management, graph/search algorithms, string algorithms, and algorithmic optimization.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve PTO window and sparse unique countingMedium

  Solve PTO window and sparse unique counting 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
• Solve Parser, Trading, Tree, And Deck TasksMedium

  This question evaluates input validation and parsing for numeric literals, array-based algorithmic optimization for single-trade profit, tree traversal for extracting rightmost nodes per depth, and software design for a stateful card-deck with shuffle and testing.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve Python and SQL data tasksMedium

  This question evaluates data manipulation and engineering competencies by testing Python proficiency with nested data structure handling, complexity analysis and test-case design, alongside SQL proficiency in UTC-aware aggregation and per-user deduplication to compute daily active users; it is categorized as Data Manipulation (SQL/Python) within the data engineering domain. Such problems are commonly asked to assess practical implementation ability and robustness under edge cases, as well as conceptual understanding of time/space complexity and correct date-time handling, reflecting a primarily practical application with elements of conceptual analysis.

  MetaData EngineerData Manipulation (SQL/Python)Technical Screen
• Solve SQL and Python coding tasksMedium

  This question evaluates SQL proficiency in relational querying (joins, filtering, aggregation) and Python algorithmic problem-solving for non-adjacent selection, measuring a data engineer's ability to manipulate relational data and implement efficient algorithms.

  MetaData EngineerCoding & AlgorithmsTechnical Screen
• Solve Three Coding Interview ProblemsMedium

  This set of tasks evaluates proficiency in data structures and algorithms, covering tree traversal and lowest common ancestor reasoning, interval merging and overlap resolution, and combinatorial subset selection under uniqueness constraints.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Tree Diameter and Palindromic CountsMedium

  This problem tests your ability to perform recursive depth-first searches on binary trees and efficient string manipulation to count palindromic subsequences or paths.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve Tree View and Triplet SumEasy

  This multipart question evaluates proficiency with tree-based data structures and array-based algorithmic problem solving, focusing on reasoning about which nodes are visible from a binary tree's right side and identifying unique zero-sum triplets in an integer array; it tests concepts such as tree traversal, duplicate handling, and algorithmic complexity analysis. These problems are commonly asked to assess algorithmic problem-solving ability, manipulation of fundamental data structures, and attention to edge cases and performance, and they fall under the Coding & Algorithms category with a focus on practical application of algorithmic concepts supported by conceptual understanding of data structures and complexity.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Tree Views, Columns, and CalculatorEasy

  This problem tests your ability to perform recursive binary tree traversals to extract horizontal and vertical views, followed by implementing a stack-based parser to handle mathematical expressions with standard order of operations.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve Two Backtracking Array ProblemsHard

  This prompt evaluates algorithmic problem-solving skills focused on combinatorial search and backtracking, including handling duplicate values, index distinctness, and enforcing character-uniqueness constraints across concatenated subsets.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve UTF-8 Validation & Shortest PathMedium

  This pair of problems evaluates skills in data encoding interpretation and graph traversal, examining competency in validating byte-oriented input formats and computing shortest paths on binary matrices.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve a Key-Door Corridor MazeMedium

  This problem tests your ability to model a search space beyond simple coordinate traversal by incorporating state-dependent constraints (keys) using Breadth-First Search.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve array merge and tree flattening problemsMedium

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

  MetaSoftware EngineerCoding & AlgorithmsHR Screen
• Solve array, tree, and maze problemsMedium

  This problem tests your ability to combine binary tree traversal with spatial grouping and grid-based pathfinding to determine if nodes with specific values are reachable from a starting point in a maze.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve binary tree, grid, and heap tasksMedium

  Solve binary tree, grid, and heap tasks 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
• Solve classic LeetCode problemsMedium

  This question evaluates proficiency with core data structures and algorithmic techniques including array selection and ordering, string pattern grouping, interval/rectangle merging, and binary search tree range queries.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve coding and AI-assisted tasksMedium

  This problem tests your ability to manipulate tree structures with parent pointers and verify path validity under specific movement constraints.

  MetaBackend EngineerCoding & AlgorithmsOnsite
• Solve counting and frequency coding tasksMedium

  This problem tests your ability to handle frequency counting and constraint-based pair identification efficiently, often requiring a hash map to maintain counts while traversing a stream.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve diverse LeetCode algorithm problemsMedium

  This collection evaluates proficiency with fundamental data structures and algorithmic techniques — including matrix and graph traversal, hash-based sets for O(1) operations, linked list manipulation, sliding-window strategies, recursive processing of nested structures, and stack/string handling — along with complexity analysis and reliable implementation. Commonly asked in the Coding & Algorithms domain, these problems assess pattern recognition, algorithmic reasoning, and practical implementation skills under time and space constraints, emphasizing applied problem-solving over purely theoretical concepts.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve four OA coding problemsEasy

  This set of coding tasks evaluates fundamental skills in array manipulation, graph traversal, greedy strategy, and sequence analysis.

  MetaSoftware EngineerCoding & AlgorithmsHR Screen
• Solve four OA string/array/matrix/graph tasksEasy

  This problem tests foundational proficiency in four distinct domains: string processing, array simulation, matrix transformation, and graph traversal.

  MetaMachine Learning EngineerCoding & AlgorithmsOnline Assessment
• Solve four algorithmic problemsMedium

  This multi-part question evaluates algorithmic problem-solving and data-structure proficiency across string processing (validating parentheses with minimal deletions), tree operations (lowest common ancestor using parent pointers), nested-structure traversal and accumulation (depth-weighted sum), and geometric selection/ordering (k closest points).

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve four data structure and algorithms tasksMedium

  This set of tasks evaluates core algorithmic competencies such as tree traversal and level-order processing, data-structure design and counting maps, recursive subtree aggregation for statistical checks, and optimization/search techniques for partitioning problems, all within the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve grid path and robot navigationMedium

  This question evaluates proficiency in graph traversal and pathfinding, state representation for unknown environments, exploration and backtracking, and rigorous reasoning about correctness and time/space complexity.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve grid path and top‑k frequencyMedium

  This question evaluates algorithmic problem-solving in grid reachability and frequency analysis, testing concepts such as grid/graph traversal and obstacle handling for path existence alongside frequency counting and selection for top-k elements.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen