Tip 1 : Practice as many questions as you can, and most importantly practice questions daily rather than doing bulk solving in end.
Tip 2 : Do some good projects, good means that the tech stack used in it should be advanced and make sure the project is not the common one that is made as a part of any online course.
Tip 3 : Have a good knowledge of CS fundamentals specifically OS and CN.
Tip 1 : Mention your projects and achievements, achievements mean when you have secured some good position, do not mention securing some 500 or so rank in a global contest.
Tip 2 : Do not brag and be yourself, you should put only those things in your resume for you can talk about clearly without much thinking and at which you are confident.
First-round was an online test, which comprised of MCQs related to cs- fundamentals (OS and CN), and were slightly on the tougher side, there was one section for output-based questions, where we were given the choice to select any two programming languages of our choice among C, C++, Java, and Python. And the last section consisted of one programming question.
Overall in the first section, the weightage of MCQs was higher because the coding question was allotted only 10 marks.



‘num’ does not have leading zeros except when ‘num’ equals zero.
Input: ‘num’ = ‘141’ , ‘k’ = 1.
Output: ‘11’
Explanation: By removing only 1 digit from ‘num’, 3 numbers can be formed: 14, 11, and 41. Out of which 11 is the smallest number.
You don’t have to print anything. It has already been taken care of. Just implement the given function.
Use a stack that you keep sorted ascendingly. You remove elements from it as long as you can still make it to n - k digits,
and your current element is smaller than the top of the stack:
The interviewer first asked me to introduce myself, and then she asked a few questions on my internship and then moved on to coding. The first question was given a database of books, I have to sort the books based on the number of pages and then arrange them in ascending order of title, and I had to do this using the concepts of OOP, the next question was to implement the L1, L2, L3 cache structure including the functionality of multilevel priority scheduling and LRU page replacement.
I was able to solve both the questions, then the interviewer asked me if I had any questions for her, and the round ended.
Given a database of books, you have to sort the books based on the number of pages and then arrange them in ascending order of title, and you have to do this using the concepts of OOP.
With the help of Classes and Objects
The Interviewer first asked me to introduce myself, then he started with basic DSA questions related to hashing, and then he asked me for the implementation of various sort algorithms, and also he asked me about the working of internal sort function in c++.
Then he moved on to CS fundamentals and dived deep into the concepts of OS and CN such as virtual memory, Post On System Test(POST), master boot record, disk scheduling algorithms, Process scheduling algorithms, functions of OS, Real-time OS, and Timesharing OS with examples, Demand Paging, the difference between 32-bit and 64-bit system, and the difference between word addressable and byte-addressable memory, what is a hub, the difference between router and gateway, what is static and dynamic IP, how the IP address changes in a network, functions of different layers of OSI model, what is UDP, and what happens when we type www.google.com, and the last question was on working of DNS and DHCP.
What is Master Boot record?, What is Post On System Test



‘N’ = 4, ‘K’ = 2
‘ARR’ = [1, 1, 2, 3]
There are ‘3’ subarrays with ‘2’ distinct elements, which are as follows: [1, 2], [2, 3], [1, 1, 2].
Thus, you should return ‘3’ as the answer.
Introduce yourself.
If stuck in some hypothetical situation what will you do, then he asked me how will you resolve conflict in your team.
Tell me about your projects.
Explain working of JVM.
Difference between Java and C++.

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