Amazon Logo

Amazon - Segment Tree

Segment Tree questions asked by Amazon

Total: 30
Easy: 8
Medium: 13
Hard: 9
Progress: 0%
No. Question Title Link Difficulty Solved
1 Find Valid Pair of Adjacent Digits in String Visit Easy
2 Maximum Difference Between Adjacent Elements in a Circular Array Visit Easy
3 Minimum Positive Sum Subarray Visit Easy
4 Minimum Cost to Equalize Array Visit Hard
5 Return Length of Arguments Passed Visit Easy
6 Restricted Restricted Hard
7 Restricted Restricted Hard
8 Restricted Restricted Hard
9 Restricted Restricted Hard
10 Restricted Restricted Hard
11 Restricted Restricted Hard
12 Restricted Restricted Hard
13 Restricted Restricted Hard
14 Restricted Restricted Hard
15 Restricted Restricted Hard

Log in to access all 30 questions for free!

Log In

Frequently Asked Questions

Common questions about Amazon interviews