Coding & Algorithms interview questions

Showing 121–150 of 3276 results

• Count Four-Neighbor Islands in a Binary MatrixMedium

  Count four-neighbor islands in a binary matrix and consider the connectivity state needed when rows arrive as a stream.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count expressions reaching a target sumMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Count expressions reaching a target sum states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Count partitions and equal-cost packagesMedium

  This question evaluates string-processing and combinatorial counting skills, including tracking distinct-character occurrences across contiguous partitions and using frequency-based pairing logic on arrays to form equal-cost packages.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count regions with DFSMedium

  This question evaluates proficiency in graph traversal and grid-based connected-component detection using depth-first search on a binary m x n grid, along with algorithmic complexity analysis and techniques to avoid revisiting cells.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count the Distinct Binary Search Tree Shapes for Keys 1 to nMedium

  Count how many structurally different binary search trees can store the keys 1 through n exactly once, for n up to 19. It tests reasoning about how tree shapes decompose and counting combinatorial structures efficiently instead of building every tree.

  AmazonSoftware EngineerCoding & AlgorithmsOther
• Count unique Morse-code word transformationsHard

  This question evaluates a candidate's ability to implement string transformations based on a fixed character-to-code mapping and to identify distinct results, testing competencies in encoding, string manipulation, and deduplication.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Course Prerequisite FeasibilityMedium

  This question tests the ability to detect cycles in a directed graph to determine if a set of academic courses with prerequisite constraints can be completed.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Create a Binary Tree from Parent-Child DescriptionsMedium

  Construct one valid binary tree from unordered parent-child descriptions that identify left and right links. Reuse node identities across records, support children appearing before parents, and return the unique root.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design 2D DP on a DAGMedium

  Design 2D DP on a DAG 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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design LCA with flexible inputs and ruleMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Design LCA with flexible inputs and rule states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design LFU cache with distributed extensionMedium

  This question evaluates understanding of cache design and frequency-based eviction policies, efficient data structures that support O(1) operations, and techniques for approximate frequency estimation and summarization in distributed streaming environments.

  AmazonApplied ScientistCoding & AlgorithmsOnsite
• Design a Scalable, Fault-Tolerant Distributed Order SystemMedium

  This question evaluates system-design and algorithmic competencies, combining distributed-systems concepts — high availability, low-latency architecture, scalability levers, and fault-tolerance mechanisms — with practical binary-tree traversal and time–space complexity analysis.

  AmazonData ScientistCoding & AlgorithmsOnsite
• Design a fixed-capacity circular queueMedium

  This question evaluates understanding of fixed-capacity circular queue data structures, array-based indexing, modular arithmetic, and the requirement for constant-time (O(1)) enqueue/dequeue operations.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Design a hierarchical locking treeMedium

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

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design a no-repeat top-frequency music playerMedium

  Design a no-repeat frequency-based music player with addUserSongs and getNextSong APIs. Covers max-heap data structures, lazy deletion, cycle resets, mid-cycle song additions, and complexity.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Design a weighted random value generatorMedium

  This problem tests your ability to implement efficient weighted random selection using prefix sums and binary search, and handling state updates.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design faster delay-time computationMedium

  This question evaluates a candidate's ability to design efficient array algorithms and appropriate data structures for nearest-smaller-element queries, assessing performance, correctness with duplicates, and scalability to large inputs.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Design rolling-window top-K click trackerMedium

  Design rolling-window top-K click tracker 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.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Detect and Break a Cycle in a Singly Linked ListMedium

  Tests detection and resolution of cycles in singly linked lists using two-pointer techniques with constant auxiliary space.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect cycle in a directed graphMedium

  This question evaluates mastery of graph algorithms and graph theory concepts—specifically directed cycle detection—and assesses the ability to reason about algorithmic correctness and to analyze time and space complexity for competing approaches.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Detect cycles in lists and graphsMedium

  This question evaluates understanding of cycle detection in linked lists and directed graphs, assessing competencies in pointer manipulation, graph traversal strategies, and reasoning about algorithmic time and space complexity within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Detect words formed by multiple dictionary partsMedium

  This question evaluates proficiency in string processing, selection and use of appropriate data structures and algorithms (hashing, tries), dynamic programming and memoization, and complexity analysis for large inputs and edge-case handling within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Length of Longest Unique SubstringMedium

  This question evaluates string-processing skills and algorithmic problem-solving, including handling character uniqueness and performance considerations. Commonly asked in Coding & Algorithms interviews to assess a candidate's ability to implement efficient solutions and reason about time/space trade-offs, it targets practical application rather than purely conceptual understanding.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Determine Rounds for Star Substring ThresholdMedium

  This question evaluates string-processing and algorithmic problem-solving skills, including handling incremental updates, counting substrings impacted by character replacements, and performance-aware simulation.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Determine Whether All Courses Can Be CompletedMedium

  This problem tests your ability to model dependencies using a directed graph and detect cycles to determine if a set of tasks can be completed.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether One Person Can Attend Every MeetingEasy

  This problem tests your ability to handle interval sorting and linear-time overlap detection to ensure no two meetings conflict.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether Package Weights Can Be Safely ArrangedMedium

  Tests array manipulation, counting techniques, and greedy or constraint-satisfaction logic to determine if an array can be permuted so no two adjacent elements sum to ten or more.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Whether a Binary Tree Is a Valid BSTMedium

  Determine whether an entire breadth-first encoded binary tree obeys the strict BST invariant. Use ancestor bounds rather than only parent-child checks, reject duplicates, handle numeric extremes, and discuss an iterative approach for deep trees.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine if all courses can be completedMedium

  This problem tests your ability to model prerequisites as a directed graph and detect cycles to determine if a valid topological ordering exists.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Determine string segmentability with dictionaryMedium

  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 string segmentability with dictionary states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite