Coding & Algorithms interview questions

Showing 271–300 of 3276 results

• Rearrange Digits Without Adjacent Sums Above NineMedium

  Rearrange a multiset of digits into the lexicographically smallest string such that every adjacent pair sums to at most nine, or return an empty string if impossible.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Rearrange a String So Adjacent Characters DifferMedium

  Construct the lexicographically smallest rearrangement of a lowercase string with no equal adjacent characters, checking feasibility after each deterministic choice and returning empty when separation is impossible.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Replace Delimited Tokens in a StringMedium

  This problem tests string manipulation, hash map lookups, and edge-case handling when parsing nested or malformed delimiters within a template string.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Resolve Package Dependencies with Cycle DetectionMedium

  This problem tests your ability to perform a topological sort on a directed graph while identifying cyclic dependencies to ensure a safe build order.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Retrieve the Latest Timestamped Value for Each KeyHard

  Design a timestamped key-value store supporting out-of-order updates and point-in-time or latest queries in sub-linear time per operation.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return all valid word-break sentencesHard

  This question evaluates skills in string processing, recursive search/backtracking, enumeration of all valid segmentations, and algorithmic complexity reasoning for generating multiple solutions.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return the Maximum of Every Sliding WindowHard

  This problem tests your ability to maintain a sliding window maximum using an efficient data structure like a deque to achieve linear time complexity.

  AmazonSoftware EngineerCoding & AlgorithmsHR Screen
• Return the Top K Most Frequent ElementsMedium

  This problem tests the ability to efficiently count element frequencies and use bucket-based sorting to avoid O(N log N) time complexity.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Search a Unix-Like File Tree with Composable FiltersMedium

  Search an in-memory Unix-like file tree for physical files matching name and size filters combined by AND or OR. Support optional symlink traversal, broken links, cycles, duplicate reachability, stable identity, and lexicographically sorted canonical paths.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Search for a Value in a Matrix Sorted as One Continuous SequenceMedium

  Decide whether a target value appears in a matrix whose rows are sorted and whose every row starts above the previous row's last value. It tests exploiting that ordering to search in logarithmic time and handling single-row, repeated-value and boundary cases correctly.

  AmazonSoftware EngineerCoding & AlgorithmsOther
• Search target in unknown-length sorted arrayMedium

  This question evaluates algorithm design and implementation skills for search algorithms on array-like interfaces with unknown length, focusing on bounds discovery, handling out-of-bounds sentinels, duplicate elements, and rigorous time and space complexity analysis.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Simulate one disc-flipping board game move across all eight directionsMedium

  Simulate one move of a two-player disc-flipping board game: place a piece, flip every run of opponent pieces enclosed by the player's own pieces in all eight directions, and return the board unchanged when the move is illegal. It tests careful grid traversal, precise legality rules and avoiding partial updates.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Algorithmic Challenges in Online Coding AssessmentsMedium

  This question evaluates proficiency in fundamental algorithmic problem-solving, specifically array manipulation, string processing, and the use of basic data structures along with performance and complexity reasoning.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Solve LeetCode string and list problemsMedium

  This set of problems evaluates proficiency in string manipulation, priority-queue/heap usage and greedy strategies, and linked-list operations including pointer management and cloning, reflecting core data structure and algorithm competencies.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve Nearby Inventory and Word Segmentation TasksMedium

  Implement two independent tasks: identify stocked centers close enough to a graph destination and return any exact dictionary segmentation of a string. Handle disconnected routes, duplicate edges, missing inventory, repeated suffix work, and large inputs while explaining complexity.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve Rotting Oranges and Bus Walk ReachabilityMedium

  This question evaluates graph and grid traversal skills, state modeling over time, and constrained reachability combining free transit edges with Manhattan-distance walking.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve Search Insert Position Using Binary SearchMedium

  This question evaluates proficiency in binary search, algorithmic implementation on sorted arrays, and understanding of time complexity and index management.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Solve Shipping and Bundle-Cost ProblemsMedium

  This problem tests your ability to determine the minimum capacity required to complete tasks within a deadline and optimize the cost of purchasing items grouped in bundles.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve Three Algorithm VariantsMedium

  This multi-part question evaluates combinatorics and permutation generation, tree traversal and node-relationship classification, and array/sequence processing under bounded-gap constraints, measuring algorithmic design, complexity reasoning, and data-structure manipulation within the Coding & Algorithms domain.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Two OA Algorithm ProblemsMedium

  These two problems evaluate proficiency with greedy algorithms, array manipulation, simulation of stateful processes, and feasibility analysis under capacity constraints.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Two String ProblemsEasy

  This task evaluates string manipulation and encoding for generating unique Morse representations, along with sentence segmentation and combinatorial enumeration for producing all valid word-break sentences, focusing on transformation, deduplication, and decomposition skills.

  AmazonData EngineerCoding & AlgorithmsTechnical Screen
• Solve Union-Find, Graph, and Stream ProblemsMedium

  This question evaluates understanding of disjoint-set (union-find) operations, directed graph processing including cycle detection and ordering, contiguous subarray sum reasoning, and online streaming/anagram detection techniques, emphasizing data structures and algorithmic problem-solving.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve array and list algorithmsMedium

  This question evaluates proficiency in array and list algorithms, including ordering and counting techniques for relative element ranking, merging multiple sorted inputs, and algorithmic design for a package locker retrieval operation, testing data structure manipulation and retrieval logic.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve array duplicates and two-type subarrayEasy

  This problem tests your ability to efficiently detect duplicates using hashing and to apply the sliding window technique to find subarrays that meet specific frequency constraints.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve jumps and anagram-similarity problemsMedium

  This two-part question evaluates algorithmic problem-solving skills: Task A focuses on combinatorial optimization and cost-based sequencing under quadratic jump costs, while Task B assesses string multiset reasoning and character-frequency manipulation to determine anagram similarity.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve median extremes and segment flipsMedium

  Solve median extremes and segment flips 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 & AlgorithmsOnline Assessment
• Solve sliding-window and heap problemsMedium

  This question evaluates algorithm design and data structure proficiency, focusing on sliding-window techniques for fixed-length subarray aggregates and heap- or hashmap-based approaches for maintaining medians in a real-time integer stream, along with considerations for concurrent execution.

  AmazonSoftware EngineerCoding & AlgorithmsOnsite
• Solve stock, BFS path, and merge intervalsMedium

  This question evaluates algorithmic problem solving across array scanning, BFS-based constrained shortest-path selection, and interval merging, with emphasis on time/space complexity reasoning, correctness proofs, and thorough edge-case handling. It is commonly asked to assess efficiency guarantees (e.g.

  AmazonData ScientistCoding & AlgorithmsTechnical Screen
• Solve string partition and equal-sum package problemsMedium

  Solve string partition and equal-sum package problems 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 & AlgorithmsOnline Assessment
• Solve subset-count and kth-factor problemsHard

  This question evaluates algorithm design and analysis skills, including selection under sum constraints with negatives and zeros, streaming and query-preprocessing strategies for repeated budgets, and number-theoretic factor enumeration for large N, all within the Coding & Algorithms domain.

  AmazonData ScientistCoding & AlgorithmsOnline Assessment