Coding & Algorithms interview questions

Showing 1771–1800 of 3276 results

• 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
• Solve grid shortest path and robot cleaningMedium

  This question evaluates a candidate's ability to implement grid-based graph traversal and stateful simulation, assessing skills in shortest-path search and systematic exploration for cleaning tasks.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve increasing sequence and path problemsMedium

  Solve increasing sequence and path problems 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 island and frequency problemsMedium

  These problems evaluate graph traversal and connected-component identification in 2D grids plus frequency analysis and selection in arrays, covering concepts such as DFS/BFS, Union-Find, hashing, heaps and bucket sort.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve island connectivity and string multiplicationMedium

  This question evaluates graph connectivity reasoning (computing minimum edges to unify components) and string-based big-integer arithmetic (multiplying numbers represented as strings), testing competency in graph theory, component analysis, and numeric string manipulation.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve library coding tasks in PythonMedium

  Solve library coding tasks in Python 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.

  MetaData EngineerCoding & AlgorithmsTechnical Screen
• Solve linked list, tree, and grid problemsMedium

  This set evaluates mastery of core data structures and algorithmic reasoning across singly linked lists (cycle entry detection), binary search trees with parent pointers (in-order successor), constant-time state tracking for n×n game boards, and grid connectivity for maximizing component size, emphasizing pointer manipulation, traversal logic, state-design, and component analysis. Commonly asked to gauge proficiency in Coding & Algorithms and complexity analysis, these problems test both conceptual understanding of traversal and connectivity principles and practical application of space- and time-efficient implementations under typical interview constraints.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve linked-list and top-K algorithm tasksMedium

  This question evaluates competency in fundamental data structures and algorithmic techniques, including linked list manipulation, frequency counting and top‑K retrieval, closest-point geometric queries, and stack-based string processing for repeated deletions.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve matrix components, median, and traversalsMedium

  This question evaluates algorithmic problem-solving across grid and graph algorithms, selection algorithms, and traversal techniques—specifically connected-component detection in binary matrices, median-finding across two sorted arrays, and BFS/DFS traversal variants—measuring competence in data structures, complexity analysis, and handling edge cases. Commonly asked in Coding & Algorithms interviews for Machine Learning Engineer roles, it assesses efficiency and correctness concerns such as time and space complexity and traversal orders, testing both conceptual understanding of algorithmic principles and practical implementation distinctions like iterative versus recursive variants.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Solve matrix diagonal and sliding-window statisticsMedium

  Solve matrix diagonal and sliding-window statistics 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.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Solve palindrome-check and vertical-order traversalEasy

  This prompt evaluates string-processing and tree-traversal competencies by asking whether a string can become a palindrome after at most one deletion and by requiring a vertical-order traversal of a binary tree, testing understanding of palindrome properties, node ordering, and handling of edge cases in the coding and algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve peak element and unique word abbreviationMedium

  This question evaluates algorithmic design and data-structure skills by combining a binary-search peak-finding problem with a string-abbreviation uniqueness problem, testing competence in time-complexity reasoning and creation of minimal unique representations.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve permutation successor and evaluate expressionsMedium

  This question evaluates understanding of lexicographic permutation generation with in-place array manipulation and linear-time arithmetic expression parsing and evaluation, focusing on algorithmic efficiency, constant extra space constraints, and correct operator semantics.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve three LeetCode coding problemsMedium

  The trio of problems — Minimum Remove to Make Valid Parentheses, Making a Large Island, and Binary Tree Right Side View — evaluates algorithmic problem-solving, proficiency with core data structures (strings, grids/graphs, and trees), and awareness of time and space complexity.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve tree diameter and grid path problemsMedium

  This question evaluates understanding of graph algorithms and pathfinding, covering tree diameter computation and grid shortest-path problems as well as enumeration of simple paths, and requires skills in traversal techniques, combinatorial reasoning, and time/space complexity analysis.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve tree leaf sum and target indices searchMedium

  This question evaluates proficiency in tree traversal and array search algorithms, specifically handling recursive depth-first traversal with path-based numeric accumulation and performing logarithmic-time search over sorted data.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Solve tree traversal and interval merging tasksMedium

  This question evaluates algorithmic problem-solving and data-structure competency, focusing on binary tree traversal and column-wise ordering (including BFS versus DFS trade-offs) as well as interval merging and sorting strategies for scheduling.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve tree traversal and two-pointer problemsMedium

  Solve tree traversal and two-pointer problems 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 tree view and parentheses cleanupMedium

  This question evaluates binary tree traversal and view-extraction skills for the right-side view problem and string-processing and minimal-edit balancing for the parentheses cleanup, probing competency in data-structure traversal, state tracking, and correctness under edge cases.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve two linked list/array tasksEasy

  This problem tests your ability to manipulate linked list pointers to detect cycles and solve a classic array-based problem using the two-pointer technique to find specific target sums.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Solve weighted pick and product except selfMedium

  This question evaluates algorithm design and data-structure skills, focusing on weighted random selection and array aggregation for product computations within the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve windowed duplicates and target expressionMedium

  This question evaluates proficiency in windowed duplicate detection and time-space trade-offs for streaming or bounded-range scans, along with combinatorial expression generation and on-the-fly numeric evaluation using search, reflecting skills in algorithm design, data-structure selection, and numeric correctness.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve word count, node, segmentation, stock tasksMedium

  This multipart question evaluates skills in tokenization and streaming text processing, generic rooted-tree data-structure design and traversal APIs, dictionary-based string segmentation (dynamic programming and prefix/prefix-structure optimization), and constrained algorithmic optimization for stock-trading problems.

  MetaSoftware EngineerCoding & AlgorithmsOnsite