Tip 1 : Prepare System Design
Tip 2 : Practice DSA Questions properly
Tip 3 : Practice OOPS and DBMS Concepts
Tip 1 : Your Resume should consist mainly of skills, projects, and achievements. Projects would play a crucial part in your interview and you should have at least one most relevant and good project that shows how strong your concepts are in development.
Tip 2 : The most important tip is that never lie on your resume If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.
The interviewer was very friendly. he asked some basic oops and os questions followed by project discussion and 2 DSA questions.



Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
we are able to store prefix sum already and then check with that.
So, with the help of an unordered map, we will store sum



As we can see 0 is not in the range [3, 6] so we delete this node from the ‘TREE’.
If the root->val is lower than the range, then return the right node because all nodes to the right are higher.
If the root->val is higher than the range, then return the left node because all nodes to the left are lower.
then recurse on node->left and node->right.
This round was taken by engineering manager completely a discussion-based round which started with my tech stack, projects, internship projects and work, then 2 dsa questions.



Merge Sort Algorithm -
Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.
It is compulsory to use the ‘Merge Sort’ algorithm.
a new vector and pushing back the elements to it as per both the pointers value this approch is very fast but it also got higher space complexity therefore use second approch for better space complexity



You can use any string of A multiple times.
A =[“coding”, ”ninjas”, “is”, “awesome”] target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Used single DP, where DP[i] means s[1:] can be constructed from words in wordDict
This was kind of a non eliminatory round just basic hr questions.
Why Netmeds?
What do you know about Netmeds?
Location, package discussion.
Tip 1 : Be Confident
Tip 2 : practice previously asked questions
Tip 3 : Be humble

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