Witeso

Rank	Topic	Frequency	Percentage
1	Array	95	44.4%
2	String	56	26.2%
3	Hash Table	46	21.5%
4	Depth-First Search	39	18.2%
5	Breadth-First Search	34	15.9%
6	Dynamic Programming	32	15.0%
7	Math	30	14.0%
8	Tree	28	13.1%
9	Two Pointers	27	12.6%
10	Binary Tree	26	12.1%
11	Sorting	24	11.2%
12	Stack	22	10.3%
13	Design	18	8.4%
14	Binary Search	16	7.5%
15	Matrix	16	7.5%
16	Linked List	13	6.1%
17	Backtracking	12	5.6%
18	Heap (Priority Queue)	12	5.6%
19	Graph Theory	11	5.1%
20	Union-Find	9	4.2%
21	Divide and Conquer	8	3.7%
22	Greedy	8	3.7%
23	Binary Search Tree	8	3.7%
24	Simulation	8	3.7%
25	Bit Manipulation	7	3.3%
26	Sliding Window	7	3.3%
27	Counting	7	3.3%
28	Recursion	6	2.8%
29	Memoization	5	2.3%
30	Queue	5	2.3%
31	Prefix Sum	5	2.3%
32	Monotonic Stack	4	1.9%
33	Doubly-Linked List	4	1.9%
34	Topological Sort	3	1.4%
35	Trie	3	1.4%
36	Bucket Sort	3	1.4%
37	Data Stream	3	1.4%
38	Randomized	3	1.4%
39	Database	2	0.9%
40	Combinatorics	2	0.9%
41	Iterator	2	0.9%
42	Enumeration	2	0.9%
43	Quickselect	2	0.9%
44	Ordered Set	2	0.9%
45	Shortest Path	2	0.9%
46	Bitmask	2	0.9%
47	Segment Tree	1	0.5%
48	Brainteaser	1	0.5%
49	Geometry	1	0.5%
50	Sweep Line	1	0.5%
51	Rolling Hash	1	0.5%
52	Merge Sort	1	0.5%
53	String Matching	1	0.5%
54	Interactive	1	0.5%
55	Hash Function	1	0.5%
56	Counting Sort	1	0.5%
57	Game Theory	1	0.5%

No.	Question Title	Link	Difficulty
1	Maximize Subarrays After Removing One Conflicting Pair	Visit	Hard
2	Find the Number of Subarrays Where Boundary Elements Are Maximum	Visit	Hard
3	Number of Divisible Triplet Sums	Visit	Medium
4	House Robber IV	Visit	Medium
5	Time to Cross a Bridge	Visit	Hard
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

Linkedin Questions