Tip 1 : Prepare for DSA well start solving some more hard problems as soon as you start grasping concepts(around 300+ good questions are enough)
Tip 2 : Speak aloud and Do not be nervous as it's a key factor in any interview of big tech giants
Tip 3 : Prepare your projects well and always try to have a look at them before your interview get started
Tip 1 : Should be well written and try to keep it for only 1 page
Tip 2 : Only write those skills in which you are good.
It consisted of 9 good level MCQs and 2 medium level Coding problems Based
It was little bit tricky interview round which consisted of 3-4 coding problems being asked and then some concepts of Full stack development including deployment after that they asked me a small design question that was little bit tricky with variations but was based on DSA only.
which data structures to choose in order to allocate the proccesses based on priority and arrival time.(basic one but lots of variations too that I donot remember)
Tip 1 : Keep calm and listen carefully
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.
take two pointers fast(which moves twice) and slow(moves only one step) to get the middle node and then using some other pointers of keeping the next of slow node Added the node in middle carefully.
1. ‘cloneTree’ is an exact copy of the ‘originalTree’.
2. All nodes in ‘originalTree’ are distinct.
3. The given node in the ‘originalTree’ will not be NULL.
4. You cannot change any of the two given trees.
State all steps based on system designing and software lifecyle.
Managerial Round asked lot of questions based on projects
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the output of print(type("Python"))?