Tip 1 : learn most of the useful data structures and algorithms and core subjects first and you can use gfg, coding ninjas and articals for that.
Tip 2 : practice most of the time in Leetcode, codechef, coding ninjas, gfg.
Tip 3 : practice more and more.
Tip 1 : keep everything true and simple
Tip 2 : add good projects, at least 2 and one of them must be in the tech you are applying for.
What is polymorphism?
Difference between abstraction and inheritance?
What is a virtual function?
This round had 2 DSA questions and uncountable oops questions. They also asked me about my project mentioned in the CV.


The width of each bar is the same and is equal to 1.
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:

You don't need to print anything. It has already been taken care of. Just implement the given function.



Can you solve this using not more than O(S) extra space, where S is the sum of all elements of the given array?
Just HR things
Why do you want to join our company?
What excites you most in a software engineering career?
What are your achievements?

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