Coding & Algorithms interview questions

Showing 1801–1830 of 3276 results

• Sum Numbers Formed by Root-to-Leaf PathsMedium

  Tests traversal of a complete or sparse binary tree stored in an array, tracking path values to accumulate the total sum of numbers formed from root to leaf.

  MetaSoftware EngineerCoding & AlgorithmsOnsite
• Traverse binary tree by levels with constraintsMedium

  This question evaluates binary tree traversal techniques, use of stacks as constrained data structures, predicate-based filtering of nodes, and the ability to argue algorithmic correctness and analyze time and space complexity.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Traverse levels selecting nodes meeting a predicateMedium

  Traverse levels selecting nodes meeting a predicate 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
• Validate Sorted Order Under a Custom AlphabetMedium

  This problem tests your ability to define custom comparison logic using a lookup table and verify if a list of strings adheres to a non-standard lexicographical ordering.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate a simplified numeric stringMedium

  This question evaluates string-parsing, formal-grammar validation, and edge-case reasoning competencies, including the ability to recognize valid numeric formats and to provide time and space complexity analysis.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate abbreviations and bracketsMedium

  This question evaluates proficiency in string parsing, pattern validation, and algorithmic correctness, covering abbreviation interpretation and bracket balancing while requiring careful handling of edge cases and input constraints.

  MetaSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Validate alternating checkout/return logsMedium

  This question evaluates the ability to process sequential event logs, maintain per-entity state invariants (checkout vs return), and reason about algorithmic time and space complexity within a validation task.

  MetaData EngineerCoding & AlgorithmsTechnical Screen
• Validate carpool capacityMedium

  This question evaluates understanding of interval-based resource accounting and algorithmic reasoning with cumulative constraints, assessing skills in processing time-bound events and managing capacity limits.

  MetaData EngineerCoding & AlgorithmsOnsite
• Validate parentheses and find k-th largestMedium

  This problem tests your ability to handle nested structures using a stack and your efficiency in order-based selection using heap operations.

  MetaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate word abbreviation and reconcile two abbreviationsMedium

  Validate word abbreviation and reconcile two abbreviations 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
• Write SQL for car rental utilization by cityHard

  This question evaluates proficiency in SQL querying and relational data modeling, focusing on time-interval overlap logic, distinct aggregation across joined tables, null handling, and safe computation of utilization metrics.

  MetaData EngineerCoding & AlgorithmsOnsite
• Write queries for follows and bookingsMedium

  This problem tests your ability to manage relational data, handle temporal overlaps for booking availability, and derive insights from social graph-like connections using SQL or data manipulation scripts.

  MetaData EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping IntervalsMedium

  Tests sorting and linear scanning techniques to consolidate overlapping and adjacent closed intervals into a minimal sorted set.

  Micro1Software EngineerCoding & AlgorithmsOnline Assessment
• Answer Running Median Queries Over a Stream of Inserted IntegersMedium

  A coding problem that processes a stream of add and median operations and returns, for every query, the median of all integers inserted so far. It tests choosing data structures that keep the middle of a growing collection quickly accessible, plus correct averaging when the count is even.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Answer common graph, grid, and array tasksMedium

  This problem tests your ability to model a dependency system as a directed graph and identify if a valid order exists using cycle detection (Kahn's Algorithm or DFS).

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Answer suffix maximum-frequency queriesHard

  This problem tests your ability to optimize range frequency queries using precomputation and efficient data structures, specifically focusing on suffix-based constraints.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Assemble DNA payload strings from tagged fragmentsMedium

  This question evaluates proficiency in string manipulation, sequence assembly, and labeled-graph path reconstruction—skills involved in ordering fragments by matching start/end tags and concatenating payloads—and it belongs to the Coding & Algorithms domain.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Assemble async stream reads into objectsHard

  This problem tests your ability to handle partial reads from an asynchronous stream and correctly parse length-prefixed binary data structures.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Bucket Words That Are Letter Rearrangements of One AnotherMedium

  A coding exercise that partitions a list of lowercase words into groups whose members use exactly the same letters with the same counts, returned in a fixed canonical order. It tests efficient grouping over up to ten thousand words, handling duplicates and empty strings, and producing deterministic sorted output.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Build a CSV Query EngineMedium

  This problem tests your ability to parse structured text, perform basic type inference, and implement a filtering mechanism for tabular data.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check a Linked List Palindrome Without Mutating ItMedium

  Check whether a singly linked list is a palindrome in O(n) time and O(1) pointer space without leaving it modified. Practice finding the midpoint, reversing the second half, comparing values, and restoring every link before return.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Check palindrome and find next larger palindromeMedium

  This question tests string manipulation, edge-case handling, and algorithmic efficiency in generating the smallest palindrome greater than a given numeric string.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check palindrome number and next palindromeMedium

  This question tests your ability to manipulate digits of an integer to identify palindromes and efficiently construct the smallest palindrome greater than a given number.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Compute discounted prices and full-price indicesHard

  This question evaluates array-processing skills, competency with next-smaller-or-equal element patterns, and the ability to compute aggregated results under ordering constraints.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute product of array except selfHard

  This problem tests your ability to manipulate array prefixes and suffixes to compute aggregate values efficiently without using the division operator, while handling constraints like modular arithmetic.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute shortest path in cyclic graphMedium

  This question tests the ability to implement a shortest-path algorithm in a directed graph that may contain cycles, specifically evaluating the selection between Dijkstra's algorithm and Bellman-Ford based on edge weight constraints.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute sum of longest positive subarrayMedium

  Compute sum of longest positive subarray 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.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Convert a Hexadecimal Address to Dotted IPv4Medium

  Convert an eight-digit hexadecimal address to network-order dotted IPv4 with strict validation, optional prefixes, and correct high-bit handling.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Count Binary Substrings with Two Equal BlocksMedium

  Tests string traversal, run-length grouping, and recognizing how adjacent homogeneous blocks contribute to valid balanced substrings.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Non-Decreasing Arrays with Prescribed Digit SumsHard

  Count non-decreasing arrays whose values are at most 5000 and match specified decimal digit sums, returning the total modulo 1000000007.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment