Coding & Algorithms interview questions

Showing 91–120 of 3276 results

• Answer two coding questions (SQL and DP)Medium

  This problem tests SQL data aggregation skills with NULL handling and algorithmic proficiency in dynamic programming to count palindromic subsequences in a string.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a BFS Web CrawlerMedium

  This question evaluates understanding of breadth-first traversal, URL normalization, domain scoping, duplicate detection, and retry/error handling, measuring algorithmic design and robustness in networked code.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Searchable Sentence IndexHard

  This problem tests your ability to design an in-memory inverted index for text retrieval, requiring efficient tokenization, case-insensitive mapping, and dynamic updates to a collection of sentences.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Build an LRU Cache with a Hash Map and Linked ListHard

  This problem tests your ability to design a cache with O(1) time complexity for both get and put operations by combining a hash map with a doubly linked list.

  AmazonSoftware EngineerCoding & AlgorithmsHR Screen
• Build the Largest Available SequenceMedium

  This problem tests your ability to use a greedy approach combined with a frequency map to construct the lexicographically largest sequence under specific constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Caesar Cipher with Translation-Table OptimizationMedium

  This question tests string manipulation, modular arithmetic, and the ability to optimize performance by trading space for time using a precomputed lookup table.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate 7-Day Rolling Average for Energy ConsumptionMedium

  This question evaluates programming fluency in numerical data processing and algorithmic implementation for computing moving averages and handling edge cases in time-series sequences, and it applies to Data Scientist roles while falling under the Coding & Algorithms category.

  AmazonData ScientistCoding & AlgorithmsOnsite
• Calculate Circular Route Query DistanceMedium

  This question evaluates a candidate's ability to reason about circular arrays, distance computations, and query-efficient algorithms, assessing concepts such as modular indexing and cumulative distances.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check a Palindrome While Ignoring Case and PunctuationEasy

  Tests string manipulation and two-pointer traversal techniques to verify if a string is a palindrome while ignoring non-alphanumeric characters and case.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check if adding edge creates cycle in digraphMedium

  This question evaluates understanding of graph algorithms, reachability, and algorithmic complexity by determining whether adding a directed edge would introduce a cycle in an otherwise acyclic directed graph.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Check path in N-ary treeMedium

  This question evaluates understanding of tree traversal and sequence matching in N-ary trees, including handling non-unique node values and maintaining traversal state across branches.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Circular Drone Hub Delivery RouteHard

  This question evaluates a candidate's ability to work with circular array structures and prefix sums to compute shortest distances on a ring topology. It tests practical coding skill in efficiently handling wraparound arithmetic and cumulative sums, a common pattern in algorithm interviews assessing array manipulation and optimization under scale constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute Edit DistanceMedium

  Tests dynamic programming and string manipulation by calculating the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Latencies and Search Grid PathMedium

  This question evaluates parsing and processing of timestamped event logs to compute message latencies and implementation of constrained grid path search, testing competencies in file I/O, record alignment/matching, time-delta computation, graph traversal, and stateful backtracking.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute array modes with ties and no-mode ruleMedium

  This question evaluates algorithm design and data-structure skills—frequency counting, hashing, and handling edge cases such as ties and a no-mode rule—within the coding and algorithms domain for data scientist roles.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Compute delay times in priority arrayMedium

  This question evaluates algorithmic efficiency in array processing, specifically reasoning about nearest-smaller relationships and the use of auxiliary structures to achieve subquadratic performance.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute fruit spoilage time in a gridMedium

  This question evaluates a candidate's understanding of graph traversal concepts, grid-based state propagation, and reachability analysis in time-evolving systems.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Compute maximum distinct-product pickup daysMedium

  This question evaluates a candidate's understanding of greedy and resource-allocation strategies along with combinatorial reasoning to maximize operations under discrete constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute minimal operations and optimal server pairingEasy

  This two-part question evaluates array manipulation and optimization skills—specifically range-update minimization to enforce a nondecreasing sequence and greedy pairing/matching to maximize summed primary resources—testing algorithm design, complexity reasoning, and constraint handling.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute optimal locker placement with obstaclesMedium

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

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Compute peak parking lot occupancy intervalsMedium

  This question evaluates a candidate's competency in temporal interval reasoning, event-stream processing, and handling incomplete or unsorted logs to determine peak concurrent occupancy.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute product excluding index without divisionMedium

  This question evaluates array-manipulation and algorithmic problem-solving skills, focusing on computing a product-for-each-index using prefix and postfix accumulation concepts while reasoning about edge cases such as zeros, negative numbers, and integer overflow.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Compute reachability and minimal-time same-type schedulingMedium

  This prompt evaluates integer reachability and invariant reasoning via repeated additive transformations (testing number-theoretic reachability and state-space analysis) alongside resource-aware scheduling and grouping logic for minimizing completion time under type and memory constraints, and it falls under the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute shortest path with obstaclesMedium

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

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute the Median After Each Stream InsertionMedium

  This problem tests your ability to maintain dynamic statistics in a data stream using efficient data structures to achieve logarithmic insertion and constant-time retrieval.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Compute the Minimum Number of Meeting RoomsEasy

  This problem tests your ability to manage overlapping time intervals efficiently, requiring an understanding of sorting or priority queues to track resource utilization.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute total revenue from greedy VM rentalsMedium

  This problem tests your ability to use greedy strategies combined with efficient data structures to manage resource allocation and optimize revenue based on priority-based demand.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute tree diameterMedium

  This question evaluates understanding of binary tree algorithms, recursion versus iterative traversal strategies, and competence in algorithmic analysis including time and space complexity and handling deep-recursion stack overflow when computing a tree's diameter.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Connected Components in an Undirected GraphMedium

  This question tests the ability to traverse an undirected graph using graph search algorithms to identify and count disjoint subgraphs.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Customers Who Visited on Multiple DatesMedium

  Tests data manipulation, hash set/map aggregation, and date deduplication to identify users with repeat visits across distinct calendar days.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen