Tip 1 : Be strong with aptitude and logical based question for clearing basic OA .
Tip 2 : Strong with the core concepts of dsa like graph, tree and map etc.
Tip 3 : One of the tech stacks like Cloud or Frontend or Backend that is from your choice.
Tip 1 : The resume should be a mixture of both DSA and core computer skills.
Tip 2 : They were asking more questions about the Go language; having Go skills can help.
The round was mostly conducted using an online compiler, and most of the questions from coding platforms were directly asked. The interviewer was good and was happy with all my answers, so he selected me for the next round.



For the following array:
[0 1 1 1 0 0 1]
The output should be [0 0 0 1 1 1 1].
You have to sort the array in place.
So, I suggested using brute force first, where a sorting data structure could be used directly. However, he told me that we need to sort in not O(n). Therefore, I suggested using other sorting techniques like merge sort or quick sort. He then asked me to write pseudocode for merge sort. I wrote the pseudocode, and he was happy and told me to solve the next question.



String 'S' is NOT case sensitive.
Let S = “c1 O$d@eeD o1c”.
If we ignore the special characters, whitespaces and convert all uppercase letters to lowercase, we get S = “c1odeedo1c”, which is a palindrome. Hence, the given string is also a palindrome.
So I first said we can take a head and point one more variable to the last node; now, one from the start and one from the end, check if they are the same. If they are, it is a palindrome. Another way is to divide it in half and check if both halves are the same. If they are, then it is a palindrome.


1. Two nodes may have the same value associated with it.
2. Average of any level is computed as the sum of the values of all the nodes at that level divided by the number of nodes at that level.
3. You will be given the 'ROOT' node of the binary tree.
4. You need to print the floor value for each average. For example, if the average of node values at some level is 3.5 then you have to print 3.
I just explained the optimal way: we can take a queue and iterate through all its levels one by one, calculate the average of the levels, and put it in a vector. He was happy with my solution.
It was a resume-based round. All the questions related to tech stack and core computer fundamentals like OOP, COA, DBMS, OS, etc., were asked. He was happy with my answers, so he selected me.



You can’t sell without buying first.
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
So, actually, in this question, we were provided with a profits array. I applied the greedy solution, went through each array independently, and found out from which point we could maximize the profit. After that, we could return the maximum value.
Explain LEFT JOIN and RIGHT JOIN in DBMS (Learn)
Tip 1 : SQL concept should be cleared.
Tip 2 : NoSQL MongoDB concepts should be given importance.
Tip 3 : Practice SQL queries and a lot of practice is required.

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?