Tip 1 : Learn DSA properly
Tip 2 : Keep revisiing DSA and grind daily on leetcode
Tip 3 : Have indepth knowledge about resume and project
Tip 1: Don't mention anything which you are not sure about.
Tip 2: A half filled resume is better than unnecessary topics which you don't know.
There were 2 section 1 hour of each.
First section consist of two easy problem. Second section had 1 medium and 1 hard problem.
'arr '= [1,2,3,4,5]
'k' = 1 rotated array = [2,3,4,5,1]
'k' = 2 rotated array = [3,4,5,1,2]
'k' = 3 rotated array = [4,5,1,2,3] and so on.
Simple variaton of Rotate the array by k position .
S = “[1, [2, 3], [4, [5, 6] ] ]”
Total depth = 1*1 + 2*2 + 3*2 + 4*2 + 5*3 + 6*3 = 52
1. The given string may be empty.
2. The string will not contain any white spaces.
3. You have to take the modulo with 10 ^ 9 + 7 as the answer may be very large.
If we are given the above binary tree as input then moving from root node(5) to the farthest leaf node(50), the path formed will be [ 5->10->25->35->40->45->50 ]. The total number of nodes encountered is 7, therefore the maximum depth of the binary tree is 7.
DFS
They asked about my projects only.
said that we can make change in the database by making post request. So wrong !
Why have you choosed MERN stack?
Data Structure vs DataBase.
Can we create our own API.
What are the disadvantages of Virtual DOM. (Didn’t know at all) Answer is too much memory consumption
Why have you used MongoDB?
I was not clear at all with Database concepts, so much confusion.
I was not knowledgeable about SQL.
Why have you used Material UI? What is it? it’s alternatives (Ant design, I mispronounced it).
Why have you chosen React.Js for your project? What would have you used if not React.
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?