Applied Scientist Interview Questions

Showing 1–8 of 8 results

• AmazonMedium·Applied Scientist
  Check if adding edge creates cycle in digraph

  This question evaluates understanding of graph algorithms, reachability, and algorithmic complexity by determining whether adding a directed edge would introduce a cycle in an otherwise acyclic directed graph.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Applied Scientist
  Determine if all courses can be completed

  This problem tests your ability to model prerequisites as a directed graph and detect cycles to determine if a valid topological ordering exists.

  Coding & AlgorithmsTechnical ScreenGraphsTopological SortDFS
• AmazonMedium·Applied Scientist
  Find shortest transformation steps in a word graph

  This question evaluates a candidate's ability to model string transformations as a graph, apply graph traversal and shortest-path reasoning, and manage efficient string-based search and data-structure choices within the Coding & Algorithms domain.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Applied Scientist
  Find two numbers that sum to target

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Applied Scientist
  Highest Average-Salary Team in an Org Chart

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

  Coding & AlgorithmsTechnical Screentreedfsrecursion
• AmazonHard·Applied Scientist
  Implement Optimal Bucket Batching

  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.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Applied Scientist
  Implement binary search lower/upper bounds

  Implement lower_bound and upper_bound on a non-decreasing sorted array using iterative binary search in O(log n) time and O(1) space. This Amazon ML engineer screen tests precise boundary handling, loop-invariant reasoning, and edge cases like duplicates, empty arrays, and out-of-range targets.

  Coding & AlgorithmsTechnical Screen
• AmazonMedium·Applied Scientist
  Merge Overlapping Time Ranges

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

  Coding & AlgorithmsTechnical ScreenArraysSortingIntervals