Coding & Algorithms interview questions

Showing 1921–1950 of 3276 results

• Traverse a Matrix in Clockwise Spiral OrderMedium

  Traverse a rectangular matrix in clockwise spiral order without modifying the input. Learn the four-boundary technique and the guards that prevent duplicate visits on the final row or column.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Traverse org chart level by levelEasy

  This problem tests your ability to reconstruct a tree structure from a flat list of relationships and perform a breadth-first search (BFS) to group employees by their organizational depth.

  MicrosoftData ScientistCoding & AlgorithmsTechnical Screen
• Validate a Hierarchy and Compute Propagation TimeHard

  Tests graph validation and traversal by requiring candidates to verify whether directed relationships form a valid single-rooted directed tree and calculate the maximum propagation delay from the root.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Write an average-income functionEasy

  This problem tests your ability to clean and aggregate numerical data using Python, specifically handling missing values (None/NaN) and calculating a clean arithmetic mean.

  MicrosoftData ScientistCoding & AlgorithmsTechnical Screen
• Compute Remaining GPUs With Switching LimitsHard

  This question evaluates a candidate's ability to perform time-series aggregation, array manipulation, and constrained optimization for selecting resources across multiple clusters and days.

  Mistral AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Safe Bomb DefusalMedium

  This problem tests your ability to model a system as a directed graph and determine the reachability of a 'safe' state while avoiding 'dead' states using graph traversal algorithms.

  MithrilSoftware EngineerCoding & AlgorithmsOnsite
• Parse code into operation triads IRMedium

  This question evaluates parsing and IR-generation skills, including tokenization, AST or three-address (operation triads) construction, deterministic control-flow serialization, and management of temporaries and labels.

  MithrilSoftware EngineerCoding & AlgorithmsOnsite
• Group Events by an Ordered Attribute ListMedium

  This problem tests recursive data structuring and hierarchical aggregation by mapping flat event logs to a nested tree of counts based on an ordered list of attributes.

  MixpanelSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement precise string-based decimal additionMedium

  This question evaluates a candidate's proficiency in string-based arbitrary-precision arithmetic, including decimal alignment, fractional carry propagation, normalization of numeric strings, and analysis of time and space complexity.

  MixpanelSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Critical PathHard

  This question evaluates competency in graph algorithms and project scheduling, specifically reasoning about directed acyclic graphs, task dependencies, and accumulation of task durations to identify a critical path.

  ModularSoftware EngineerCoding & AlgorithmsTechnical Screen
• Can you visit all rooms and score parentheses?Medium

  The first problem evaluates graph traversal and reachability by modeling rooms and keys as an implicit graph, and it is commonly asked to assess reasoning about connectivity and exploration in graph-theoretic settings; this falls under the algorithms/graph theory domain and emphasizes practical application of traversal techniques.

  MolocoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute subarray span for each elementHard

  This question evaluates array reasoning and competency in determining span-like influence regions under maximum-value constraints for each element, including handling circular-array extensions and scalability considerations.

  MolocoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Support Dynamic Range SumsHard

  This question evaluates knowledge of data structures and algorithmic techniques for range queries and dynamic updates, along with complexity analysis for time and space.

  MolocoSoftware EngineerCoding & AlgorithmsOnsite
• Find the Longest Consecutive Run of OnesMedium

  Implement an algorithm to find the maximum length of contiguous ones in a binary array without any bit flips, returning 0 for an empty input.

  MolocoadsMachine Learning EngineerCoding & AlgorithmsOnsite
• Design iterator for sorted unionMedium

  This problem tests your ability to design an iterator that merges multiple sorted streams of integers while performing on-the-fly deduplication using minimal extra memory.

  MongoDBSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a thread-safe high-concurrency LRU cacheMedium

  This problem tests your ability to design a thread-safe LRU cache using a combination of a hash map and a doubly linked list, requiring efficient synchronization to handle concurrent access.

  MongoDBSoftware EngineerCoding & AlgorithmsOnsite
