Optum interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Optum
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 8 months
Topics: Data Structures, Algorithms, Language(CPP), Aptitude, SQL
Tip 1 : You must know at least one language thoroughly.
Tip 2 : Data Structures and Algorithms are must. If in interview the best possible solution is through DP and you have no idea about it then try to solve it in less efficient method like greedy algorithm. Similarly for eg:- for tree question if you are not good with LinkedList then try to solve the solution with Array
Tip 3 : You must know about the background of the company you are applying to.
Application process
Where: Campus
Eligibility: Above 8 CGPA
Tip 1: Show off your skills through certificates and courses
Tip 2: "About Me" and "Projects" is the highlight of resume
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date1 Jun 2021
Coding problem1
It happened online at around 9 am in the morning and duration was 1 hour. It had 50 MCQ and 1 coding question . MCQ’s were based on Computer Science Fundamentals and aptitude. The coding question was based on Array.
1. Longest Consecutive Sequence
Moderate
40m average time
70% success
0/80
Asked in companies
You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence is in the form ['NUM', 'NUM' + 1, 'NUM' + 2, ..., 'NUM' + L] where 'NUM' is the starting integer of the sequence and 'L' + 1 is the length of the sequence.
Note:
If there are any duplicates in the given array we will count only one of them in the consecutive sequence.
For example-
For the given 'ARR' [9,5,4,9,10,10,6].
Output = 3
The longest consecutive sequence is [4,5,6].
Follow Up:
Can you solve this in O(N) time and O(N) space complexity?
Problem approach
We will use hashset and first input all the elements in it and then now 1 traverse in array and check is that element exist less than a[i] if yes continue if not exist then start counting from it and check in sequence a[i] then a[i+1] ….. and increasing counter and at last return
02
Round
Medium
Face to Face
Duration120 minutes
Interview date15 Jun 2021
Coding problem2
It was both Technical and Managerial round. The Interviewer was really friendly. It started with normal conversation like tell me about yourself, where you based, who all are in family, your strengths and weakness. Then he asked me what I do in my free time. After which he discussed my projects and previous internships. Then he asked 2 problems of which one is coding and other is problem solving. The interview went well and they were happy from my response.
1. Closest Sum
Moderate
30m average time
70% success
0/80
Asked in companies
Given an array 'ARR'' of 'N' integers and an integer 'target', your task is to find three integers in 'ARR' such that the sum is closest to the target.
Note
In the case of two closest sums, print the smallest sum.
Problem approach
1) Sort the given array.
2) Loop over the array and fix the first element of the possible triplet, Arr[i].
3) Then fix two pointers, one at i+1 and the other at N-1. Now consider the sum Arr[i+1] + Arr[n-1],
- If the sum is smaller than target - Arr[i], we increase the first pointer.
- Else, if the sum is greater than target - Arr[i], decrease the end pointer to reduce the sum.
- Update the closest sum found so far.
2. Puzzle
Statement:
The game of Tic-Tac-Toe is being played between two players and it is in below state after six moves.
Can you answer following questions?
- Who will win the game, O or X?
- Which was the sixth mark and at which position?
Assume that both the players are intelligent enough.
Problem approach
The 7th mark must be placed in square 5 which is the win situation for both X and O. Hence, the 6th mark must be placed in a line already containing two of the opponents marks. There are two such possibilities – the 6th mark would have been either O in square 7 or X in square 9.
As we know both the players are intelligent enough, the 6th mark could not be O in square 7. Instead, he would have placed O in square 5 and would have won.
Hence, the sixth mark must be X placed in square 9. And the seventh mark will be O. Thus O will win the game.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 4 problems
Interviewed by Optum
Selected 
1393 views
1 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Optum
Selected 995 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Optum
Selected 849 views
0 comments
0 upvotes
Software Engineer
3 rounds | 8 problems
Interviewed by Optum
Rejected
750 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 10148 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4448 views
1 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Amazon
Selected 3674 views
0 comments
0 upvotes