Coding & Algorithms interview questions

Showing 1651–1680 of 3276 results

• Detect a Contiguous Subarray with a Target SumMedium

  Determine whether an integer array containing negative values has any nonempty contiguous subarray that equals a target, using prefix sums for a linear-time solution.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine feasibility and clean parentheses stringMedium

  This problem tests your ability to manipulate string structures using stack-based logic and perform graph-based dependency resolution using topological sort.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine if subarray sums to targetMedium

  This question evaluates a candidate's ability to reason about contiguous subarray sums, efficient array manipulation, and handling large numeric ranges within algorithmic constraints, and it falls under the Coding & Algorithms domain as a practical algorithmic implementation problem.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate arithmetic expression without parenthesesMedium

  Evaluate arithmetic expression without parentheses 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
• Evaluate expression without stack, constant spaceMedium

  Evaluate expression without stack, constant space 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
• Extend BFS maze solver with keys and arrowsMedium

  This problem tests your ability to adapt Breadth-First Search (BFS) to a state-space where the current location is augmented by a collection of keys, effectively transforming the grid into a larger, multi-layered graph.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Extend a Maze SolverMedium

  This question evaluates algorithmic problem-solving and software engineering skills, specifically graph traversal (BFS), state-space modeling for keys and doors, handling movement constraints, and debugging an existing codebase within the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Extend cloud file system with copy and compressionMedium

  This question evaluates understanding of data structures and algorithms for stateful resource management, covering bookkeeping of per-user quotas, file metadata operations (copy, compress/decompress), string filtering and sorting, and efficient selection and deletion of largest elements.

  MetaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fill rooms with nearest gate distancesMedium

  This question evaluates grid-based graph traversal and algorithmic problem-solving skills, including concepts such as multi-source breadth-first search, handling sentinel values, and performing in-place updates.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find All Binary Tree Nodes Exactly K Edges from a Target NodeMedium

  A binary tree coding problem: given a tree with distinct values, a target node and a distance k, return every node exactly k edges away, including nodes reached by moving up through ancestors. It tests traversal in both directions of a tree, level-order input parsing and careful handling of visited nodes.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find Any Local Minimum with Iterative Binary SearchMedium

  Find the index of any strict local minimum in a nonempty array whose adjacent values differ, using an iterative logarithmic-time algorithm. The task tests search invariants, boundary-as-infinity semantics, singleton and monotone arrays, and correctness when several indices are valid.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find K-th Largest and Longest VacationMedium

  This pair of problems evaluates array manipulation and algorithmic problem-solving skills, specifically order-statistics for selecting the k-th largest element and maximizing consecutive sequences under constrained transformations for the vacation streak problem.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Kth Largest and Tree AncestorsMedium

  This question evaluates algorithmic problem-solving and data-structure competencies, focusing on selection algorithms and time/space complexity reasoning for the k-th largest element and tree traversal, lowest common ancestor discovery with attention to BST properties, parent pointers, and external-memory constraints.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Maximum Unique-Character SubsetHard

  This problem tests your ability to use bitmasking and backtracking with pruning to solve a variation of the maximum set packing problem under character constraints.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Find Shortest Unique PrefixesMedium

  This problem tests your ability to efficiently manage and query prefix-based string sets using a Trie (prefix tree) data structure.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Words Containing Other WordsHard

  This problem tests your ability to efficiently identify all words in a list that contain at least one other word from the same list as a substring, utilizing optimized string processing or data structures like Tries.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Find a Local Minimum with Left-Biased Binary SearchMedium

  This problem tests the ability to adapt binary search to identify a local minimum in an unsorted array, focusing on handling boundary conditions and non-strict inequality logic.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find a String Containing AnotherMedium

  This question evaluates proficiency in string algorithms, substring search techniques, and algorithmic complexity analysis within the Coding & Algorithms domain.

  MetaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find balanced subarray and increasing tree pathMedium

  This question evaluates array and tree algorithm skills, testing competency in identifying longest balanced subarrays in binary sequences and locating maximal strictly increasing downward paths in binary trees.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find integer in most intervalsMedium

  This question evaluates a candidate's ability to reason about interval overlap counting, manage range endpoints efficiently, and balance time-space trade-offs when identifying points that maximize coverage.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find k most frequent elements, discuss O(n)Medium

  Find k most frequent elements, discuss O(n) 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
• Find kth largest element in arrayMedium

  A classic Meta software engineer onsite coding question: return the k-th largest element from an unsorted integer array, handling duplicates correctly. It tests order statistics and selection algorithms — sort, size-k min-heap (O(n log k)), and quickselect (O(n) average) — and the candidate's ability to beat a full sort.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find kth smallest in sorted matrixMedium

  This question evaluates algorithmic problem-solving and data-structure knowledge, focusing on selection in a row-and-column-sorted matrix and the comparative use of min-heaps versus value-space binary search along with time/space complexity and edge-case analysis.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Find longest palindromic substringMedium

  This problem tests your ability to optimize string processing algorithms, specifically moving from a brute-force approach to an efficient expansion-based technique for identifying palindromic patterns.

  MetaMachine Learning EngineerCoding & AlgorithmsOnsite
• Find minimum and most frequent number efficientlyMedium

  Find minimum and most frequent number efficiently 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
• Find missing ranges in intervalMedium

  This question evaluates a candidate's proficiency in array traversal, interval reasoning, handling edge cases including empty inputs and 32-bit integer boundary conditions, and enforcing time and space complexity constraints.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find mode or minimum with time-space tradeoffsMedium

  This question evaluates algorithm design and analysis skills—particularly time–space tradeoffs, frequency counting techniques (sorting, hashing, and counting arrays), and handling streaming or memory-constrained inputs in the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find power-of-two subarrays within sum rangeMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find power-of-two subarrays within sum range states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find shortest subarray with range ≥ kMedium

  This question evaluates proficiency with array algorithms and range-query reasoning, testing understanding of max/min behavior over contiguous subarrays and use of appropriate data-structure techniques; it belongs to the Coding & Algorithms domain.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Find shortest substring with N unique charactersMedium

  This question evaluates proficiency in string processing, handling character-uniqueness constraints, and algorithmic thinking about time and space efficiency.

  MetaSoftware EngineerCoding & AlgorithmsOnsite