Coding & Algorithms interview questions

Showing 241–270 of 3276 results

• Maximize protected population and bitwise ANDHard

  This problem tests your ability to optimize resource allocation using greedy approaches with priority queues and bitwise bit-manipulation techniques to satisfy mathematical constraints.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize protected population with one-step guard shiftsMedium

  This question evaluates the ability to reason about constrained local moves and optimize a numerical objective over an array, testing skills in array manipulation, combinatorial optimization, and interpretation of binary state representations.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize the number of binary strings chosen under zero and one budgetsMedium

  Given a list of binary strings and separate limits on the total number of zeros and ones, find the largest number of strings that can be chosen together without exceeding either limit. Tests optimization under two simultaneous resource limits, moving from brute force to an efficient method, and complexity analysis.

  AmazonFrontend EngineerCoding & AlgorithmsTechnical Screen
• Maximize total bandwidth of data channel pairsHard

  This question evaluates a candidate's ability to design efficient algorithms for combinatorial optimization and selection under constraints, testing understanding of array manipulation, ordered pair counting, and aggregation of bandwidth sums.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize weighted subsequence pairs with wildcardsMedium

  This question evaluates combinatorial counting, string manipulation, and optimization under constraints, along with handling large-number results via modular arithmetic.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximum Profit Assigning Tasks to Exact-Skill Workers Plus One Wildcard WorkerMedium

  Assign tasks to workers whose skill must exactly equal each task's requirement, with one extra worker who may take any single task, and return the maximum total profit. It tests making the best use of limited workers per skill level, the single wildcard worker, and large sums that exceed 32 bits.

  AmazonSoftware EngineerCoding & AlgorithmsOther
• Median of a Data StreamMedium

  Design a data structure that continuously receives a stream of integers and efficiently supports retrieving the current running median, handling potential integer overflow during the median calculation.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Merge K Sorted Arrays Without DuplicatesMedium

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

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Multiple Sorted ArraysMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Time RangesMedium

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

  AmazonApplied ScientistCoding & AlgorithmsTechnical Screen
• Merge Two Job Queues With the Fewest Urgency InversionsHard

  Interleave two digit sequences, keeping each one's order, so that the merged sequence has as few inversions as possible. Tests charging each inversion to its earlier element, which turns the problem into an O(mn) grid DP.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Merge overlapping and adjacent rangesMedium

  This question evaluates a candidate's understanding of interval merging and range manipulation, including handling overlapping and adjacent ranges, edge cases like single-point gaps and extreme values, and the ability to analyze time and space complexity.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Merge two sorted arrays in-placeHard

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

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Message Rate LimiterMedium

  Design an in-memory message rate limiter that allows or denies messages based on whether a given time window has elapsed since their last accepted occurrence.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Minimize Branch Merge ConflictsHard

  This question evaluates understanding of combinatorial optimization, set operations, and order-dependent state management, requiring reasoning about how commit file modifications accumulate across branch merges.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize Circular Redistribution CostMedium

  This problem tests your ability to handle circular array indexing and perform efficient redistributions using modulo arithmetic and prefix sum concepts.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize Global Replacements to Make Values ContiguousMedium

  Determine the minimum number of global value replacements needed so that every remaining value in an array forms a single contiguous block.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize Grid Inconvenience by Adding One Delivery CenterMedium

  Add at most one delivery center to minimize the maximum Chebyshev distance from ordinary grid cells to their nearest center.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize Points Used Across Multiple Reward ProgramsMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize Replacements So Equal Product Values Are ContiguousHard

  This problem tests your ability to optimize data transformations by identifying contiguous blocks of identical values, modeled as a shortest-path or dynamic programming problem on a compressed representation of the array.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Minimize operations to reduce price differenceHard

  This question evaluates algorithm design and array-manipulation skills, focusing on reasoning about constrained transfers of value, invariants, and the minimization of operation counts under a fixed per-operation bound.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize time for two handlersHard

  This problem tests your ability to use dynamic programming or greedy strategies with state tracking to minimize the total completion time of tasks assigned to two distinct handlers.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimum Bills and Coins to Make ChangeMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Drone Delivery Time on a Ring of HubsMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Moves for a Squirrel to Carry Every Nut to a Tree One at a TimeMedium

  A squirrel on an obstacle-free grid must carry every nut to a tree, holding at most one nut at a time and moving one cell per step. The task asks for the minimum total number of moves over all delivery orders, testing reasoning about grid distances and how the order of deliveries affects the total.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Minimum Path Length Through a Grid With One Allowed Cell ConversionMedium

  This problem tests your ability to adapt BFS to a state-space graph where an additional dimension represents the remaining capacity to modify the grid, requiring efficient state tracking to find the shortest path.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimum Priority Conflicts When Interleaving Two Lowercase StringsHard

  From an Amazon online assessment: merge two lowercase strings into one while keeping each string's internal order, where smaller letters have higher priority and every lower-priority letter placed before a higher-priority one counts as a conflict. Return the minimum possible number of conflicts over all valid merges.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Optimize with a cache/hash mapMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Order Dependent Tasks and Identify Work to RerunMedium

  Return any valid dependency order, detect cycles, and identify transitive reruns with a complete topological and reachability solution and order-independent validation.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Print all odd numbers from an integer listEasy

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

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen