CodingReported in a candidate post, Mar 2025
Solve 3 DSA problems on Hash Maps, Linked Lists, and Graphs
Filed under Amazon
Free read 3 of 3Quickly read all three problems to gauge difficulty and allocate time accordingly.
The question
Solve three algorithmic problems involving Hash Maps, Linked Lists, and Graphs within a proctored digital test environment.
Constraints
- Time limit applies across all three problems.
- Problems range from Easy to Hard difficulty.
- Standard online judge constraints.
Approach
Quickly read all three problems to gauge difficulty and allocate time accordingly.
Solve the hash map or basic data structure problem quickly to secure baseline points.
Tackle the linked list or graph problem, focusing on edge cases and optimal time complexity.
Run custom test cases against all solutions before submitting.
Tips
- What they are testing: Evaluates foundational data structure fluency, speed, and accuracy under timed conditions.
- Common mistake: Spending too much time debugging the first or second problem and failing to attempt the third.
Related Amazon questions
Collected from public candidate posts and coding forums. Updated Nov 2026.