Amazon Logo

Amazon - Binary Indexed Tree

Binary Indexed Tree questions asked by Amazon

Total: 22
Easy: 3
Medium: 13
Hard: 6
Progress: 0%
No. Question Title Link Difficulty Solved
1 Find Valid Pair of Adjacent Digits in String Visit Easy
2 Construct the Minimum Bitwise Array II Visit Medium
3 Minimum Cost to Equalize Array Visit Hard
4 Maximum Number of Fish in a Grid Visit Medium
5 Minimize the Maximum of Two Arrays Visit Medium
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 22 questions for free!

Log In

Frequently Asked Questions

Common questions about Amazon interviews