Tip 1 : Practice coding
Tip 2 : Try to write attractive resume
Tip 3 : Don't follow others blindly
Tip 1 : Don't lie on resume
Tip 2 : Write in one page with important details
This was an online coding round in our college. It contains 2 coding questions and 6-7 MCQs based on operating systems, data structures, and some other basic computer science topics. The test was around 90 minutes and those who were able to solve both coding questions completely are called for the next round of interviews. I don’t remember the exact coding questions but the first question was the simple stl(c++) implementation and the second question was a dynamic programming question.
If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.
Using another string variable and traverse from end to start
1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.
Use hashmap
So, This was the technical interview held on Google meet. The interviewer asked me to share my screen and open the Visual Studio Code. After this, he introduced himself and asked me about my hobbies and how much you are active in competitive coding platforms. Then he came up with the coding questions:
1. Do not print anything, just return the root node of the tree.
2. Your constructed tree will be checked by doing an in-order traversal of the tree from the returned root node.
1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
4. If no such index is present in the array, return -1.
In the case of two closest sums, print the smallest sum.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?