Katkat

practice a little every day, paws crossed ♡

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 2611–2640 of 4616 results

  • MicrosoftEasyData Scientist
    Explain SHAP and build an ML project

    This question tests your conceptual understanding of SHAP values for model interpretability and your ability to design a robust, end-to-end machine learning pipeline for a real-world business problem.

    Machine LearningTechnical ScreenSHAPInterpretabilityMLOps
  • MicrosoftMediumData Scientist
    Explain SHAP in an ML System

    This question evaluates a data scientist's competence in designing and operationalizing end-to-end machine learning systems in the Machine Learning domain, covering problem framing, label and feature design, model selection, evaluation, deployment, monitoring, and model interpretability using SHAP.

    Machine LearningTechnical Screen
  • MicrosoftEasyMachine Learning Engineer
    Explain Transformers and deploy an LLM safely

    This question evaluates understanding of Transformer architectures and practical LLM deployment competencies, covering attention mechanisms, token and positional representations, computational complexity, and production concerns like latency, cost, quality, safety, and privacy.

    ML System DesignTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Explain deadlock cases and how to prevent them

    This question evaluates understanding of deadlocks, concurrency control, and resource synchronization in concurrent programming, testing competency in identifying the necessary conditions for deadlock, analyzing concrete scenarios including circular waits, and considering engineering approaches for prevention, detection, and recovery.

    Software Engineering FundamentalsTechnical Screen
  • MicrosoftMediumMachine Learning Engineer
    Explain metrics, regularization, and ablation studies

    This question evaluates understanding of classification evaluation metrics, regularization methods, and experimental design for component-level analysis in NLP and broader Machine Learning systems, testing competencies in performance measurement, regularization trade-offs, and causal attribution of model components.

    Machine LearningTechnical Screen
  • MicrosoftHardSoftware Engineer
    Explain owning and debugging infra modules

    This question evaluates ownership, debugging, and operational competence for low-level infrastructure components such as storage, distributed systems, and other reliability-critical infra, emphasizing reliability/performance goals, incident investigation, trade-off reasoning, and executional ownership.

    Behavioral & LeadershipTechnical Screen
  • MicrosoftMediumMachine Learning Engineer
    Find Top K Largest Elements

    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.

    Coding & AlgorithmsTechnical ScreenArraysHeapSorting
  • MicrosoftMediumSoftware Engineer
    Find Unique Zero-Sum Triplets

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

    Coding & AlgorithmsTechnical Screen
  • MicrosoftHardSoftware Engineer
    Find all balanced k in a permutation

    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}.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumData Scientist
    Find common friends from directed edges

    This question evaluates a candidate's ability to manipulate relational data and reason about graph reciprocity, specifically testing SQL query formulation, aggregation, deduplication, and indexing for performance in the Data Manipulation (SQL/Python) domain.

    Data Manipulation (SQL/Python)Technical Screen
  • MicrosoftMediumSoftware Engineer
    Find longest substring without repeating characters

    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.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapString
  • MicrosoftMediumSoftware Engineer
    Find lowest common ancestor in tree

    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.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumMachine Learning Engineer
    Find pairs with the minimum absolute difference

    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.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Find the Bugs in an AI-Generated URL Shortener

    Tests code review, debugging, and refactoring skills by identifying flaws in an AI-generated in-memory URL shortener and implementing a robust, thread-safe replacement.

    Software Engineering FundamentalsTechnical ScreenCode ReviewConcurrencyHashing
  • MicrosoftMediumSoftware Engineer
    Greedy and Top-k Beam Search Decoding That Returns the Sentence Probability

    A coding question on decoding a sequence from a next-token probability distribution: implement greedy decoding, extend it to beam search that keeps the top k partial sequences, and return the chosen sequence with its overall probability. It also probes why long sequences tend to receive low probability and how decoding should account for that.

    Machine LearningTechnical Screen
  • MicrosoftHardSoftware Engineer
    Group GPUs by node and partition by links

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

    Coding & AlgorithmsTechnical ScreenGraph TheoryBipartite MatchingCombinatorial Optimization
  • MicrosoftMediumData Scientist
    How would you build and evaluate a classifier?

    This problem tests your ability to design a binary classification pipeline from metric selection to production monitoring, with a focus on aligning technical decisions with business objectives.

    Machine LearningTechnical ScreenClassificationModel EvaluationImbalanced Data
  • MicrosoftMediumData Scientist
    How would you estimate impact without A/B?

    This question tests your ability to design quasi-experimental methods to infer causal impact when randomization is not possible due to technical or business constraints.

    Analytics & ExperimentationTechnical ScreenCausal InferenceQuasi-experimentsDiD
  • MicrosoftMediumSoftware Engineer
    Implement a Bounded Per-Key Ordered Task Executor

    Design and implement a thread-safe, bounded task executor that guarantees sequential execution per key while enforcing a global concurrency limit across all keys.

    Software Engineering FundamentalsTechnical Screenconcurrencymultithreadingsystem-design-basics
  • MicrosoftMediumSoftware Engineer
    Implement a Snapshot Set Iterator

    This problem tests your ability to design a data structure that maintains point-in-time consistency for an iterator despite subsequent modifications to the underlying collection.

    Coding & AlgorithmsTechnical ScreenData StructuresDesignIterator
  • MicrosoftMediumSoftware Engineer
    Implement a type-based mutex for tasks

    This problem tests knowledge of synchronization primitives, dictionary-based locking mechanisms, and the ability to manage resource contention based on dynamic categorization.

    Coding & AlgorithmsTechnical ScreenConcurrencySynchronizationMultithreading
  • MicrosoftHardSoftware Engineer
    Implement array and tree traversal tasks

    This problem tests your ability to optimize an array-based trading algorithm using a greedy approach and your mastery of level-order tree traversal to extract a specific view of a binary tree.

    Coding & AlgorithmsTechnical ScreenGreedyBFSDFS
  • MicrosoftHardSoftware Engineer
    Implement concurrent structures and debug queue code

    This question evaluates data-structure implementation and concurrent programming competencies by testing construction of an LRU cache, a custom hash map, a quadtree spatial index, and debugging of a producer-consumer queue.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Implement greedy decoding and beam search

    This question evaluates understanding of autoregressive decoding strategies—greedy decoding and beam search—including cumulative log-probability scoring, beam maintenance, EOS handling, and sequence expansion logic; it is categorized under Coding & Algorithms for Software Engineer roles.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    In-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 Engineer
    Introduce yourself and explain 'Why us?'

    This question evaluates behavioral and leadership competencies—communication, decision-making under ambiguity, stakeholder alignment, technical leadership, mentorship, and impact articulation—within the Category: Behavioral & Leadership for a software engineering role.

    Behavioral & LeadershipTechnical Screen
  • MicrosoftMediumSoftware Engineer
    List 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 Engineer
    Merge 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 Engineer
    Parse 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 Scientist
    Print 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