Tip 1 : Understand Data Structures in details to have more confidence and get in-depth of its concepts. Practice minimum 5-6 coding questions on a daily basis on any coding platform. I had practiced around 140+ questions on Leetcode and 200+ questions on Geek For Geeks. Regularly practice the question rather than completing all the coding questions in one go. Ensure to include the concepts learnt in the questions
Tip 2 : Always analyze its time and space complexity while attempting the questions. Work towards optimize your solution, use the relevant strategies. In some cased the interviewer asks only one question and step by step keep on increasing difficulty by asking for its more optimization and will keep on discussing what kind of strategies are being implemented by you.
Tip 3 : Attempt the coding questions, but also keep on learning concepts in details of Operating Systems, databases and object oriented programming. Refer to Geeks For Geeks articles for it. Also go through, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.
Tip 1 : Ensure to mention only those projects, skills and achievements which you have completed yourselves and have thorough knowledge. Because the questions will be around the skills you ave mentioned and in case if you are not able to answer these basic questions it leaves negative impression on interviewer.
Tip 2 : Do not add too many projects in your resume. Only one or two good projects with proper knowledge is also fine. Do the same for skills and do not add so many skills, only add those one in which you ave good understanding and can discuss and answer.
Tip 3 : Mention those achievements which showcase your all skills like technical skills, communication skills, leadership quality or teamwork.
The given Database was having some records. The database was having the details about speed of bowlers and other details. Top 5 bowlers with maximum speed were to be identified by reading the records from there and using a formula.