Optum Global Solutions Associate Software Engineer Interview Questions, Process, and Tips

Q1. IT HAD 2 CODING QUESTIONS. 1st One on string reversal 2nd one on Anagrams
Add your answer
Q2. Questions related to oops in java Sql query to find max of 2 coloumns
Add your answer

In interview they gave some coding questions..need to execute them

Q1. Questions on springboot rest services
Add your answer
Q2. Database questions
Add your answer

Basic questions were asked . 2 coding questions

Q1. Face to face round
Add your answer
Q2. Sorting techniques
Add your answer
Q3. Networking questions were asked
Add your answer

Q1. Basic questions about how one can handle work and relationship with other colleagues.
Add your answer

Mcqs related to oops, dbms, OS and aptitude plus one coding question of easy level

Q1. Technical and behavioural questions and general discussions
Add your answer

Q1. Projects and behavioural questions
Add your answer

Q1. Situational and HR discussions
Add your answer

Mcq questions on Mettle and coding

Q1. Core java and java related questions
Add your answer
Q2. SQL and RDMS like normalisation
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 Path in Ninjaland
Ninjaland consists of ‘N’ states and ‘M’ paths. Each path connecting two states can either be a normal path or a special path, each with its unique length. Your task is to find ...read more
Ans. 
Find the shortest distance between two states in Ninjaland with at most one special path.
• Use Dijkstra's algorithm to find the shortest path between two states.

• Keep track of the shortest path with at most one special path included.

• Consider both normal and special paths while calculating the shortest distance.

• Handle cases where multiple paths exist between two states.
Answered by AI
Add your answer
Q2. 
Minimum Direction Changes Problem Statement
Given a 2D grid with 'N' rows and 'M' columns, where each cell contains a character from the set { 'U', 'L', 'D', 'R' } indicating the allowed direction to move...read more
Ans. 
The problem involves finding the minimum number of direction changes needed to create a valid path from the top-left to the bottom-right corner of a 2D grid.
• Create a graph representation of the grid with directions as edges.

• Use a shortest path algorithm like Dijkstra or BFS to find the minimum number of changes needed.

• Handle edge cases like unreachable bottom-right corner or invalid input.

• Consider implementing a helper...read more
Answered by AI
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 Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
• Understand the constraints of the problem: N queens on an N x N chessboard, no two queens can threaten each other.

• Implement a backtracking algorithm to explore all possible configurations.

• Check for conflicts in rows, columns, and diagonals before placing a queen.

• Generate and print val...read more
Answered by AI
Add your answer
Q2. 
String Transformation Problem
Given a string (STR) of length N, you are tasked to create a new string through the following method:
Select the smallest character from the first K characters of STR, remov...read more
Ans. 
Given a string and an integer, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.
• Iterate through the input string, selecting the smallest character from the first K characters each time.

• Remove the selected character from the input string and append it to the new string.

• Continue this process until the input st...read more
Answered by AI
Add your 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. 
Find All Pairs Adding Up to Target
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 the Target.
Input:
The first line ...read more
Ans. 
Given an array of integers and a target, find all pairs of elements that add up to the target.
• Iterate through the array and for each element, check if the target minus the element exists in a hash set.

• If it exists, print the pair (element, target-element), otherwise add the element to the hash set.

• If no pair is found, print (-1, -1).
Answered by AI
Add your answer