Data Scientist Interview Questions

Showing 1–30 of 241 results

• AAdiaEasy·Data Scientist
  Compute Score Difference in Reversing Array Game

  This question tests the ability to manage state changes while iterating through an array based on index-dependent rules, specifically involving conditional array modifications.

  Coding & AlgorithmsTechnical ScreenArraysSimulationDeque
• Akuna CapitalMedium·Data Scientist
  Count subarrays equal to target

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

  Coding & AlgorithmsTechnical Screen
• Akuna CapitalHard·Data Scientist
  Find minimum swaps to sort array with duplicates

  This question evaluates array manipulation and permutation-based reasoning for minimizing swap operations, including handling of duplicate values and performance considerations, within the Coding & Algorithms domain for a Data Scientist role.

  Coding & AlgorithmsOnline Assessment
• Akuna CapitalMedium·Data Scientist
  Maximize profitable pairs

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

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Calculate 7-Day Rolling Average for Energy Consumption

  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.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Compute array modes with ties and no-mode rule

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Design a Scalable, Fault-Tolerant Distributed Order System

  This question evaluates system-design and algorithmic competencies, combining distributed-systems concepts — high availability, low-latency architecture, scalability levers, and fault-tolerance mechanisms — with practical binary-tree traversal and time–space complexity analysis.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Determine Length of Longest Unique Substring

  This question evaluates string-processing skills and algorithmic problem-solving, including handling character uniqueness and performance considerations. Commonly asked in Coding & Algorithms interviews to assess a candidate's ability to implement efficient solutions and reason about time/space trade-offs, it targets practical application rather than purely conceptual understanding.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Generate Synthetic Clickstream Data with Python Function

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Generate primes up to n efficiently

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Implement Function to Determine Mode and Prime Numbers

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Implement Reservoir Sampling; Analyze Time and Space Complexity

  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.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Implement a high-throughput web crawler safely

  This question evaluates competency in concurrent systems, scalable data ingestion, and algorithmic design for a high-throughput web crawler, covering URL normalization, deduplication, per-host rate limiting, fault-tolerant checkpointing, and bounded-memory queueing.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Implement and Analyze 'Merge k Sorted Lists' Algorithm

  This question evaluates algorithm design skills and complexity analysis for merging multiple sorted sequences, measuring proficiency with appropriate data structures, time-space trade-offs, and correctness reasoning.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Implement list overlap and dense-ranked word frequencies

  This question evaluates a data scientist's ability to implement efficient multiset intersection and streaming top-k word-frequency computations, covering duplicate-aware counting, dense-ranking, Unicode handling, and strict time/space constraints.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Implement streaming k-way merge with constraints

  This question evaluates competence in streaming algorithms and resource-constrained algorithm design, specifically implementing a k-way merge over blocking, potentially unbounded integer iterators while preserving stable duplicates and reasoning about time and O(k) space complexity.

  Coding & AlgorithmsOnsite
• AmazonMedium·Data Scientist
  Solve Algorithmic Challenges in Online Coding Assessments

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Solve Search Insert Position Using Binary Search

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

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Solve stock, BFS path, and merge intervals

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonHard·Data Scientist
  Solve subset-count and kth-factor problems

  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.

  Coding & AlgorithmsOnline Assessment
• AmazonEasy·Data Scientist
  Solve two string DP/hash problems

  This question set evaluates string-processing and algorithmic problem-solving skills, including encoding and transformation for unique representations and dynamic programming, memoization, and backtracking for enumerating all valid segmentations.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Data Scientist
  Solve two-sum variants at scale

  This question evaluates array and hashing algorithms, pair-sum reasoning including duplicate handling and lexicographic minimality, streaming and external-memory algorithm design, trade-offs in time/space complexity, and extension to three-sum with deduplication.

  Coding & AlgorithmsOnsite
• AppleHard·Data Scientist
  Compute optimal matrix-chain multiplication order

  This question evaluates dynamic programming, algorithmic analysis, and sensitivity reasoning for matrix-chain multiplication, and it belongs to the Coding & Algorithms domain; it is commonly asked because it tests understanding of optimal substructure, trade-offs in parenthesization, and correctness versus greedy heuristics.

  Coding & AlgorithmsOnsite
• AppleMedium·Data Scientist
  Find Maximum Sum of Contiguous Subarray Length k

  This question evaluates skill in array manipulation and computing aggregate metrics over fixed-length intervals, along with understanding of algorithmic complexity and trade-offs between runtime and memory.

  Coding & AlgorithmsTechnical Screen
• AppleMedium·Data Scientist
  Find Smallest Missing Positive Integer in O(n) Time

  This question evaluates a candidate's skill in array algorithms and in-place algorithm design, emphasizing understanding of time and space complexity and handling edge cases when identifying the smallest missing positive integer.

  Coding & AlgorithmsOnsite
• AppleMedium·Data Scientist
  Remove shortest subarray to sort array

  This question evaluates proficiency in array algorithms, algorithmic efficiency (linear time and constant-space reasoning), and handling edge cases related to non-decreasing order, within the Coding & Algorithms domain.

  Coding & AlgorithmsOnsite
• AtlassianMedium·Data Scientist
  Implement Real-Time Rate Limiting for Web Service Requests

  This question evaluates understanding of real-time rate limiting, time-windowed traffic control, and efficient per-client state management under algorithmic constraints.

  Coding & AlgorithmsTechnical Screen
• AtlassianMedium·Data Scientist
  Implement sliding-window rate limiter with dual thresholds

  This question evaluates a candidate's skill in implementing efficient online sliding-window rate limiting, covering stream processing, time-based window management, per-key state maintenance, algorithmic complexity analysis, and formal correctness reasoning.

  Coding & AlgorithmsOnline Assessment
• Bank of AmericaMedium·Data Scientist
  Compute maximum beauty of a string

  This question evaluates skills in string manipulation, frequency analysis, and optimization of weighted sums, focusing on assigning distinct values to characters to maximize an aggregate metric.

  Coding & AlgorithmsOnline Assessment
• Bank of AmericaMedium·Data Scientist
  Convert number words to integer

  This question evaluates textual number parsing, tokenization, and numeric mapping skills, testing string manipulation and lexical interpretation within the Coding & Algorithms domain for a Data Scientist role and emphasizing practical application rather than pure theoretical concepts.

  Coding & AlgorithmsOnline Assessment