Coding & Algorithms interview questions

Showing 151–180 of 3276 results

• Drone Circular Route — Minimum Total Travel CostMedium

  This problem tests your ability to solve a variation of the Traveling Salesman Problem using bitmask dynamic programming to optimize route costs in a small, weighted graph.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Escalation Stack That Resolves the Most-Reported Issue FirstMedium

  Design a support-escalation structure where resolving an issue always clears whichever one currently has the most open reports, breaking ties by the most recently reported occurrence. Tests combining frequency and recency so both operations run in O(1).

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Evaluate IP Access RulesHard

  This question evaluates knowledge of IPv4 addressing, CIDR subnet matching, and access-control rule resolution, assessing competency in bitwise address reasoning, prefix-length precedence, and rule tie-breaking.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fewest Severity Inversions When Interleaving Two Patch QueuesHard

  Merge two severity-labeled patch queues into one install order that keeps each queue's internal order, and return the minimum number of severity inversions over every valid merge. Tests DP over two sequences and efficient counting with letters as priorities.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find Longest Activatable Server StreakHard

  This problem tests your ability to use the sliding window technique to find the longest contiguous subarray that satisfies a specific count-based constraint.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find Two-Word Compound WordsHard

  This problem tests string manipulation, hash set lookups, and the ability to efficiently identify compound words formed by the concatenation of exactly two distinct words from a provided collection.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find a Maximum-Sum Window in a Sparse ArrayHard

  This problem tests the ability to optimize sliding window calculations for extremely large arrays by leveraging compressed data structures (run-length encoding) rather than materializing the full array.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find a Valid Course OrderHard

  This problem tests your ability to detect cycles in a directed graph and perform a topological sort to resolve dependencies.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find a valid dependency orderMedium

  This question evaluates understanding of directed graphs, dependency resolution and cycle detection, and the ability to reason about valid ordering constraints within a graph representation.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find all cells reachable by downhill flowEasy

  This question evaluates graph traversal and reachability reasoning on a 2D elevation grid, testing algorithmic problem-solving, complexity analysis, and handling of monotonic flow constraints.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find concatenated words in listMedium

  This question evaluates proficiency in string manipulation, efficient lookup structures (e.g., hashing/trie) and dynamic programming or recursion for word segmentation, testing algorithmic efficiency and data-structure selection within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find first unique characterMedium

  Find first unique character 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
• Find longest common contiguous subarrayMedium

  This question evaluates a candidate's proficiency in array and substring algorithm design, including concepts such as dynamic programming, hashing, and efficient search techniques.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find longest segment with dominant endsMedium

  This question evaluates algorithmic problem-solving with arrays and complexity-aware design, testing skills in efficient subarray identification, boundary reasoning, and performance analysis within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find longest segment with endpoints > interiorMedium

  This question evaluates algorithmic design and array-processing skills, specifically reasoning about subarray endpoint vs interior relationships, range comparisons, and designing solutions with subquadratic time and space complexity.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find max equal-frequency block count for each prefixMedium

  This problem tests your ability to efficiently manage character frequency tracking while processing string prefixes, using hash maps or frequency arrays to validate partitioning conditions.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find minimum days to deliver all ordersMedium

  This question evaluates algorithm design and combinatorial optimization skills, focusing on scheduling and load-balancing under per-center capacity constraints and frequency-based counting.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum time for irrecoverable passwordMedium

  This question evaluates string-processing skills, combinatorial counting of substrings, simulation of time-based state changes, and algorithmic complexity analysis.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum total range-increment to sortMedium

  This problem tests your ability to determine the minimum total operations required to make an array non-decreasing by incrementing contiguous subarrays, requiring insights into difference arrays or monotonic properties.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find returning users from access logsMedium

  This question evaluates skills in time-series data processing, timestamp parsing and time-zone normalization, scalable stream or batch handling for logs that exceed memory, algorithmic complexity analysis, and test-case design for edge conditions such as midnight boundaries and duplicate events.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find shortest path in a grid with obstaclesMedium

  This question evaluates understanding of pathfinding in grid-based environments, graph traversal concepts, and algorithmic complexity when navigating obstacles and boundary constraints in an unweighted 2D search space.

  AmazonApplied ScientistCoding & AlgorithmsOnsite
• Find shortest subarray to restore orderMedium

  This question evaluates array manipulation and algorithmic problem-solving skills, focusing on understanding how local subarray sorting affects global order, edge-case reasoning (already-sorted arrays, duplicates, strictly decreasing sequences), and complexity analysis within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find shortest transformation steps in a word graphMedium

  This question evaluates a candidate's ability to model string transformations as a graph, apply graph traversal and shortest-path reasoning, and manage efficient string-based search and data-structure choices within the Coding & Algorithms domain.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Find the Closest Version by DateHard

  This problem tests your ability to efficiently search through chronologically ordered records and handle binary search logic with custom comparison rules.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find the Earliest Pair with a Target SumEasy

  Tests array traversal and hash table lookups to find a two-sum pair that minimizes the second index, running in linear time and space.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the K Most Frequent ValuesMedium

  Find any valid set of the k most frequent distinct integers, handling boundary ties with frequency counting, bounded heaps, or frequency buckets.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the K-th Smallest Value in Two Sorted ArraysMedium

  Given two nondecreasing integer arrays and a one-based integer k, return the k-th smallest value in their combined multiset. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Kth Smallest Value in a Binary Search TreeMedium

  Deserialize a level-order serialized binary search tree and find its kth smallest element using an efficient in-order traversal.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find the Largest Rating Threshold Supported by K InstancesHard

  Find the largest k for which at least k instance ratings are at least k, handling threshold equality and the zero-answer case.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Lowest Common Ancestor in a Binary TreeEasy

  This problem tests tree traversal techniques and recursive logic to identify the deepest node that is an ancestor to two specified nodes within a binary tree.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen