Katkat

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 121–150 of 1706 results

  • AmazonMediumSoftware Engineer
    Merge K Sorted Arrays Without Duplicates

    This problem tests your ability to efficiently merge multiple sorted sequences into a single sorted stream while managing duplicate values using a priority queue.

    Coding & AlgorithmsTechnical ScreenHeapsSortingArrays
  • AmazonMediumSoftware Engineer
    Merge Multiple Sorted Arrays

    This problem tests your ability to efficiently merge multiple sorted arrays into a single sorted list using a priority queue (min-heap) to optimize performance.

    Coding & AlgorithmsTechnical ScreenArraysHeapSorting
  • AmazonMediumApplied Scientist
    Merge Overlapping Time Ranges

    This problem tests your ability to manipulate arrays of intervals by sorting and merging, evaluating your proficiency with pointer manipulation and interval arithmetic.

    Coding & AlgorithmsTechnical ScreenArraysSortingIntervals
  • AmazonHardSoftware Engineer
    Merge two sorted arrays in-place

    This problem tests your ability to manipulate arrays in-place while managing constraints to avoid unnecessary data movement or auxiliary space usage.

    Coding & AlgorithmsTechnical ScreenArraysTwo PointersIn-place
  • AmazonMediumSoftware Engineer
    Minimize Points Used Across Multiple Reward Programs

    Minimize the number of indivisible reward points needed to meet or exceed a microdollar target across programs with different values and finite balances, returning failure when coverage is impossible.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Minimum Bills and Coins to Make Change

    This problem tests your ability to determine the optimal combination of coins and bills to achieve a specific target amount, while managing limited inventory and precision issues.

    Coding & AlgorithmsTechnical ScreenGreedyDynamic ProgrammingArithmetic
  • AmazonMediumSoftware Engineer
    Minimum Drone Delivery Time on a Ring of Hubs

    This problem tests your ability to calculate optimal traversal distances on a circular path, requiring the application of modular arithmetic and greedy logic to minimize movement between sequential points.

    Coding & AlgorithmsTechnical ScreenAlgorithmsGreedyModular Arithmetic
  • AmazonMediumSoftware Engineer
    Optimize with a cache/hash map

    Amazon software-engineer technical-screen coding follow-up: take an existing script (e.g. one that resolves file paths or parses license strings) and design a hash-map-backed in-memory cache to speed up repeated lookups. It tests choosing a cacheable computation, defining normalized keys and values, estimating hit rate, picking an eviction policy (LRU/LFU/TTL), invalidating on file mtime/content-hash changes, ensuring concurrency safety, and analyzing time and space complexity before and after caching.

    Coding & AlgorithmsTechnical Screen
  • AmazonEasySoftware Engineer
    Print all odd numbers from an integer list

    This question tests the ability to filter a collection based on a parity condition and handle potential overflow or negative integer scenarios.

    Coding & AlgorithmsTechnical ScreenArraysBasic LogicFiltering
  • AmazonMediumSoftware Engineer
    Rearrange Digits Without Adjacent Sums Above Nine

    Rearrange a multiset of digits into the lexicographically smallest string such that every adjacent pair sums to at most nine, or return an empty string if impossible.

    Coding & AlgorithmsTechnical Screengreedybacktrackingstring
  • AmazonMediumSoftware Engineer
    Rearrange a String So Adjacent Characters Differ

    Construct the lexicographically smallest rearrangement of a lowercase string with no equal adjacent characters, checking feasibility after each deterministic choice and returning empty when separation is impossible.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Resolve Package Dependencies with Cycle Detection

    This problem tests your ability to perform a topological sort on a directed graph while identifying cyclic dependencies to ensure a safe build order.

    Coding & AlgorithmsTechnical ScreenGraphDFSTopological Sort
  • AmazonHardSoftware Engineer
    Retrieve the Latest Timestamped Value for Each Key

    Design a timestamped key-value store supporting out-of-order updates and point-in-time or latest queries in sub-linear time per operation.

    Coding & AlgorithmsTechnical ScreenDesignBinary SearchHash Map
  • AmazonHardSoftware Engineer
    Return all valid word-break sentences

    This question evaluates skills in string processing, recursive search/backtracking, enumeration of all valid segmentations, and algorithmic complexity reasoning for generating multiple solutions.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Return the Top K Most Frequent Elements

    This problem tests the ability to efficiently count element frequencies and use bucket-based sorting to avoid O(N log N) time complexity.

    Coding & AlgorithmsTechnical ScreenHash MapBucket SortFrequency
  • 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 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
    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
  • 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 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 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
  • 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 tree and DP problems

    This pair of problems evaluates proficiency with tree data structures and traversal concepts (deepest shared ancestor) and with dynamic programming/state optimization on linear arrays (maximizing non-adjacent house values), assessing algorithmic reasoning, complexity awareness, and data-structure manipulation.

    Coding & AlgorithmsTechnical Screen
  • AmazonEasyData Scientist
    Solve two string DP/hash problems

    This question set evaluates string-processing and algorithmic problem-solving skills, including encoding and transformation for unique representations and dynamic programming, memoization, and backtracking for enumerating all valid segmentations.

    Coding & AlgorithmsTechnical Screen
  • AmazonMediumSoftware Engineer
    Track Missing Package IDs from Out-of-Order Receipts

    This problem tests the ability to track a range of sequential integers and identify gaps in a stream of incoming data using efficient data structures.

    Coding & AlgorithmsTechnical ScreenArraysHash TablesData Structures
  • AmazonMediumSoftware Engineer
    Track the Contiguous Package Frontier and Missing IDs

    This problem tests your ability to manage sparse, out-of-order data using data structures like sets or priority queues and finding gaps within a contiguous range.

    Coding & AlgorithmsTechnical ScreenData StructuresHashingArrays
  • AmazonEasySoftware Engineer
    Unify Stock-Trading Profit Variants

    This problem tests state-space dynamic programming by unifying different stock trading constraints (transaction limits and per-transaction fees) into a single optimized state-transition model.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingState MachineOptimization