Problem of the day
Tip 1 : Start with making your basics strong about programming, which included basic data structures like array, linked list etc.
Tip 2 : Practice dry running the code with custom test cases, try to find the edge cases by yourself
Tip 3: Do not search for a solution until you have tried your best to think of it
Tip 3 : For reference you can reach to Interview Preparation Course of Coding Ninjas, LeetCode, Codezen
Tip 1: Have at-least one good project on resume, keep it to the point and do not fake it.
Tip 2: Add the skills section to your resume properly, highlight what's needed.
First-round was online round on CoCubes and there were three coding questions (2, 3 and 5 marks). The test was held in the institute's computer center and there were 6 sets of coding question, out of which one was assigned to you randomly. If you have completed all the questions, it is a very high probability that you will advance to next round.
I initially did it using maps in c++ but in the end reduced the space to complexity to O(1) using three pointer approach.
The given linked list is 1 -> 2 ->...
It's a standard linked list question, used recursion to solve this.
There were a few debugging problems in which we need to figure the bugs in the code. In the end there was a programming question for which we need to write a pseudo code.
I used DP for this question, as it was a subjective round, I explained my approach using a testcase.
The interviews started during evening. In this round i was asked to introduce myself and describe a project that was listed on the resume. There were questions related to the technical details of the project, for example what is the tech stack that was used. After this i was asked to solve a programming question which was fairly simple
In this round I was asked to solve 1 programming question and needed to improve the solution to reduce both space and time complexity.
It was a pretty interesting round, in which i was asked to design a solution for real life situation.
I didn’t have to code it but I had to explain to him the approach and which Data structure should be used. I gave him a DFS based approach and using a map for cache.