Witeso

Rank	Topic	Frequency	Percentage
1	Array	57	58.8%
2	Hash Table	22	22.7%
3	String	20	20.6%
4	Math	20	20.6%
5	Dynamic Programming	15	15.5%
6	Sorting	14	14.4%
7	Greedy	13	13.4%
8	Two Pointers	12	12.4%
9	Heap (Priority Queue)	11	11.3%
10	Binary Search	8	8.2%
11	Stack	8	8.2%
12	Backtracking	6	6.2%
13	Depth-First Search	5	5.2%
14	Matrix	5	5.2%
15	Breadth-First Search	5	5.2%
16	Prefix Sum	5	5.2%
17	Divide and Conquer	4	4.1%
18	Simulation	4	4.1%
19	Design	4	4.1%
20	Sliding Window	4	4.1%
21	Monotonic Stack	4	4.1%
22	Counting	4	4.1%
23	Database	3	3.1%
24	Bit Manipulation	3	3.1%
25	Linked List	3	3.1%
26	Combinatorics	3	3.1%
27	Union-Find	2	2.1%
28	Quickselect	2	2.1%
29	Recursion	2	2.1%
30	Number Theory	2	2.1%
31	Queue	2	2.1%
32	Randomized	2	2.1%
33	Graph Theory	2	2.1%
34	Bucket Sort	1	1.0%
35	Ordered Set	1	1.0%
36	Brainteaser	1	1.0%
37	Binary Tree	1	1.0%
38	Tree	1	1.0%
39	Bitmask	1	1.0%
40	Topological Sort	1	1.0%
41	Binary Indexed Tree	1	1.0%
42	Doubly-Linked List	1	1.0%
43	Data Stream	1	1.0%
44	Monotonic Queue	1	1.0%
45	Shortest Path	1	1.0%
46	Memoization	1	1.0%
47	Segment Tree	1	1.0%

No.	Question Title	Link	Difficulty
1	Minimum Prefix Removal to Make Array Strictly Increasing	Visit	Medium
2	Button with Longest Push Time	Visit	Easy
3	Lexicographically Smallest String After a Swap	Visit	Easy
4	Find The First Player to win K Games in a Row	Visit	Medium
5	Find Occurrences of an Element in an Array	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

Jpmorgan Questions