practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 931–960 of 1706 results
- MicrosoftMediumSoftware EngineerIn-Memory URL Shortener: Encode and Decode
Design an in-memory URL shortener class supporting fast encoding and decoding between original long URLs and compact short URLs using hash maps.
Coding & AlgorithmsTechnical Screenhash-tabledesignstring - MicrosoftMediumSoftware EngineerList Point Pairs Spanning Non-Degenerate Boxes in N Dimensions, Sorted by Volume
A coding problem that takes points in two or more dimensions, finds every pair whose axis-aligned box has non-zero volume, and returns those pairs with their volumes in a strict order. It tests careful pair enumeration, handling of flat or degenerate boxes, and deterministic sorting with tie-breaks.
Coding & AlgorithmsTechnical Screen - MicrosoftMediumSoftware EngineerMerge overlapping intervals
This question tests the ability to manage and merge interval-based data, requiring sorting and a single-pass linear traversal to resolve overlaps.
Coding & AlgorithmsTechnical ScreenSortingIntervalsArrays - MicrosoftMediumSoftware EngineerParse a Signed Integer in an Arbitrary Base
Parse signed integers in bases 2–36 with explicit syntax, negative-boundary handling, pre-arithmetic overflow checks, and deterministic error precedence.
Coding & AlgorithmsTechnical Screen - MicrosoftMediumData ScientistPrint Org Chart by Level
This problem tests your ability to model a tree structure from flat parent-child relations and perform a level-order traversal to format hierarchical data.
Coding & AlgorithmsTechnical ScreenTreesBFSGraphs - MicrosoftHardSoftware EngineerReturn Top K Open Businesses
This problem tests your ability to filter data streams and maintain a top-K collection using a priority queue with custom sorting logic.
Coding & AlgorithmsTechnical ScreenSortingHeapsFiltering - MicrosoftHardSoftware EngineerReturn a topological ordering of a graph
This question tests the ability to implement Kahn's algorithm or a DFS-based approach to perform a topological sort while correctly handling cycle detection.
Coding & AlgorithmsTechnical ScreenGraphTopological SortKahn's Algorithm - MicrosoftMediumMachine Learning EngineerReturn the k most frequent values in an array with a deterministic tie rule
Return the k values that occur most often in an integer array, ranked by frequency with ties broken by the smaller value. It tests frequency counting, selecting the top k efficiently and producing a deterministic order when several values tie at the cutoff.
Coding & AlgorithmsTechnical Screen - MicrosoftMediumSoftware EngineerSolve Three Coding Interview Problems
This problem tests your ability to manipulate sorted data, optimize for mathematical properties, and implement efficient data structures for string prefix operations.
Coding & AlgorithmsTechnical ScreenArraysMathTrie - MicrosoftEasySoftware EngineerSolve binary-tree reverse printing and LPS
This question evaluates proficiency with tree data structures and level-order traversal semantics for reverse level printing, as well as string algorithmic reasoning and dynamic programming concepts for computing the longest palindromic subsequence, categorized under Coding & Algorithms.
Coding & AlgorithmsTechnical Screen - MicrosoftEasySoftware EngineerSolve four classic algorithm problems
This set evaluates proficiency in core algorithms and data structures: tree traversal and order manipulation (zigzag level-order), dynamic programming and subsequence reasoning (longest palindromic subsequence), numeric algorithms and search/approximation (integer square root), and positional numeral systems/base conversion (spreadsheet column to number). These problems are commonly asked to assess algorithmic thinking, complexity analysis, and handling of edge cases in the Coding & Algorithms domain, testing both conceptual understanding of underlying principles and practical application of implementation techniques.
Coding & AlgorithmsTechnical Screen - MicrosoftHardSoftware EngineerSolve power jumps and graph tour
This problem tests your ability to optimize minimal operations using bitwise properties and to determine the existence of a specific graph traversal path.
Coding & AlgorithmsTechnical ScreenGreedyBitmask DPGraph Theory - MicrosoftMediumSoftware EngineerSort Three Categories In Place
This question evaluates proficiency in in-place array manipulation, constant-space algorithms, and linear-time partitioning techniques. Commonly asked in Coding & Algorithms interviews to assess algorithmic efficiency, pointer/index management, and reasoning about invariants, it focuses on practical application of algorithmic concepts rather than purely theoretical understanding.
Coding & AlgorithmsTechnical Screen - MicrosoftMediumSoftware EngineerStream output until stop token appears
This problem tests your ability to process streaming data from a generator while detecting a multi-character stop sequence that may be split across data chunks.
Coding & AlgorithmsTechnical ScreenStringsStreamingGenerators - MicrosoftEasyData ScientistTraverse org chart level by level
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.
Coding & AlgorithmsTechnical ScreenTreesBFSGraphs - MicrosoftHardSoftware EngineerValidate a Hierarchy and Compute Propagation Time
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.
Coding & AlgorithmsTechnical Screengraphtreedfs - MicrosoftEasyData ScientistWrite an average-income function
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.
Coding & AlgorithmsTechnical ScreenData CleaningPythonStatistics - Mistral AIHardSoftware EngineerCompute Remaining GPUs With Switching Limits
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.
Coding & AlgorithmsTechnical Screen - MixpanelMediumSoftware EngineerGroup Events by an Ordered Attribute List
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.
Coding & AlgorithmsTechnical ScreenHash MapsRecursionData Aggregation - MixpanelMediumSoftware EngineerImplement precise string-based decimal addition
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.
Coding & AlgorithmsTechnical Screen - ModularHardSoftware EngineerFind the Critical Path
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.
Coding & AlgorithmsTechnical Screen - MolocoMediumSoftware EngineerCan you visit all rooms and score parentheses?
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.
Coding & AlgorithmsTechnical Screen - MolocoHardSoftware EngineerCompute subarray span for each element
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.
Coding & AlgorithmsTechnical Screen - MongoDBMediumSoftware EngineerDesign iterator for sorted union
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.
Coding & AlgorithmsTechnical ScreenHeapIteratorsMerge Sort - Morgan StanleyEasyData ScientistCompute win probability in coin-toss game
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.
Coding & AlgorithmsTechnical Screen - NVIDIAEasySoftware EngineerCompute the Final Robot Score
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.
Coding & AlgorithmsTechnical ScreenHeapPriority QueueSimulation - NVIDIAMediumSoftware EngineerConstruct tree from inorder & postorder
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.
Coding & AlgorithmsTechnical Screen - NVIDIAHardSoftware EngineerCount Substrings with No Repeated Characters
Tests sliding window / two-pointer techniques to count all valid substrings without duplicate characters in linear time.
Coding & AlgorithmsTechnical Screensliding-windowtwo-pointersstrings - NVIDIAMediumSoftware EngineerDesign and implement an LRU cache
This problem tests your ability to design a cache that supports O(1) time complexity for both insertions and lookups by combining a hash map with a doubly linked list.
Coding & AlgorithmsTechnical ScreenHash MapLinked ListCaching - NVIDIAHardSoftware EngineerDetermine Whether One Point Can Reach Another
Determine whether a starting point (sx, sy) can reach a target (tx, ty) on a 2D integer grid via addition moves, optimized for coordinates up to 10^18.
Coding & AlgorithmsTechnical ScreenMathNumber TheoryGreedy
Microsoft
Mistral AI
Mixpanel
Moloco
MongoDB
Morgan Stanley
NVIDIA