Coding & Algorithms interview questions

Showing 3241–3270 of 3276 results

• Find the Longest Palindromic SubstringMedium

  Implement an algorithm to find the longest palindromic substring in a given string, breaking ties by selecting the earliest occurrence and properly handling empty inputs.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Find top co-viewed productsHard

  This question evaluates algorithmic problem-solving and implementation skills in the Coding & Algorithms domain, including frequency aggregation, ordering with tie-breakers, and efficient data-structure use for session-based recommendation counting.

  eBaySoftware EngineerCoding & AlgorithmsOnsite
• Implement an In-Memory File SystemMedium

  This problem tests proficiency with hierarchical data structures (trees/tries) and object-oriented design by requiring the implementation of an in-memory file system with file/directory management and path resolution.

  eBaySoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement list and grid transformation tasksMedium

  This problem tests your ability to simulate state-dependent transitions on a 2D grid and your skill in repartitioning data based on specific grouping constraints.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Length of the Longest Contiguous Subarray Summing to a TargetEasy

  Given an integer array that may contain negative numbers and a target k, return the length of the longest contiguous subarray whose sum equals k, or 0 when none exists. Tests reasoning about subarray sums with mixed signs and handling large inputs efficiently.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Pass functions and analyze basic data structuresMedium

  This question evaluates proficiency with higher-order functions, passing functions or delegates, closures, and reasoning about side effects, alongside the ability to analyze fundamental data structures and their performance characteristics.

  eBaySoftware EngineerCoding & AlgorithmsOnsite
• Rebuild a Binary Tree from Two Traversals and Serialize It Level by LevelMedium

  Given the preorder and inorder traversals of a binary tree with distinct values, rebuild the tree and return its level-order serialization, with empty slots marked as None and trailing ones removed. It tests understanding of traversal orders, careful index bookkeeping and an efficient solution for trees with thousands of nodes, including fully skewed ones.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Return the K Smallest Values from Sorted ArraysMedium

  Tests ability to efficiently merge multiple sorted streams to extract the k smallest elements using a min-heap or frontier-based approach. Evaluates handling of empty arrays, duplicates, and computational complexity dependent on the number of arrays rather than total elements.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Search a Rotated Sorted Array in One Binary-Search PassMedium

  Implement a single-pass binary search to locate a target value in a rotated strictly increasing array in logarithmic time and constant auxiliary space.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Dependency, Prefix, and Cache ProblemsMedium

  This set of problems evaluates graph algorithms for dependency and cycle detection, efficient data structure design for prefix-based word storage, and cache eviction policy implementation, assessing skills in algorithmic analysis, data structures, and time/space complexity within the Coding & Algorithms domain.

  eBaySoftware EngineerCoding & AlgorithmsOnsite
• Wildcard Dictionary MatchingMedium

  This problem tests your ability to implement a pattern-matching algorithm that supports variable-length wildcards using recursion with memoization or dynamic programming.

  eBaySoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute dasher pay from order eventsMedium

  This question evaluates a candidate's ability to process time-based event streams, manage overlapping active intervals, and compute aggregate payouts under concurrency constraints.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute total active time per Twitter SpaceMedium

  This problem tests your ability to process chronological event streams to calculate overlapping or continuous active intervals and aggregate durations per category.

  xAISoftware EngineerCoding & AlgorithmsOnsite
• Constant-Time Insert, Remove, and Uniform Random SamplingHard

  This question evaluates the ability to design a data structure that supports constant-time insertions, removals, and uniform random sampling, testing concepts such as hashing, indexed storage, and randomized selection within the coding and algorithms domain.

  xAIMachine Learning EngineerCoding & AlgorithmsOnsite
• Contrast processes and threadsMedium

  This question evaluates understanding of operating system and concurrency fundamentals—specifically differences between processes and threads including memory isolation, resource ownership, scheduling, context-switch costs, inter-process communication versus in-process synchronization, failure isolation, and security.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Design O(1) random-sampling setMedium

  This question evaluates a candidate's competency in data-structure design, randomized algorithms, and algorithmic complexity analysis within the Coding & Algorithms domain, with a focus on achieving expected O(1) operations for insert, remove, and uniform sampling.

  xAIMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Design a Least Frequently Used (LFU) Cache with O(1) OperationsMedium

  This question evaluates understanding of data structures and algorithm design for implementing a Least Frequently Used (LFU) cache with O(1) get and put operations, emphasizing frequency tracking and least-recently-used tie-breaking.

  xAISoftware EngineerCoding & AlgorithmsOnsite
• Design a Recoverable IteratorMedium

  Design a forward-only iterator wrapper that supports saving and restoring cursor state via checkpoints, testing buffering strategies and memory management.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain and Implement StringsMedium

  This question evaluates understanding of string data structures, memory layout, ownership and move semantics in Rust, and algorithmic complexity related to copying and performance.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain arrays and memory layoutMedium

  This question evaluates understanding of arrays, their contiguous memory representation including element size, alignment and indexing arithmetic, along with time-complexity analysis for access, insertion and deletion and implications for cache locality.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Explain strings, moves, and concurrencyMedium

  This question evaluates understanding of string data structures, ownership and move semantics (including Rust-specific move behavior), and concurrency models such as threads versus asynchronous coroutines, testing competencies in memory management, performance analysis, and concurrent programming.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Find kth element and sliding-window kth in streamHard

  This problem tests your ability to maintain order statistics in a streaming context, moving from a static selection problem to an efficient sliding-window implementation.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Flatten and unflatten nested Python structuresMedium

  This problem tests recursion, type introspection, and data structure manipulation by requiring the implementation of flattening and reconstruction logic for arbitrarily nested lists and dictionaries.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Greedy Longest-Match Tokenizer for an LLM Data PipelineHard

  This question evaluates understanding of string-processing and greedy maximal-munch tokenization, as well as competency in designing efficient prefix-matching data structures and handling large-scale text preprocessing for LLM pipelines.

  xAIMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement Distributed Matrix MultiplicationHard

  This problem tests your ability to design a distributed matrix multiplication algorithm by partitioning large matrices across multiple worker nodes to minimize communication overhead.

  xAIMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a Radix Cache for Integer SequencesMedium

  This question evaluates understanding of radix trees (prefix-compressed tries), sequence-oriented trie manipulation, and the maintenance of invariants like distinct branching and maximal compression, and belongs to the Coding & Algorithms domain.

  xAISoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a parallelized sortMedium

  This problem tests your ability to implement a parallelized version of Merge Sort using threads or a thread pool, focusing on partitioning, synchronization, and managing recursion depth.

  xAISoftware EngineerCoding & AlgorithmsOnsite
• Implement dynamic batching for token decodingMedium

  This question evaluates dynamic batching, per-request state management, and sequence-decoding correctness for language-model inference, including handling stop conditions, max-token limits, and maintaining a correct slot-to-request mapping.

  xAIMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement two string utility functionsMedium

  This question evaluates proficiency in string manipulation and text processing, including character counting, tokenization by spaces, case-sensitive comparisons, and preserving original word order.

  xAIData EngineerCoding & AlgorithmsTechnical Screen
• In-Memory Key-Value Database with Nested TransactionsEasy

  This question evaluates understanding of in-memory data structures, transactional semantics (including nested transactions), and algorithmic complexity for implementing a key-value store that supports efficient GET/SET and rollback/commit operations.

  xAISoftware EngineerCoding & AlgorithmsOnsite