Witeso

Rank	Topic	Frequency	Percentage
1	Array	30	48.4%
2	String	18	29.0%
3	Hash Table	17	27.4%
4	Two Pointers	11	17.7%
5	Sorting	10	16.1%
6	Linked List	8	12.9%
7	Math	8	12.9%
8	Dynamic Programming	8	12.9%
9	Depth-First Search	8	12.9%
10	Design	8	12.9%
11	Stack	7	11.3%
12	Backtracking	6	9.7%
13	Breadth-First Search	6	9.7%
14	Matrix	6	9.7%
15	Sliding Window	5	8.1%
16	Heap (Priority Queue)	5	8.1%
17	Binary Search	4	6.5%
18	Tree	4	6.5%
19	Recursion	4	6.5%
20	Divide and Conquer	3	4.8%
21	Greedy	3	4.8%
22	Bit Manipulation	3	4.8%
23	Union-Find	3	4.8%
24	Simulation	3	4.8%
25	Binary Tree	3	4.8%
26	Prefix Sum	3	4.8%
27	Trie	2	3.2%
28	Binary Search Tree	2	3.2%
29	Queue	2	3.2%
30	Merge Sort	2	3.2%
31	Doubly-Linked List	2	3.2%
32	Iterator	2	3.2%
33	Hash Function	2	3.2%
34	Geometry	1	1.6%
35	Rolling Hash	1	1.6%
36	Suffix Array	1	1.6%
37	Monotonic Stack	1	1.6%
38	Interactive	1	1.6%
39	Counting	1	1.6%
40	Data Stream	1	1.6%
41	Enumeration	1	1.6%
42	Ordered Set	1	1.6%
43	Monotonic Queue	1	1.6%

No.	Question Title	Link	Difficulty
1	Find Minimum Time to Finish All Jobs	Visit	Hard
2	Coordinate With Maximum Network Quality	Visit	Medium
3	Maximum Candies You Can Get from Boxes	Visit	Hard
4	Car Pooling	Visit	Medium
5	Missing Element in Sorted 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

Lyft Questions