Witeso

Rank	Topic	Frequency	Percentage
1	Array	99	44.8%
2	String	56	25.3%
3	Hash Table	48	21.7%
4	Depth-First Search	39	17.6%
5	Breadth-First Search	34	15.4%
6	Dynamic Programming	33	14.9%
7	Math	31	14.0%
8	Tree	28	12.7%
9	Two Pointers	27	12.2%
10	Binary Tree	26	11.8%
11	Sorting	25	11.3%
12	Stack	23	10.4%
13	Design	18	8.1%
14	Binary Search	17	7.7%
15	Matrix	17	7.7%
16	Linked List	14	6.3%
17	Backtracking	12	5.4%
18	Heap (Priority Queue)	12	5.4%
19	Graph Theory	11	5.0%
20	Union-Find	9	4.1%
21	Divide and Conquer	8	3.6%
22	Greedy	8	3.6%
23	Bit Manipulation	8	3.6%
24	Binary Search Tree	8	3.6%
25	Simulation	8	3.6%
26	Recursion	7	3.2%
27	Sliding Window	7	3.2%
28	Counting	7	3.2%
29	Prefix Sum	6	2.7%
30	Queue	5	2.3%
31	Memoization	5	2.3%
32	Monotonic Stack	5	2.3%
33	Doubly-Linked List	4	1.8%
34	Bucket Sort	3	1.4%
35	Database	3	1.4%
36	Ordered Set	3	1.4%
37	Topological Sort	3	1.4%
38	Data Stream	3	1.4%
39	Enumeration	3	1.4%
40	Randomized	3	1.4%
41	Trie	3	1.4%
42	Quickselect	2	0.9%
43	Bitmask	2	0.9%
44	Shortest Path	2	0.9%
45	Combinatorics	2	0.9%
46	Iterator	2	0.9%
47	Hash Function	1	0.5%
48	Rolling Hash	1	0.5%
49	Counting Sort	1	0.5%
50	Brainteaser	1	0.5%
51	String Matching	1	0.5%
52	Geometry	1	0.5%
53	Merge Sort	1	0.5%
54	Sweep Line	1	0.5%
55	Interactive	1	0.5%
56	Game Theory	1	0.5%
57	Segment Tree	1	0.5%

No.	Question Title	Link	Difficulty
1	Minimum Increase to Maximize Special Indices	Visit	Medium
2	Count Sequences to K	Visit	Hard
3	Maximize Subarrays After Removing One Conflicting Pair	Visit	Hard
4	Find the Number of Subarrays Where Boundary Elements Are Maximum	Visit	Hard
5	Number of Divisible Triplet Sums	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

Linkedin Questions