Coding & Algorithms interview questions

Showing 1741–1770 of 3276 results

• Remove minimum parentheses to balance stringMedium

  This question evaluates string-processing and algorithm-design skills within the Coding & Algorithms domain, focusing on balancing parentheses, correctness proofs for minimal edits, and time/space complexity analysis.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Remove runs of length at least kMedium

  This question evaluates string manipulation, run-length detection, and algorithmic efficiency, focusing on tracking and removing maximal contiguous character groups. It is commonly asked in the Coding & Algorithms domain to assess practical application–level skills in designing linear-time, linear-space implementations that handle dynamic sequence collapses using appropriate data structures.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Resolve a cd Path Against the Current DirectoryMedium

  Implement simplified Unix-style cd path resolution for absolute and relative inputs containing repeated separators, dot components, and parent-directory steps. The challenge focuses on component semantics, root boundaries, empty arguments, exact normalization, and linear processing of long paths without filesystem lookups.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Return a Shortest Path Through a Binary GridMedium

  Implement breadth-first search on an 8-directional binary grid to find and reconstruct a deterministic shortest path from the top-left to the bottom-right cell.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Return all root-to-leaf path sumsMedium

  This question evaluates competency in binary tree traversal and path-state accumulation, focusing on the ability to compute sums along root-to-leaf paths while handling edge cases like empty trees and negative values.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Return right and left side views of a treeMedium

  This problem tests your ability to perform level-order traversal on a binary tree and manipulate the results to extract the boundary nodes.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Return the Minimum-Sum Root-to-Leaf PathHard

  Tests tree traversal, path reconstruction, tie-breaking logic, and handling deeply skewed trees with up to 100,000 nodes without exceeding recursion depth limits.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Reverse between equal-value nodes in listMedium

  This question evaluates a candidate's ability to manipulate singly linked lists, perform in-place sublist reversal, and manage pointer references and node boundaries.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse sublist between equal-value nodesMedium

  This question evaluates linked-list manipulation and pointer-management skills, focusing on reversing an in-place sublist between two nodes with equal values while respecting O(n) time and O(1) extra space constraints.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Select words to maximize unique charactersMedium

  This question evaluates understanding of combinatorial search and string manipulation, specifically the ability to reason about unique-character constraints, subset selection, and set-like representations.

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