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

SDE - 1

Optum
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started my coding journey on youtube, where I first learned the data structure and Algorithm. Then I started my preparation of Data Structure on the LinkedIn.
Application story
Company visited to your campus for the placement .
Why selected/rejected for the role?
I think I was rejected because I was not able to answer all the questions correctly under the given time of the interview
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds

01
Round
Easy
Video Call
Duration50 minutes
Interview date9 Sep 2022
Coding problem2

1. Sort An Array of 0s, 1s and 2s

Easy
10m average time
90% success
0/40
Asked in companies
DirectiZS AssociatesBNY Mellon

You have been given an array/list 'arr' consisting of 'n' elements.


Each element in the array is either 0, 1 or 2.


Sort this array/list in increasing order.


Do not make a new array/list. Make changes in the given array/list.


Example :
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]

Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]

Explanation: The array is sorted in increasing order.
Problem approach

You have been given an array/list ARR consisting of ‘N’ elements. Each element in the array is either 0, 1 or 2.
Now, your task is to sort this array/list in increasing order. For example, if ARR = [0, 2, 1, 1], then after sorting ARR must look like [0, 1, 1, 2].

Try solving now

2. Connect N Ropes With Minimum Cost

Easy
20m average time
80% success
0/40
Asked in companies
Paytm (One97 Communications Limited)OptumCisco

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.

The test-data is such that the result will fit into a 32-bit integer.

Problem approach

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.
The test-data is such that the result will fit into a 32-bit integer.

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date9 Sep 2022
Coding problem2

1. System Deisgn

Design a logging and analytics system which can support huge amount of load.

Problem approach

Tip 1 : Learn about time-series database
Tip 2 : Learn about message queues and use them in solution
Tip 3 : Explain how would you handle down time

2. 0 1 Knapsack

Moderate
0/80
Asked in companies
AmazonTwitterInnovaccer

A thief is robbing a store and can carry a maximum weight of ‘W’ into his knapsack. There are 'N' items available in the store and the weight and value of each item is known to the thief. Considering the constraints of the maximum weight that a knapsack can carry, you have to find the maximum profit that a thief can generate by stealing items.

Note: The thief is not allowed to break the items.

For example, N = 4, W = 10 and the weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4]. Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.

Problem approach

A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date9 Sep 2022
Coding problem1

1. Basic HR Questions

Describe your ideal company, location and job.

What are your career options right now?

Explain how you would be an asset to this organization?

What are your outside interests?

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 the index number of the last element of an array with 9 elements?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - 1
2 rounds | 7 problems
Interviewed by Optum
670 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by Optum
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Optum
583 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Optum
441 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
105287 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
50190 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
31267 views
6 comments
0 upvotes