Tip 1 : Start Preparing LeetCode.
Tip 2 : All the topic should be covered in depth. It's not about quantity it's all about quality.
Tip 1: Give the proper description of the projects.
Tip 2: Give the proper description of your roles and responsibilties.



Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
1-Keep three counters c0 to count 0s, c1 to count 1s, and c2 to count 2s
2-Traverse through the array and increase the count of c0 if the element is 0, increase the count of c1 if the element is 1 and increase the count of c2 if the element is 2
3-Now again traverse the array and replace the first c0 elements with 0, the next c1 elements with 1, and the next c2 elements with 2.



1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
Traverse linked list using two-pointers. Move one pointer by one and the other pointers by two. When the fast pointer reaches the end, the slow pointer will reach the middle of the linked list.
questions on multithreading.oops etc etc
2 or 3 puzzles along with one design of api.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?