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

Optum

2 rounds | 5 Coding
problems

Journey

When I joined college, I was unaware of this Data Structure and Algorithm, which made my journey to getting an internship way more complicated. From that point, I started doing questions on leetcode and code studio.

Application story

This company visited to my campus for the placement where i applied for it .

Why selected/rejected for the role?

I was rejected because i was not able to provide a good approach to the DSA question which are being asked

Preparation

Duration: 6 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Practice from Leetcode, solve Leetcode medium level problems.

Tip 2 : Brush up computer fundamentals from subjects like OS, DBMS and CN.

Tip 3 : Have a good project or good internship experience and have in-depth knowledge regarding what you have done.

Application process

Where: Campus

Eligibility: Above 6 CGPA

Resume tip

Tip 1 : Have some projects on resume.

Tip 2 : Do not put false things on resume.

01

Round

Medium

Video Call

Duration60 minutes

Interview date23 Sep 2022

Coding problem2

```
Input: Consider the following Binary Tree:
```

```
Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]
```

Problem approach

Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left for the next level and then again left to right and so on in an alternate manner.

```
1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
4. If no such index is present in the array, return -1.
```

Problem approach

You are given an array Arr consisting of N integers. You need to find the equilibrium index of the array.

An index is considered as an equilibrium index if the sum of elements of the array to the left of that index is equal to the sum of elements to the right of it.

02

Round

Easy

Video Call

Duration60 minutes

Interview date23 Sep 2022

Coding problem3

```
The start time of one chosen meeting can’t be equal to the end time of the other chosen meeting.
```

```
'N' = 3, Start = [1, 3, 6], End = [4, 8, 7].
You can organize a maximum of 2 meetings. Meeting number 1 from 1 to 4, Meeting number 3 from 6 to 7.
```

Problem approach

You are given the schedule of N meetings with their start time Start[i] and end time End[i]. But you have only 1 meeting room. So, you need to tell the meeting numbers you can organize in the given room, such that the number of meetings organized is maximum.

```
If ‘ARR’ is {1,2,3,4} and ‘K’ = 4, then there exists 2 subsets with sum = 4. These are {1,3} and {4}. Hence, return true.
```

```
The leaderboard scores are in descending order.
The game scores are given in ascending order.
```

Problem approach

Given a leaderboard of a game with the following ranking pattern:

The player with the highest score is ranked number 1 on the leaderboard.

Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

Here's your problem of the day

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

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

SDE - 1

2 rounds | 7 problems

Interviewed by Optum

670 views

0 comments

0 upvotes

SDE - 1

2 rounds | 2 problems

Interviewed by Optum

0 views

0 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by Optum

583 views

0 comments

0 upvotes

SDE - 1

3 rounds | 3 problems

Interviewed by Optum

441 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

105287 views

24 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

50190 views

5 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

31267 views

6 comments

0 upvotes