Optum Global Solutions Software Developer Interview Questions, Process, and Tips

Q1. What is the difference between obj open and obj open by handle
Ans. 
obj open vs obj open by handle
• obj open opens a file and returns a file object

• obj open by handle opens a file using a file descriptor

• obj open by handle is faster than obj open

• obj open by handle is used when you already have a file descriptor
Answered by AI
Add your answer
Q2. How to change the work object status of the multiple cases from pending to closed.
Ans. 
To change work object status of multiple cases from pending to closed.
• Identify the cases that need to be closed

• Update the status of each case to closed

• Save the changes made to the cases

• Use a loop to perform the above steps for multiple cases

• Example: Use a query to identify all cases with pending status and update their status to closed
Answered by AI
Add your answer
Q3. Why blocked rules are carry forward
Ans. 
Blocked rules are carry forward to ensure consistency and prevent errors in future processing.
• Blocked rules are rules that have been prevented from executing due to certain conditions not being met.

• These rules are carried forward to ensure that they are not missed in future processing.

• This helps to maintain consistency and prevent errors in the system.

• For example, if a rule is blocked due to a missing data field, it wi...read more
Answered by AI
Add your answer
Q4. What is the use of previliges
Ans. 
Privileges are permissions granted to users or processes to perform specific actions or access certain resources.
• Privileges are used to control access to sensitive data or critical system resources.

• They can be assigned to individual users or groups.

• Examples include read, write, execute, and delete permissions.

• Privileges can also be used to restrict access to certain functions or features within an application.

• Without p...read more
Answered by AI
Add your answer
Q5. Last Project related questions
Add your answer
Q6. SLA related questions
Add your answer
Q7. Queue processor and job schedule difference
Ans. 
Queue processor manages tasks in a queue while job scheduler schedules tasks based on time or event triggers.
• Queue processor manages tasks in a queue and processes them in a first-in, first-out (FIFO) order.

• Job scheduler schedules tasks based on time or event triggers, and can prioritize tasks based on their importance.

• Queue processor is typically used for real-time processing of tasks, while job scheduler is used for ...read more
Answered by AI
Add your answer
Q8. Difference between append to and append to map to
Ans. 
Append to adds an element to a list while append to map adds a key-value pair to a map.
• Append to is used for lists while append to map is used for maps.

• Append to adds an element to the end of the list while append to map adds a key-value pair to the map.

• Append to map can also update the value of an existing key in the map.
Answered by AI
Add your answer
Q9. Use of superclass data transform check box
Ans. 
Superclass data transform checkbox is used to inherit data transform rules from a parent class.
• When checked, the subclass will inherit the data transform rules from the superclass

• This can save time and effort in creating duplicate data transform rules

• Example: A superclass has a data transform rule to convert a date format, when the checkbox is checked in a subclass, it will also use the same rule

• This checkbox is availa
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was around 4 pm in the evening and it includes both MCQs and coding questions. Hackerrank platform was user friendly and good.

Q1. 
Maximum XOR Problem Statement
You are given an integer X. Your goal is to find an integer Y such that the bitwise XOR of X and Y yields the maximum possible value. The integer Y must not exceed 2305843009...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

30-40 minutes interview round.

Q1. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Add your answer
Q2. How can you measure 9 minutes using only a 4-minute hourglass and a 7-minute hourglass?
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Resume based round and some technical concepts were asked

Q1. How can you find the 5th highest salary in a list of salaries using a SQL query?
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Easiest of all was the HR round.

Round duration - 75 minutes
Round difficulty - Medium

Q1. 
Array Intersection Problem Statement
Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Round duration - 75 min
Round difficulty - Medium

This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.

Q1. 
Minimum Days to Complete Work
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1 and day2.
For each task i, day1[i] represents the earliest...read more
Ans. 
It is a simple iteration problem.
Answered Anonymously
Add your answer

Round duration - 30 min
Round difficulty - Easy

This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.

Q1. 
Bubble Sort Problem Statement
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
Input:
The first line contains an integer 'T' r...read more
Ans. 
Just applied the normal bubble sort algorithm. It is very easy and simple.
Answered Anonymously
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

Q1. 
Author and Books Formatting
Given a structured list of books and their authors, format the information as specified.
Input:
The first line of input contains an integer ‘T' representing the number of tes...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Add your answer