Problem of the day
Tip 1 : Practice questions on each data structure
Tip 2 : Try to complete Interview Bit, practice previously asked questions and there are many videos on youtube which have made dsa sheets, just do all the important questions. Try to solve 500 questions in total to become fully prepared for coding rounds.
Tip 3 : Make a notebook for all the questions you do, note down the approach and code on a copy, it comes out to be very beneficial for revision.
Tip 1 : Have some good projects in the resume.
Tip 2 : If you have done any internship, then it will be a plus point. If you don't have internships then you should have some good competitive programming ranks.
It was an online round with coding questions, MCQs and a technical writing part
Matrices, determinants and polynomial equations MCQs are their
All of them are of engineering mathematics level
A situation is given, we have to write a technical article of around 300-500 words (I dont remember exact word limit)
It was an online telephonic round, I was aksed to share my screen and to open my code editor. I generally code in VS Code, So I shared my VS code screen with the interviewer.
Timing - 4pm
Environment was good
Interviewer was nice person
I first explained that what is a BST.
Then Interviewer gave me an example and asked me to explain it and code it.
I was then started writing the code and explaining each line to the Interviewer that what I am doing.
Finally it was done and explained it further including all the corner cases
The given linked list is 1 -> 2 ->...
I explained from scratch that what will be our algorithm and what all nodes I am gonna make and the purpose of each node.
Bonus Tip: Communicate with interviewer consistently, don't just keep quit all the time
Finally I solved it and interviewer was satisfied with my approach.
I gave the solution using 2 pointer approach as it can solve it in linear time complexity.
I explained this question by giving an example and implementing my approach on that example.
interviewer was convinced.