Witeso

Rank	Topic	Frequency	Percentage
1	Array	52	58.4%
2	Hash Table	19	21.3%
3	Math	18	20.2%
4	String	18	20.2%
5	Sorting	14	15.7%
6	Dynamic Programming	13	14.6%
7	Two Pointers	12	13.5%
8	Greedy	12	13.5%
9	Heap (Priority Queue)	10	11.2%
10	Binary Search	7	7.9%
11	Stack	7	7.9%
12	Backtracking	6	6.7%
13	Matrix	5	5.6%
14	Divide and Conquer	4	4.5%
15	Depth-First Search	4	4.5%
16	Breadth-First Search	4	4.5%
17	Design	4	4.5%
18	Monotonic Stack	4	4.5%
19	Counting	4	4.5%
20	Linked List	3	3.4%
21	Bit Manipulation	3	3.4%
22	Sliding Window	3	3.4%
23	Database	3	3.4%
24	Simulation	3	3.4%
25	Combinatorics	3	3.4%
26	Prefix Sum	3	3.4%
27	Union-Find	2	2.2%
28	Graph Theory	2	2.2%
29	Recursion	2	2.2%
30	Queue	2	2.2%
31	Number Theory	2	2.2%
32	Quickselect	2	2.2%
33	Topological Sort	1	1.1%
34	Binary Indexed Tree	1	1.1%
35	Segment Tree	1	1.1%
36	Brainteaser	1	1.1%
37	Memoization	1	1.1%
38	Doubly-Linked List	1	1.1%
39	Bucket Sort	1	1.1%
40	Data Stream	1	1.1%
41	Monotonic Queue	1	1.1%
42	Randomized	1	1.1%
43	Shortest Path	1	1.1%
44	Bitmask	1	1.1%

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