Coding & Algorithms interview questions

Showing 1831–1860 of 3276 results

• Count Occurrences of Each Suffix MaximumMedium

  This problem tests your ability to use a monotonic stack and a hash map (or frequency array) to efficiently answer suffix queries about the occurrences of the maximum value.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count integer pairs satisfying 1/x + 1/y = 1/NMedium

  This question evaluates understanding of number theory and algorithmic problem-solving, focusing on Diophantine equation manipulation, divisor counting, and translating algebraic constraints into combinatorial counts.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count k for consecutive-sum generatorMedium

  This question evaluates number-theoretic reasoning and understanding of arithmetic progressions, focusing on how sums of consecutive positive integers can be characterized and counted.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count non-decreasing arrays by digit sumsMedium

  This question evaluates combinatorics and constrained counting skills, including reasoning about digit-sum properties, monotonic sequences, modular arithmetic, and efficient algorithm design within the Coding & Algorithms domain.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count the Separate Land Regions in a Binary Grid MapMedium

  A coding exercise that counts the separate land regions in a grid map of land and water cells, where land cells connect only through shared edges. It tests systematic exploration of a two-dimensional grid, correct neighbor handling at borders and corners, and scaling to large grids where one region may cover everything.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Decode a JWT string without librariesHard

  This problem tests your understanding of the JSON Web Token (JWT) structure and your ability to manually implement Base64URL decoding and JSON deserialization in a constrained environment.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Design a Versioned Key-Value StoreMedium

  This problem tests your ability to design a data structure that supports storing multiple values for the same key indexed by timestamps, requiring efficient retrieval of the latest value at or before a specific point in time.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design cache with least-recently-used evictionMedium

  This question evaluates understanding of in-memory key–value cache design, eviction policies, and appropriate data-structure choices to achieve amortized O(1) get and put operations.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect Repeated Patterns in a String SequenceHard

  This problem tests string manipulation, hashing, and the ability to detect repeating sub-sequences of a fixed length k across a stream.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine most popular concert cityMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine most popular concert city states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fewest Distinct Values to Delete So at Least Half the Array Is RemovedMedium

  A coding question that asks for the fewest distinct values whose complete deletion removes at least half of an integer array. It tests reasoning about how often each value occurs, proving that a choice is minimal, and the exact meaning of half when the array length is odd.

  MicrosoftApplied ScientistCoding & AlgorithmsOnsite
• Find Top K Largest ElementsMedium

  This question tests the ability to efficiently find the K largest elements in an unsorted array while managing time complexity constraints through heap-based or selection-based algorithms.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find Unique Zero-Sum TripletsMedium

  Find unique zero-sum triplets with distinct indices, deterministic ordering, careful duplicate suppression, and explicit time and space analysis.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find all balanced k in a permutationHard

  This question evaluates understanding of permutations, array range reasoning, index mapping, and efficient algorithm design for detecting contiguous subarrays that exactly contain the prefix set {1..k}.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find longest substring without repeating charactersMedium

  This problem tests your ability to use the sliding window technique combined with a hash map to efficiently find a maximal subarray meeting a specific constraint.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find lowest common ancestor in treeMedium

  This question evaluates understanding of tree data structures and the lowest common ancestor concept, contrasting use of binary search tree ordering with the general binary tree case while requiring algorithmic time and space complexity reasoning in the Coding & Algorithms domain.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find max consecutive elements with sum below targetMedium

  This question evaluates algorithmic problem-solving with arrays, including reasoning about contiguous subsequences, handling sorted inputs and edge cases, and analyzing time and space complexity.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum cycle cost per nodeHard

  This problem tests your ability to identify cycles within a weighted directed graph and compute the ratio of cycle cost to node count efficiently.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find pairs with the minimum absolute differenceMedium

  This question evaluates array manipulation, sorting-based reasoning, and the ability to generate ordered value pairs that reflect minimum absolute differences while handling ordering and duplicates.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find shortest substring with n unique lettersMedium

  This question evaluates proficiency in string processing, frequency management, and algorithmic optimization for locating constrained contiguous substrings. Commonly asked in the coding & algorithms domain because it reveals how candidates reason about character distinctness and efficiency trade-offs, it targets practical application of algorithmic techniques rather than purely conceptual theory.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Connected Strength for Every Tree NodeMedium

  Compute the maximum weight connected subgraph containing each node in a tree with +1 and -1 neuron weights using rerooting dynamic programming.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Lowest Common Ancestor in a Binary Search TreeMedium

  This problem tests the ability to leverage the Binary Search Tree (BST) property to efficiently locate the Lowest Common Ancestor (LCA) of two nodes.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsHR Screen
• Find the Lowest Common Ancestor in a Binary TreeMedium

  This problem tests tree traversal techniques and recursion logic to identify the deepest node that is an ancestor to two specified nodes in an arbitrary binary tree.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsHR Screen
• Find the Most Visited Track PositionMedium

  Determine the most frequently visited track position given a series of sprint endpoints by efficiently tallying overlapping intervals.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Find where two singly linked lists merge, given each as a sequence of node idsMedium

  Coding practice question: two singly linked lists that may merge into a shared tail are given as sequences of node ids, and you must return the id of the node where they first meet, or -1. It tests reasoning about linked list structure, linear-time traversal, and edge cases such as no shared node or one list being the other's tail.

  MicrosoftSite Reliability EngineerCoding & AlgorithmsOnsite
• Group GPUs by node and partition by linksHard

  This problem tests your ability to model a network as a graph and perform partitioning to optimize internal connectivity constraints.

  MicrosoftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Identify the Extra Directed EdgeMedium

  This question evaluates understanding of graph theory concepts—directed trees, parent-child constraints, and cycle detection—and measures competency in reasoning about how a single extra directed edge can violate rooted-tree properties.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement Calendar, Tokenizer, and Meeting OptimizerMedium

  This problem tests your ability to parse structured meeting request strings into interval objects and then identify the largest subset of non-overlapping meetings that can be scheduled within a fixed workday.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite
• Implement K-Means and Detect Divisible SubarraysMedium

  This question evaluates a candidate's ability to implement an iterative clustering algorithm (K-means) and to reason about subarray sums modulo k, testing competencies in numerical computation, centroid management, edge-case handling, and efficient algorithm design.

  MicrosoftMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement Matrix Move and LoggerMedium

  This problem tests in-place array manipulation for submatrix coordinate transformations and the implementation of a thread-safe, time-windowed rate limiter using a sliding window approach.

  MicrosoftSoftware EngineerCoding & AlgorithmsOnsite