Netmeds interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Netmeds
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 months
Topics: OOPS, System Design, Algorithms, Data Structures, DBMS
Tip
Tip

Tip 1 : Prepare System Design
Tip 2 : Practice DSA Questions properly
Tip 3 : Practice OOPS and DBMS Concepts

Application process
Where: Referral
Eligibility: Above 6.5 CGPA
Resume Tip
Resume tip

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.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date24 Jan 2022
Coding problem2

The interviewer was very friendly. he asked some basic oops and os questions followed by project discussion and 2 DSA questions.

1. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
HCL TechnologiesInformaticaSamsung

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
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].
Problem approach

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

Try solving now

2. Modify BST

Moderate
20m average time
80% success
0/80
Asked in companies
MicrosoftAppleNetmeds

You are given the root of a binary search tree ‘TREE’ and the lowest and highest boundaries as ‘LOW’ and ‘HIGH’. Your task is to modify the tree so that all its nodes have values in the range [‘LOW’, ‘HIGH’] inclusive.

Modifying the tree should not change the relative structure of the nodes that will remain in the tree (i.e., any node's descendant should remain a descendant). There will always be a unique answer.

Note that the root may change depending on the given bounds.

For example: For ‘LOW’ = 3 and ‘HIGH’ = 6 see the below picture for reference:

img

As we can see 0 is not in the range [3, 6] so we delete this node from the ‘TREE’.
Problem approach

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.

Try solving now
02
Round
Medium
Video Call
Duration75 minutes
Interview date25 Jan 2022
Coding problem2

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.

1. Merge Sort

Easy
15m average time
85% success
0/40
Asked in companies
Media.netHewlett Packard EnterpriseIBM

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

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.

subsequence

The above illustrates shows how merge sort works.
Note :
It is compulsory to use the ‘Merge Sort’ algorithm.
Problem approach

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

Try solving now

2. Word Break

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitExpedia GroupWalmart

You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

Note :
You can use any string of A multiple times.
Examples :
A =[“coding”, ”ninjas”, “is”, “awesome”]  target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Problem approach

Used single DP, where DP[i] means s[1:] can be constructed from words in wordDict

Try solving now
03
Round
Easy
HR Round
Duration15 minutes
Interview date28 Jan 2022
Coding problem1

This was kind of a non eliminatory round just basic hr questions.

1. Basic HR Questions

Why Netmeds?
What do you know about Netmeds?
Location, package discussion.

Problem approach

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes