Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Milkbasket interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Milkbasket
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I participated actively in our college in various coding competitions and practised a lot of Questions on various competitive programming sites. Although I got placed very early during college time so was not allowed in other companies so kept working hard for various off-campus opportunities available.
Application story
Milkbasket visited our campus for hiring. I applied for it passed the preliminary test and moved to the interview rounds.
Why selected/rejected for the role?
Rejected, they had a fixed number to take so maybe they found some better resource that met their company requirements.
Preparation
Duration: 8 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Computer Networking, Object Oriented Programming, ML
Tip
Tip

Tip 1: Never leave any topic from any chapter/subject.

Tip 2: Learn to explain your thoughts well.

Tip 3: Learn from previous experiences/interviews/problems asked.

Tip 4: Include at least four projects on your resume.

Application process
Where: Campus
Eligibility: CGPA 6.00 and above with no active backlog(s) and pursuing a regular semester.
Resume Tip
Resume tip

Tip 1: Include at least four projects on your resume. 

Tip 2: Do not write false information. You will always get caught. Be genuine.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date9 May 2022
Coding problem2

Simple DSA round taken by a very supportive interviewer. He asked about two DSA problems.

1. Maximum Product Subarray

Moderate
25m average time
75% success
0/80
Asked in companies
WalmartInnovaccerAmazon

You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report this maximum product.

View more
Problem approach

The code defines a function named maxSubarrayProduct that takes an integer array A and its size n as arguments.
It initializes a variable r with the first element of the array A. This variable will store the maximum subarray product found so far.
The function then enters a loop that starts from the second element of the array A and goes up to the last element.
Inside the loop, the func...

View more
Try solving now

2. Reverse Linked List

Moderate
15m average time
85% success
0/80
Asked in companies
CognizantMicrosoftSAP Labs

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:
The given linked list is 1 -> 2 ->...
View more
Problem approach

Initialize three pointers prev as NULL, curr as head, and next as NULL.
Iterate through the linked list. In a loop, do the following:
Before changing the next of curr, store the next node 
next = curr -> next
Now update the next pointer of curr to the prev 
curr -> next = prev 
Update prev as curr and curr as next 
prev = curr 
curr = next<...

View more
Try solving now
02
Round
Medium
Video Call
Duration80 minutes
Interview date10 May 2022
Coding problem2

This was a round to test your JAVA knowledge as I applied for this role. He asked me a lot of questions on JAVA and my past projects followed by 2 DSA questions.

1. Chocolate Problem

Moderate
15m average time
85% success
0/80
Asked in companies
AdobePaytm (One97 Communications Limited)JP Morgan

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/li...

View more
Problem approach

Initially sort the given array. Declare a variable to store the minimum difference, and initialize it to INT_MAX. Let the variable be min_diff.
Find the subarray of size m such that the difference between the last (maximum in case of sorted) and first (minimum in case of sorted) elements of the subarray is minimum.
We will run a loop from 0 to (n-m), where n is the size of the given array...

View more
Try solving now

2. Next Greater Element

Easy
10m average time
90% success
0/40
Asked in companies
DunzoCiscoIBM

You are given an array 'a' of size 'n'.



View more
Problem approach

Push the first element to stack.
Pick the rest of the elements one by one and follow the following steps in the loop. 
Mark the current element as next.
If the stack is not empty, compare top most element of the stack with the next.
If next is greater than the top element, Pop the element from the stack. next is the next greater element for the popped element.
Keep popping f...

View more
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Is method overloading possible by changing the return type?

Start a Discussion
Similar interview experiences
Product Intern
6 rounds | 9 problems
Interviewed by Squadstack
0 views
0 comments
0 upvotes
Business Technology Analyst
4 rounds | 5 problems
Interviewed by Squadstack
2007 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by Sterlite Technologies Limited
1792 views
0 comments
0 upvotes
Product Engineer
3 rounds | 5 problems
Interviewed by Squadstack
1156 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
101640 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
47692 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
29910 views
6 comments
0 upvotes