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 871–900 of 9403 results

  • AmazonMediumSoftware Engineer
    Root-Cause Analysis Under Uncertainty

    This question tests your structured approach to troubleshooting complex, ambiguous production issues and your ability to balance urgent mitigation with long-term systemic stability.

    Behavioral & LeadershipOnsiteBehavioralRoot-Cause AnalysisIncident Management
  • AmazonHardData Scientist
    Root-cause an incident and drive consensus

    This question evaluates root-cause analysis, incident management, cross-functional stakeholder coordination, and quantitative diagnostic reasoning in the context of a sudden drop in voice checkout conversion, testing product analytics, ML-driven user flows, and operational reliability within the Behavioral & Leadership category.

    Behavioral & LeadershipOnsite
  • AmazonMediumSoftware Engineer
    Search a Unix-Like File Tree with Composable Filters

    Search an in-memory Unix-like file tree for physical files matching name and size filters combined by AND or OR. Support optional symlink traversal, broken links, cycles, duplicate reachability, stable identity, and lexicographically sorted canonical paths.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Search for a Value in a Matrix Sorted as One Continuous Sequence

    Decide whether a target value appears in a matrix whose rows are sorted and whose every row starts above the previous row's last value. It tests exploiting that ordering to search in logarithmic time and handling single-row, repeated-value and boundary cases correctly.

    Coding & AlgorithmsOther
  • AmazonMediumSoftware Engineer
    Search target in unknown-length sorted array

    This question evaluates algorithm design and implementation skills for search algorithms on array-like interfaces with unknown length, focusing on bounds discovery, handling out-of-bounds sentinels, duplicate elements, and rigorous time and space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumData Scientist
    Select Top Customers Using Transaction Data Filters

    This question evaluates a candidate's ability to perform data aggregation, filtering, ranking, and deterministic tie-breaking on transactional datasets, assessing skills in Data Manipulation (SQL/Python).

    Data Manipulation (SQL/Python)Technical Screen
  • AmazonMediumSoftware Engineer
    Share examples of impact and simplicity

    This interview question evaluates behavioral evidence, ownership, communication, trade-offs, and measurable outcomes in a realistic interview setting. A strong answer for Share examples of impact and simplicity states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Behavioral & LeadershipTechnical Screen
  • AmazonMediumSoftware Engineer
    Show Initiative, Improve Processes, and Demonstrate Impact

    This question assesses the candidate's ability to identify inefficiencies, demonstrate proactive leadership, and quantify the tangible impact of their improvements on team productivity or system performance.

    Behavioral & LeadershipTechnical ScreenBehavioralLeadershipProcess Improvement
  • AmazonMediumSoftware Engineer
    Show Ownership and Help a Struggling Peer

    This question assesses a candidate's ability to demonstrate the 'Ownership' and 'Insist on Highest Standards' leadership principles by evaluating their initiative in identifying cross-functional gaps and their mentorship style when supporting struggling colleagues.

    Behavioral & LeadershipOnsiteLeadershipSoft SkillsMentorship
  • AmazonMediumSoftware Engineer
    Simplify an Arithmetic Expression Tree with Constant Folding and Identities

    Given the abstract syntax tree of an arithmetic expression as a binary tree, write a traversal that returns an equivalent simplified tree using constant folding and algebraic identities. It tests recursive tree processing, cascading rewrites, correct handling of non-commutative operators and recursion-depth limits.

    Software Engineering FundamentalsOnsite
  • AmazonMediumSoftware Engineer
    Simulate one disc-flipping board game move across all eight directions

    Simulate one move of a two-player disc-flipping board game: place a piece, flip every run of opponent pieces enclosed by the player's own pieces in all eight directions, and return the board unchanged when the move is illegal. It tests careful grid traversal, precise legality rules and avoiding partial updates.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumData Scientist
    Solve Algorithmic Challenges in Online Coding Assessments

    This question evaluates proficiency in fundamental algorithmic problem-solving, specifically array manipulation, string processing, and the use of basic data structures along with performance and complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve LeetCode string and list problems

    This set of problems evaluates proficiency in string manipulation, priority-queue/heap usage and greedy strategies, and linked-list operations including pointer management and cloning, reflecting core data structure and algorithm competencies.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve Nearby Inventory and Word Segmentation Tasks

    Implement two independent tasks: identify stocked centers close enough to a graph destination and return any exact dictionary segmentation of a string. Handle disconnected routes, duplicate edges, missing inventory, repeated suffix work, and large inputs while explaining complexity.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve Rotting Oranges and Bus Walk Reachability

    This question evaluates graph and grid traversal skills, state modeling over time, and constrained reachability combining free transit edges with Manhattan-distance walking.

    Coding & AlgorithmsOnsite
  • AmazonMediumData Scientist
    Solve Search Insert Position Using Binary Search

    This question evaluates proficiency in binary search, algorithmic implementation on sorted arrays, and understanding of time complexity and index management.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve Shipping and Bundle-Cost Problems

    This problem tests your ability to determine the minimum capacity required to complete tasks within a deadline and optimize the cost of purchasing items grouped in bundles.

    Coding & AlgorithmsOnsiteBinary SearchDynamic ProgrammingOptimization
  • AmazonMediumSoftware Engineer
    Solve Three Algorithm Variants

    This multi-part question evaluates combinatorics and permutation generation, tree traversal and node-relationship classification, and array/sequence processing under bounded-gap constraints, measuring algorithmic design, complexity reasoning, and data-structure manipulation within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve Two OA Algorithm Problems

    These two problems evaluate proficiency with greedy algorithms, array manipulation, simulation of stateful processes, and feasibility analysis under capacity constraints.

    Coding & AlgorithmsTechnical Screen
  • AmazonEasyData Engineer
    Solve Two String Problems

    This task evaluates string manipulation and encoding for generating unique Morse representations, along with sentence segmentation and combinatorial enumeration for producing all valid word-break sentences, focusing on transformation, deduplication, and decomposition skills.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve Union-Find, Graph, and Stream Problems

    This question evaluates understanding of disjoint-set (union-find) operations, directed graph processing including cycle detection and ordering, contiguous subarray sum reasoning, and online streaming/anagram detection techniques, emphasizing data structures and algorithmic problem-solving.

    Coding & AlgorithmsOnsite
  • AmazonMediumSoftware Engineer
    Solve a Problem Outside Your Assigned Responsibilities

    Describe initiative beyond assigned work with clear impact, owner coordination, bounded scope, delivery responsibility, and a sustainable handoff.

    Behavioral & LeadershipOnsite
  • AmazonMediumSoftware Engineer
    Solve array and list algorithms

    This question evaluates proficiency in array and list algorithms, including ordering and counting techniques for relative element ranking, merging multiple sorted inputs, and algorithmic design for a package locker retrieval operation, testing data structure manipulation and retrieval logic.

    Coding & AlgorithmsTechnical Screen
  • AmazonEasySoftware Engineer
    Solve array duplicates and two-type subarray

    This problem tests your ability to efficiently detect duplicates using hashing and to apply the sliding window technique to find subarrays that meet specific frequency constraints.

    Coding & AlgorithmsTechnical ScreenArraysHash TableSliding Window
  • AmazonMediumSoftware Engineer
    Solve jumps and anagram-similarity problems

    This two-part question evaluates algorithmic problem-solving skills: Task A focuses on combinatorial optimization and cost-based sequencing under quadratic jump costs, while Task B assesses string multiset reasoning and character-frequency manipulation to determine anagram similarity.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve median extremes and segment flips

    Solve median extremes and segment flips 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.

    Coding & AlgorithmsOnline Assessment
  • AmazonMediumSoftware Engineer
    Solve sliding-window and heap problems

    This question evaluates algorithm design and data structure proficiency, focusing on sliding-window techniques for fixed-length subarray aggregates and heap- or hashmap-based approaches for maintaining medians in a real-time integer stream, along with considerations for concurrent execution.

    Coding & AlgorithmsOnsite
  • AmazonMediumData Scientist
    Solve stock, BFS path, and merge intervals

    This question evaluates algorithmic problem solving across array scanning, BFS-based constrained shortest-path selection, and interval merging, with emphasis on time/space complexity reasoning, correctness proofs, and thorough edge-case handling. It is commonly asked to assess efficiency guarantees (e.g.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Solve string partition and equal-sum package problems

    Solve string partition and equal-sum package problems 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.

    Coding & AlgorithmsOnline Assessment
  • AmazonHardData Scientist
    Solve subset-count and kth-factor problems

    This question evaluates algorithm design and analysis skills, including selection under sum constraints with negatives and zeros, streaming and query-preprocessing strategies for repeated budgets, and number-theoretic factor enumeration for large N, all within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment