Witeso

Rank	Topic	Frequency	Percentage
1	Array	29	53.7%
2	Hash Table	16	29.6%
3	String	15	27.8%
4	Math	10	18.5%
5	Dynamic Programming	10	18.5%
6	Two Pointers	8	14.8%
7	Stack	7	13.0%
8	Breadth-First Search	7	13.0%
9	Design	7	13.0%
10	Bit Manipulation	6	11.1%
11	Depth-First Search	6	11.1%
12	Matrix	6	11.1%
13	Linked List	5	9.3%
14	Sorting	5	9.3%
15	Union-Find	4	7.4%
16	Recursion	4	7.4%
17	Backtracking	3	5.6%
18	Tree	3	5.6%
19	Prefix Sum	3	5.6%
20	Divide and Conquer	2	3.7%
21	Graph Theory	2	3.7%
22	Queue	2	3.7%
23	Heap (Priority Queue)	2	3.7%
24	Binary Tree	2	3.7%
25	Counting	2	3.7%
26	Iterator	2	3.7%
27	Binary Search	1	1.9%
28	Greedy	1	1.9%
29	Topological Sort	1	1.9%
30	Binary Search Tree	1	1.9%
31	Sliding Window	1	1.9%
32	Monotonic Stack	1	1.9%
33	Simulation	1	1.9%
34	Doubly-Linked List	1	1.9%
35	Bucket Sort	1	1.9%
36	Data Stream	1	1.9%
37	Quickselect	1	1.9%
38	Shortest Path	1	1.9%
39	Bitmask	1	1.9%

No.	Question Title	Link	Difficulty
1	Decode the Message	Visit	Easy
2	Minimum Changes To Make Alternating Binary String	Visit	Easy
3	Find Followers Count	Visit	Easy
4	Design Parking System	Visit	Easy
5	Maximum Length of a Concatenated String with Unique Characters	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

Tesla Questions