Amazon Coding Interview Questions | Design Gurus

Amazon

DesignGurus · 50 questions

Practice Progress: 0/50 solved (0.0%)

Easy 0/15 Med. 0/25 Hard 0/10

Difficulty

# Title Acceptance Difficulty
1 Redistribute Characters to Make All Strings Equal (easy) 62.0% easy
2 Longest Common Prefix (easy) 62.4% easy
3 Make Array Zero by Subtracting Equal Amounts (easy) 51.0% easy
4 Leaf-Similar Trees (easy) 51.4% easy
5 Hidden Document 50.6% easy
6 Hidden Document 27.5% easy
7 Hidden Document 51.6% easy
8 Hidden Document 49.1% easy
9 Hidden Document 39.1% easy
10 Hidden Document 80.1% easy
11 Hidden Document 69.0% easy
12 Hidden Document 59.8% easy
13 Hidden Document 51.3% easy
14 Hidden Document 59.8% easy
15 Hidden Document 62.0% easy
16 Maximum Length of Subarray With Positive Product (medium) 31.8% Med.
17 Largest Submatrix With Rearrangements (medium) 51.3% Med.
18 Count the Number of Good Subarrays (medium) 45.0% Med.
19 Minimum Suffix Flips (medium) 77.0% Med.
20 Minimum Number of Operations to Make Array Empty (medium) 43.2% Med.
21 Next Greater Element II (medium) 74.6% Med.
22 Hidden Document 41.1% Med.
23 Hidden Document 42.2% Med.
24 Hidden Document 38.9% Med.
25 Hidden Document 50.7% Med.
26 Hidden Document 40.5% Med.
27 Hidden Document 46.5% Med.
28 Hidden Document 54.2% Med.
29 Hidden Document 56.5% Med.
30 Hidden Document 63.8% Med.
31 Hidden Document 69.2% Med.
32 Hidden Document 62.4% Med.
33 Hidden Document 69.3% Med.
34 Hidden Document 35.8% Med.
35 Hidden Document 56.9% Med.
36 Hidden Document 41.5% Med.
37 Hidden Document 60.3% Med.
38 Hidden Document 46.4% Med.
39 Hidden Document 41.6% Med.
40 Hidden Document 49.3% Med.
41 Constrained Subsequence Sum (hard) 28.3% hard
42 Number of Valid Subarrays (hard) 52.5% hard
43 Count Vowels Permutation (hard) 61.4% hard
44 Concatenated Words (hard) 63.8% hard
45 Hidden Document 61.8% hard
46 Hidden Document 63.3% hard
47 Hidden Document 70.0% hard
48 Hidden Document 42.6% hard
49 Hidden Document 46.0% hard
50 Hidden Document 17.7% hard