Problem of the day
Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 - Practice Atleast 250 Questions
Tip 5 - Ex- Do atleast 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
Tip 3 : Don't make any silly spelling mistakes on resume
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.
This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.
You need to make the modifications in the input matrix.
You do not need to print anything, it has already been taken care of.
It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Implement a class which inherits features from another class. Basically i had to provide a list of employees of a particular department. along with their salary details when i was given a department of any organisation.
I used inheritance and also used hashmaps to maintain a map of an integer for every department.
10 boxes each with 10 stones are present. each box has stones of different weight but weight in each box is uniform. Only one box has one stone of non-uniform weight. Find optimized way to find in which box is this wrong stone present.
Take 1 stone from box1, 2 from box 2 and so on.
Answer : 10