Witeso

Amazon Questions

Here are the LeetCode questions for Amazon.

Total: 2096

Easy: 554

Medium: 1155

Hard: 387

Progress: 0%

Rank	Topic	Frequency	Percentage
1	Array	1013	48.3%
2	String	468	22.3%
3	Hash Table	394	18.8%
4	Dynamic Programming	334	15.9%
5	Math	323	15.4%
6	Sorting	244	11.6%
7	Greedy	212	10.1%
8	Depth-First Search	209	10.0%
9	Tree	163	7.8%
10	Binary Search	160	7.6%
11	Breadth-First Search	159	7.6%
12	Database	157	7.5%
13	Matrix	148	7.1%
14	Two Pointers	146	7.0%
15	Bit Manipulation	135	6.4%
16	Binary Tree	131	6.3%
17	Stack	114	5.4%
18	Heap (Priority Queue)	111	5.3%
19	Simulation	96	4.6%
20	Prefix Sum	94	4.5%
21	Design	93	4.4%
22	Sliding Window	88	4.2%
23	Graph Theory	87	4.2%
24	Counting	83	4.0%
25	Backtracking	79	3.8%
26	Enumeration	57	2.7%
27	Linked List	56	2.7%
28	Union-Find	45	2.1%
29	Ordered Set	41	2.0%
30	Monotonic Stack	40	1.9%
31	Divide and Conquer	38	1.8%
32	Recursion	38	1.8%
33	Trie	33	1.6%
34	Segment Tree	31	1.5%
35	Binary Search Tree	31	1.5%
36	Queue	29	1.4%
37	Number Theory	29	1.4%
38	Memoization	28	1.3%
39	Bitmask	28	1.3%
40	Topological Sort	24	1.1%
41	Combinatorics	24	1.1%
42	Binary Indexed Tree	22	1.0%
43	Geometry	21	1.0%
44	Hash Function	20	1.0%
45	Shortest Path	17	0.8%
46	String Matching	16	0.8%
47	Data Stream	16	0.8%
48	Game Theory	16	0.8%
49	Rolling Hash	15	0.7%
50	Brainteaser	13	0.6%
51	Interactive	13	0.6%
52	Merge Sort	9	0.4%
53	Doubly-Linked List	9	0.4%
54	Monotonic Queue	9	0.4%
55	Randomized	9	0.4%
56	Sweep Line	7	0.3%
57	Iterator	7	0.3%
58	Concurrency	6	0.3%
59	Bucket Sort	6	0.3%
60	Counting Sort	6	0.3%
61	Suffix Array	5	0.2%
62	Quickselect	5	0.2%
63	Reservoir Sampling	4	0.2%
64	Probability and Statistics	4	0.2%
65	Radix Sort	3	0.1%
66	Minimum Spanning Tree	3	0.1%
67	Shell	2	0.1%
68	Eulerian Circuit	2	0.1%
69	Strongly Connected Component	2	0.1%

No.	Question Title	Link	Difficulty
1	Minimum Cost to Buy Apples II	Visit	Hard
2	Minimize Array Sum Using Divisible Replacements	Visit	Medium
3	Minimum Flips to Make Binary String Coherent	Visit	Medium
4	Maximize Fixed Points After Deletions	Visit	Hard
5	Minimum Operations to Make Array Non Decreasing	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 2096 questions for free!

Common questions about Amazon interviews