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



Let S = “abdd” and X = “bd”.
The windows in S which contain all the characters in X are: 'abdd', 'abd', 'bdd', 'bd'.
Out of these, the smallest substring in S which contains all the characters present in X is 'bd'.
All the other substring have a length larger than 'bd'.
Can be solved via a sliding window approach



If the given list is (1 -> -2 -> 0 -> 4) and N=2:

Then the 2nd node from the end is 0.
it can be solved by counting number of elements in linked list or by slow pointer fast pointer approach
Design Netflix.
Tip 1 : Practice HLD and LLD on some commonly asked designs
Tip 2 : You should know about basics like Caching, CAP Theorem

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