Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round
Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack
used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on
skillset only



If the given arrays are [1, 2, 3] and [1, 2] then you need to return true as ARR2 is a subset of ARR1, but if the given arrays are [1, 2, 3] and [1, 2, 2] then you need to return false since ARR2 is not a subset of ARR1.
Cab be easily solved using hashing. store all elements of a1 in the map. now iterate a2 and check if the element is present in the map or not. if all elements are present than it is a subset otherwise not




What are a process and process table?
What are the different states of the process?
What are the different scheduling algorithms? Explain in brief each one of them
What is virtual memory?
What is the time-sharing system?
Tip 1: You have to focus on CS Fundamentals - OS, OOPS, DBMS, CN
What is a transaction?
What are ACID properties?
What are indexes?
What are clustered and non-clustered Indexes?
What is Denormalization?

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