Tip 1 : Practice CodeStudio Must Do section, solve at least 5 Questions daily
Tip 2 : Start talking to new people regarding technology to remove hesitation at the time of the interview.
Tip 3 : Be in contact with a senior already working in that company, ask them regarding previous experience and new project the company is working on.
Tip 4 : Once you are done with CodeStudio must do questions, now complete CodeStudio sorting by your target company.
Tip 5 : For core subjects refer to gate smashers and knowledge gate videos on youtube.
Tip 1 : Try to modify your resume according to the company you are applying for, for this read their Job Description provided to you.
Tip 2 : Mention no more than 3 projects and 1,2 internships.
Tip 3 : Divide your skills into beginner, intermediate and hard sections, otherwise don't mention too many skills.
Tip 4 : Don't mention to many Position Of Responsibilities( at max 2-3).
There were 20 MCQ questions related to aptitude and basic maths. Approximately 45 mins were allowed to complete that section. After that, there were 2 coding questions- one on a string general concept and the other was on Dynamic Programming. Remember that, they're both coding questions were of different points, so attempt accordingly. For 2nd section-time allocated was 60 mins. The Platform is good might hang at few places, so remember to do hard refresh at that time using ctrl+sift+R. Section 2 is of 300 points, section 1 is of 200 points, so attempt both sections carefully. Note- not all MCQs are of same points.
Had to complete a technical assignment within given time limit.
There were 5 people in the zoom meet, including me. Rest all 4 were interviewers, 3 from India and 1 from the United Kingdom.
They started with my introduction and then moved on to the questions from my resume, starting with my internship at Samsung Bangalore and then projects.
Then another interviewer asked about my weakness and strength. Then comes the turn of coding questions.
Starting with finding the minimum element in O(1) time, rotating the 2-D array by 90 degrees, OOPS questions were also asked like- polymorphism, abstraction, virtual class. Some OS questions were- cache, paging algorithms.
Then come my POR and other activities.



If 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9
Sorting the array we get 1, 2, 6, 7, 9
Hence the 3rd smallest number is 6.



For given 2D array :
[ [ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ] ]
After 90 degree rotation in anti clockwise direction, it will become:
[ [ 3, 6, 9 ],
[ 2, 5, 8 ],
[ 1, 4, 7 ] ]
What are page replacement algorithm in Operating System?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?