Tip 1 : Strengthen DSA skills initially, know the basics and understand the working of different data structures
Tip 2 : Solve atleast 300 Questions from websites like leetcode and Hackerrank
Tip 3 : Learn to implement them and enhance your coding skills. Make mistakes and learn from them instead of just cramming everything before practicing.
Tip 4 : To enhance coding skills, try your best to crack a question instead of giving up and looking at the solution..this will improve your problem-solving skills.
Tip 5 : It's a must to do the standard coding questions under every category of data structure and algorithms
Tip 6 : To study the topics and practice coding questions refer to GeeksforGeeks and regularly take part in coding contests.
Tip 7 : Be thorough with OOPs, DBMS, and the technologies on which you have worked for the interview.
Tip 8 : Have at least 2 projects in your resume and make sure you can answer the questions related to them.
Tip 9 : For HR interviews prepare questions, prepare questions such as introduce yourself, your strengths, your weakness.
Confidence is the key you need to be an expert in. I was not aware of some things the interviewer asked during my interviews. But due to my confidence, he skipped that part.
Tip 10 : Do all the questions from the book 'cracking the coding interview'
Tip 1 : Make sure your resume fits everything into a single page.
Tip 2 : Have at least 2 projects on your resume.
Tip 3 : Only Mention only those technical skills that you are confident in. Do not put false things on your resume.
Tip 4 : Mention the work you have done during your internships.
Tip 5 : Include an objective in your resume.
The complete test was Audio and Video Proctored.
The test was divided into 3 sections:
1) Aptitude: (14 MCQs in 28 minutes)
2) Technical: (12 MCQs in 17 minutes)
3) coding: (2 questions - first in 20 minutes, second in 30 minutes)
Given ‘N’ = 4 and ‘ARR’ = [1, 1, 2, 2].
The answer will be 2, i.e., if we chose that all buckets should have 1 unit of water, we will have to throw 1 unit of water from buckets 3 and 4. Hence 2.
For the given binary tree: [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
Start Node: 3
1
/ \
2 3
/ \
4 5
Output: 2
Explanation :
In the zeroth minute, Node 3 will start to burn.
After one minute, Nodes (1, 4, 5) that are adjacent to 3 will burn completely.
After two minutes, the only remaining Node 2 will be burnt and there will be no nodes remaining in the binary tree.
So, the whole tree will burn in 2 minutes.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you create a function in JavaScript?