• Suppress repeat log messages printed within 10 seconds of their last printed occurrenceMedium

  Coding practice question: process a time-ordered stream of log messages and decide which ones are printed when the same text may print at most once every 10 seconds. It tests tracking state across a stream, exact boundary handling at the 10-second mark, and correctly ignoring suppressed events.

  MongoDBSoftware EngineerCoding & AlgorithmsOther
• Return Binary Search Tree Values in Ascending OrderMedium

  This problem tests the ability to deserialize a level-order encoded Binary Search Tree into a tree structure and perform an in-order traversal to retrieve sorted values.

  Moody'sSoftware EngineerCoding & AlgorithmsOnsite
• Compute minimal cost to merge numbersMedium

  Compute minimal cost to merge numbers 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.

  Morgan StanleySoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute win probability in coin-toss gameEasy

  This question evaluates understanding of probability theory and stochastic processes, focusing on win probability in an alternating coin-toss game and reasoning about pattern occurrence and stopping times in random sequences.

  Morgan StanleyData ScientistCoding & AlgorithmsTechnical Screen
• Count decodings of a digit stringMedium

  Count decodings of a digit string 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.

  Morgan StanleySoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Factorial and SquaresMedium

  A Morgan Stanley data scientist HR-screen live-coding warm-up: implement Python `factorial(n)` (iteratively, then explain the recursive version) and `squares(n)` returning the squares of the first n integers. Evaluates clean Python, the iteration-vs-recursion trade-off, time and space complexity analysis, input validation, and edge cases like n = 0 and negative input.

  Morgan StanleyData ScientistCoding & AlgorithmsHR Screen
• Implement Union-Find and track componentsMedium

  This question evaluates understanding and implementation of the Disjoint Set Union (Union-Find) data structure, covering union by rank, path compression, API design for union(a, b), connected(a, b), count(), and analysis of time and space complexity.

  MotiveSoftware EngineerCoding & AlgorithmsOnsite
• Implement Union-Find for connectivityMedium

  This question evaluates understanding and implementation of the Disjoint Set Union (Union-Find) data structure—including path compression and union by rank—and competency in processing online connectivity queries on undirected graphs, categorized under Coding & Algorithms in the graph algorithms and data structures domain.

  MotiveSoftware EngineerCoding & AlgorithmsOnsite
• Compute Jaccard similarity between two stringsMedium

  This question evaluates string tokenization, set-based similarity metrics (Jaccard index) and basic set operations, testing competency in text processing and algorithmic reasoning within the Coding & Algorithms domain and requiring practical application of these concepts.

  MoveworksSoftware EngineerCoding & AlgorithmsOnsite
• Find a secret word via match feedbackMedium

  This question evaluates algorithmic search, pattern-matching, and information-elimination skills in an interactive Mastermind-style word-guessing scenario, testing string comparison and combinatorial reasoning under constrained feedback.

  MoveworksSoftware EngineerCoding & AlgorithmsOnsite
• Compute the Final Robot ScoreEasy

  Tests proficiency in using priority queues (heaps) to manage dynamic multisets under iterative reductions. Evaluates the ability to simulate priority-based selection and reason about time and space complexity.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Construct tree from inorder & postorderMedium

  This question evaluates understanding of binary tree reconstruction and traversal order relationships, specifically the ability to derive tree structure from inorder and postorder arrays and implement the corresponding algorithm.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Server Pairs Relayed Through Each Node of a Weighted TreeMedium

  Given a weighted tree of servers and a signal speed, count for every server how many pairs of other servers it can relay: both path lengths must be multiples of the speed and the two paths must share no cable. Tests tree traversal, path-length reasoning and careful combinatorial counting.

  NVIDIASoftware EngineerCoding & AlgorithmsOther
• Count Substrings with No Repeated CharactersHard

  Tests sliding window / two-pointer techniques to count all valid substrings without duplicate characters in linear time.

  NVIDIASoftware EngineerCoding & AlgorithmsTechnical Screen