Optum interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Optum
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures and Algorithms, Object-Oriented Programming System, Operating system, Database Management System
Try to do Data Structures and Algorithms based questions and firstly attempt it yourself before going to the solution, also try to do it as quickly as you can. Also prepare for theory subjects like Operating system, Database Management System, etc which I prepared through Coding Ninjas subjective notes and they are very accurate and up to mark.
Application process
Where: Referral
Eligibility: Above 7 CGPA
Keep your resume simple and complete. Mention some good level projects, your previous experiences and coding achievements if any.
Interview rounds
01
Round
Easy
Video Call
Duration45 Minutes
Interview date12 Sep 2021
Coding problem2
1. Longest common subsequence
Moderate
39m average time
0/80
Asked in companies
Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.
For a string 'str'(per se) of length K, the subsequences are the strings containing characters in the same relative order as they are present in 'str,' but not necessarily contiguous. Subsequences contain all the strings of length varying from 0 to K.
Example :
Subsequences of string "abc" are: ""(empty string), a, b, c, ab, bc, ac, abc.
Problem approach
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.
2. Rearrange Linked List
Moderate
22m average time
80% success
0/80
Asked in companies
You have been given a singly Linked List in the form of 'L1' -> 'L2' -> 'L3' -> ... 'Ln'. Your task is to rearrange the nodes of this list to make it in the form of 'L1' -> 'Ln' -> 'L2' -> 'Ln-1' and so on. You are not allowed to alter the data of the nodes of the given linked list.
For example:
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.
Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL.
Problem approach
You have been given a singly Linked List in the form of 'L1' -> 'L2' -> 'L3' -> ... 'Ln'. Your task is to rearrange the nodes of this list to make it in the form of 'L1' -> 'Ln' -> 'L2' -> 'Ln-1' and so on. You are not allowed to alter the data of the nodes of the given linked list.
02
Round
Medium
Video Call
Duration45 Minutes
Interview date12 Sep 2021
Coding problem2
1. Kth largest element in the unsorted array
Moderate
10m average time
90% success
0/80
Asked in companies
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
Example:
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
Note:
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order.
2) All the elements of the array are pairwise distinct.
Problem approach
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
Example:
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
2. DBMS Question
5th highest salary in a list of salaries.
Problem approach
select * from(
select ename, sal, dense_rank()
over(order by sal desc)r from Employee)
where r=&5;
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
SDE - 1
2 rounds | 7 problems
Interviewed by Optum
Selected 
1449 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by Optum
Selected 0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Optum
Rejected
945 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Optum
Rejected
834 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes