Tip 1: Practice at least 300 Leetcode's most frequently asked Questions on every topic including array, LinkedList, stack, Tree, and dynamic programming.
Tip 2: In every screening test there is atleast one dynamic programming question will be there, so do Atleast one question daily on dynamic programming.
Tip 3: Be consistent for 4-6 months. When you feel your coding is improved do Atleast 2-3 good projects using Latest tech stack (Nodejs/angular/react/Django)
Tip 4: Start reading computer science fundamental subjects like (Computer Network, DBMS, and Operating systems). Many Product based companies like oracle, cisco, Microsoft, and Google asked these subjects in interviews.
Tip 5: Prepare oops concepts, and puzzles from geeks for geeks.
Tip 7: When you're shortlisted for a particular company do read the interview experience for that particular company before interview.
Tip 1: Write 2-3 good projects in your resume (Write those in which you're good to explain things)
Tip 2: Don't write any fake internship experience, write CGPA in bold and write your achievements like any hackathon winner, class topper, Jee rank, etc.
Round 1: Timing is from 11:30-1:00 PM
The interviewer asked me about the projects that I wrote in my resume, Questions on the oops concept like what is the final block, the differences between java and c, other oops concepts, DBMS concurrency control, and os Memory Management.



If the given input string is "Welcome to Coding Ninjas", then you should return "Ninjas Coding to Welcome" as the reversed string has only a single space between two words and there is no leading or trailing space.
First, I split the given string using a space (" ") delimiter and then store the results in array of strings. Used StringBuilder to append the string at the end by traversing the result string from the end.
Round2: The timing for this round is 2-3:30 PM
I solved the puzzle after some time so he modified the puzzle (Instead of 1 faulty jar there are two faulty jars now how will u find it?)
Later he asked me about my projects, cryptography, DBMS(concurrency control, os )



The numeric value of ‘a’ is 1, ‘b’ is 2.
The numeric value of “bde” is 2 + 4 + 5, i.e. 11.
If 'N' = 3 and 'V' = 10, you need to construct string as “aah".
First, I applied the brute force approach:
Generated all the substring of string1 and check whether all the characters of string2 exist in the substring of s1. if all characters exist then compare the min_length( store length of substring which contains all characters of string 2) with a length of substring and if min_length> length of substring then update the min_length.
The interviewer agreed to this approach and asked me to improve this solution. Later I optimized it by using the sliding window technique and did the same problem in o(string_length).
Find the jar with contaminated pills.
Round 3: The interviewer asked me about the core concept of DBMS, OS. This round is held from 4-5 pm. In all rounds the interviewers are very supportive and will help you to think/solve the coding problem from Naive approach to optimized one.
What are ACID Properties?
What are processes and threads?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?