UnitedHealth Associate Software Engineer Interview Questions and Answers

Q1. Coding questions related to DSA
Add your answer
Q2. Middle of the Linked list
Ans. 
Finding the middle node of a linked list.
• Traverse the linked list with two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes.

• In that case, choose either of the middle nodes as the result.
Answered by AI
Add your answer
Q3. Reverse words in a sentence
Ans. 
Reverse words in a sentence
• Split the sentence into words

• Reverse the order of the words

• Join the words back into a sentence
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Timing : Afternoon(Around 12 Pm)
The interviewer started with his Introduction and later asked 2 DSA Questions.

Q1. Shortest Distance
Ninjaland is a country consisting of ‘N’ states and ‘M’ paths. There are two types of paths that connect any two states. One is the normal path, and the other is a special path. Both path...read more
Ans. 
1)First calculate how many steps you need to travel on the x-axis to reach the destination
2)Then calculate how many steps you need to travel on the y-axis to reach the destination
3)Add the no of steps you got from step1 and step2.
Answered by CodingNinjas
View 1 more answer
Q2.  Minimum Direction Changes
Given a 2D grid having N Rows and M Columns. Each cell of the grid has a character among [ 'U', 'L', 'D', 'R' ] written on it, denoting Up, Left, ...read more
Ans. Graph based Solution
As we know if we change the direction of a cell to any other neighbour to move from cell to its neighbour, then it will cost 1 change, and if we follow the given cell direction then it will cost 0 as we follow the same direction which is given. So now we can see that we have 4 choices at each cell to move to its neighbour by cost 1 or 0, and we can also say that if we make this choice as an edge i.e...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing : Afternoon(Around 10 Am)
The interviewer started with his Introduction and later asked 2 DSA Questions.
1)Questions based on N-QUEEN 
2)Questions based on String Manipulation

Q1. N Queens
You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.
A ...read more
Ans. Backtracking
1. Instead of checking all the places on the chessboard, we can use backtracking and place queen row-wise or column-wise.
2. Suppose we place queens row-wise, and we start with the very first row. Place the queen and move to the next row until either there is a solution or there are no viable cells left.
3. As we backtrack, check to place the queen in the different columns of the same row.
4. When we can place a queen at ...read more
Answered by CodingNinjas
View 1 more answer
Q2. String Transformation
Given a string (STR) of length N, you have to create a new string by performing the following operation:
Take the smallest character from the first 'K' characters of STR, re...read more
Ans. Brute Force Approach
• Create a new “answer” string that will contain the modified string
• While the input string's length is greater than 0
  • Find the minimum character in the first K characters of the string (or the entire string if its length is less than K)
  • Append that character to the “answer” string
  • Remove that character from the input string
• Return the “answer” string
Space Complexity: O(1)Explanation:
O(1)
 
Since we ar...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Medium

Timing : Afternoon(Around 1 Pm)
The interviewer started with his Introduction and later asked 2 DSA Questions and CS fundamentals.
1)DSA Question : 2 sum(Leetcode)
2)Questions based on String Manipulation
3)MySQL Queries
4)OOPS concepts

Q1. Two Sum
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use th...read more
Ans. 
1)Brute force : using 2 iterations(TC : O(N**2) , SC : O(1))
2)Optimized way : Using an extra space like a dictionary.(TC : O(N) , SC : O(N))
Answered by CodingNinjas
View 1 more answer

It was basic coding questions

Q1. Basic details were asked
Add your answer
Q2. Give me your intro
Add your answer
Q3. Why do you want to join
Add your answer
Q4. Some team discussion questions
Add your answer
Q5. When can you join
Add your answer