UnitedHealth Software Developer Intern Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

The timings of the 1st round were 11 am to 12 noon. It was a proctored online test using a friendly hackerrank platform to conduct the test. The test was smooth and went well. There were questions from different sections.

Q1. 
Maximize Stock Trading Profit
You are given an array prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...read more
Ans. 
Initially I used many techniques but was not able to get satisfactory results. Then I used the dynamic programming approach to solve this.
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Involved solving coding questions basic interaction and some questions from oops and my resume

Q1. 
Copy and Reverse the Array
Given an array of non-negative integers ARR, your task is to create another array COPY_ARR with the elements of ARR in reverse order.
Input:
The first line contains an integer T ...read more
Ans. 
I reversed the array using loop and then copied its content and then printed the contents of new array
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

It was like an interaction round between the technical manager and us.

Q1. What are the differences between fragmentation and segmentation in operating systems?
Ans. 
Tip 1 : study for concepts thorougly
 
Answered Anonymously
Add your answer
Q2. What are some SQL queries and JOIN operations you have worked with in your database management projects?
Ans. 
Tip 1 : practice sql queries
 
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

There were 30 MCQ questions and 2 coding problems. The MCQs were medium-level questions. Coding problems were fairly easy.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
1.) Maintained a 'prev' pointer and 'temp' pointer.
2.) Iterated the list and saved the next pointer of the current node as temp and assigned current->next = prev and then, prev = current, this is the general approach for reversing the list.
3.) Returned prev
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

The interview was scheduled by the placement cell in the evening. The interviewer seemed to be an experienced developer.
He asked me general background questions like what are you interested most in? what are your technical interests? etc.
He then asked me about my project. Explained him well on that front and he seemed satisfied. He asked me to find the Lowest Common Ancestor of a given Binary Search Tree. I solved it in around 20-30 minutes and he finally asked me to write the solution on paper. He asked some practical OOPs problems for a while and I answered correctly but the explanations could be more thorough.

Q1. 
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...read more
Ans. 
This problem was alien to me at that time. But, I was familiar with BST. Solved the problems using 'parent' pointers first.
Then, came up with the following recursive idea.

function signature: LCA(Node* root , int n1, int n2)

1.) If the current root is NULL, return NULL.
2.) If root->val> n1 && root->val > n2:
return LCA(root->left , n1 , n2)
3.) If root->val < n1 && root->val < n2
r...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interview was some 30 minutes after the technical round. The HR asked me general questions like my hobbies, technical and non-technical things in my resume, my interests, etc. The overall communication was very friendly.