Coding & Algorithms interview questions

Showing 181–210 of 3276 results

• Find the Maximum Island AreaMedium

  Find the largest four-neighbor island area in a binary matrix, including the component-size challenges of row-by-row streaming.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find the Minimum Processing Rate to Meet a DeadlineMedium

  This problem tests the ability to determine a minimum threshold using binary search on the answer space, combined with modular arithmetic and ceiling division.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find the Most Common Visit PatternHard

  This problem tests your ability to process chronological event data to identify the most frequent 3-step sequence, requiring efficient data structures to handle large volumes of user logs.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find the Most Frequent Request IDsMedium

  Implement an algorithm to identify the top k most frequent request IDs from a stream of log events, breaking frequency ties by smaller ID values and handling cases where k exceeds the number of unique IDs.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Find the Most Frequently Used Meeting RoomEasy

  Simulate meeting room assignments with delayed starts and duration preservation using priority queues to find the most utilized room.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Single Value in a Sorted Array of PairsEasy

  This problem tests the ability to optimize a linear search into a logarithmic one by leveraging the properties of sorted pairs using binary search.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find top-k lottery winners by spendingMedium

  This problem tests the ability to manage top-k selection from a stream or static collection using heap data structures while enforcing deterministic tie-breaking rules.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find two numbers that sum to targetMedium

  This question evaluates a candidate's competency in basic algorithmic problem-solving within the Coding & Algorithms domain, focusing on array manipulation, pair-sum reasoning, and analysis of time-space trade-offs.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Find when failures started in log streamMedium

  This problem tests the ability to identify the first occurrence of a specific condition in a sorted boolean stream using a modified binary search approach.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Format a Forest of Nested CommentsMedium

  This problem tests your ability to reconstruct hierarchical relationships from flat input data and format them into a visual tree representation with specific character-based connectors.

  AmazonFrontend EngineerCoding & AlgorithmsOnsite
• Frequency Stack with Recency Tie-BreakingMedium

  Design a frequency stack data structure that supports pushing elements and popping the most frequent element, breaking ties by choosing the most recently pushed element, with both operations running in O(1) time.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate Synthetic Clickstream Data with Python FunctionMedium

  This question evaluates a candidate's ability to implement synthetic data generation and probabilistic event simulation in Python using libraries like pandas and numpy, emphasizing timestamp handling, random sampling, and feature engineering for clickstream records.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Generate primes up to n efficientlyMedium

  This question evaluates algorithm design and complexity analysis for prime generation, focusing on sieving techniques and time-space trade-offs when producing primes up to large n.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Group Anagrams Without Sorted Character SignaturesMedium

  Group anagrams without sorting each word's characters, preserving repeated words and reasoning about frequency signatures and overflow-prone encodings.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Highest Average-Salary Team in an Org ChartMedium

  Tests bottom-up tree traversal to compute subtree aggregates (sum and count) and identify an optimal node using multi-level tie-breaking rules.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Highest-total path through a binary tree encoded in level orderMedium

  A coding problem that asks for the largest sum of any non-empty path in a binary tree given in level order, where a path may bend at one node and need not include the root or a leaf. It tests recursive reasoning over trees, correct handling of negative values, and careful decoding of the input format.

  AmazonSoftware EngineerCoding & AlgorithmsOther
• Implement Cache and Count ComponentsMedium

  This question evaluates a candidate's ability to design and implement efficient data structures for constant-time operations and to reason about graph connectivity and component counting, falling under the Coding & Algorithms domain and requiring practical implementation with algorithmic complexity reasoning.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Cache and Rotate MatrixMedium

  This two-part question evaluates competency in data structure design and in-place array manipulation, specifically the ability to implement an LRU cache with O(1)-average operations (including recency management, updates, and evictions) and to rotate an n x n matrix 90 degrees clockwise in place without extra space.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Implement Datacenter Router CommandsHard

  This problem tests your ability to manage stateful data structures, perform geometric calculations (Haversine formula), and implement multi-level sorting logic to simulate router command processing.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Event Filtering and Queue RoutingMedium

  Implement an in-memory event routing engine that matches nested JSON events against subscriber filter policies and routes them in subscription order.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Function to Determine Mode and Prime NumbersMedium

  This question evaluates algorithmic problem-solving skills, including frequency analysis for mode computation, correct handling of ties and uniqueness edge cases, and basic number-theoretic competency for prime identification.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Implement Interview Coding ProblemsEasy

  This question evaluates implementation and algorithmic skills across core data structures and array/interval algorithms, specifically hashing (hash map design including collision handling and resizing), interval merging and intersection logic, and array optimization problems such as maximum container area and trapped rainwater.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement K-means and solve interval/frequency tasksMedium

  This multi-part question evaluates understanding of K-means clustering, interval-merging algorithms, and frequency-based top-k retrieval, assessing competencies in unsupervised learning concepts, algorithmic problem solving, data structures, and complexity analysis.

  AmazonApplied ScientistCoding & AlgorithmsOnsite
• Implement LRU cache with O(1) opsMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement LRU cache with O(1) ops states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Implement Multi-Head Attention from Scratch in NumPyMedium

  This problem tests your understanding of Transformer components by requiring an implementation of Multi-Head Scaled Dot-Product Attention using only NumPy, emphasizing matrix manipulations and numerical stability.

  AmazonApplied ScientistCoding & AlgorithmsOnsite
• Implement Optimal Bucket BatchingHard

  This question evaluates algorithm design and optimization skills, focusing on combinatorial partitioning and batching strategies, efficient utilization of parallel GPUs, and time/space complexity analysis relevant to ML data pipelines.

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Implement PyTorch training loopMedium

  This question evaluates practical implementation skills in PyTorch, focusing on model and device management, batch-wise training mechanics, gradient handling, and optimizer interaction.

  AmazonApplied ScientistCoding & AlgorithmsOnsite
• Implement Regular Expression MatchingEasy

  This problem tests your ability to handle recursive string matching problems using dynamic programming, specifically focusing on handling wildcard and repetition operators.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Reservoir Sampling; Analyze Time and Space ComplexityMedium

  This question evaluates understanding of streaming randomized algorithms and probabilistic reasoning—specifically reservoir sampling—along with analysis of time and space complexity and use of hash-based structures for duplicate detection; it is in the Coding & Algorithms domain and tests both conceptual probability invariants and practical implementation skills. Such problems are commonly asked to gauge a candidate's ability to design one-pass, linear-time solutions for unbounded data streams and to reason about algorithmic correctness and resource bounds in technical interviews.

  AmazonData ScientistCoding & AlgorithmsOnsite
• Implement Top-p (Nucleus) Sampling in NumPyMedium

  This problem tests your ability to implement the nucleus sampling algorithm from scratch using NumPy, focusing on probability distribution processing and efficient array masking.

  AmazonApplied ScientistCoding & AlgorithmsOnsite