Amazon Web Services Interview Question

Q1: String Manipulation & Counting Distinct Elements The first problem involved splitting a sequence of characters into two parts while tracking shared elements. The goal was to count valid splits based on how many distinct items appeared in both segments. It tested efficient traversal and frequency tracking—similar to prefix/suffix problems with hash maps or sets. Q2: Minimizing Distances with Strategic Placement The second question was about optimizing the placement of two service points to minimize total distance for a set of locations. It required sorting the input and evaluating split points to find the best configuration. Edge cases mattered, especially with clustered inputs