i
Optum Global
Solutions
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Data abstraction in a DBMS involves hiding complex details from users, allowing them to interact with data at different levels of complexity.
Data abstraction in DBMS involves three levels: Physical level, Logical level, and View level.
Physical level deals with how data is stored on the storage medium, including details like data structures and file formats.
Logical level defines the structure of the database, inclu...
You are given an array A
of length N
consisting only of integers. Additionally, you are provided with three integers X
, Y
and SUM
. Your task is to count the number of pairs (i...
Count the number of pairs in an array that satisfy a given equation.
Iterate through all pairs of indices in the array and check if the equation is satisfied.
Use a hashmap to store the frequency of values that can be used to form pairs.
Optimize the solution by using two pointers approach to find pairs efficiently.
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 substrings...
Find the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
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 ...
Find the intersection of two integer arrays/lists in the order they appear in the first array/list.
Iterate through the elements of the first array/list and check if they exist in the second array/list.
Use a hash set to store elements of the first array/list for efficient lookups.
Print the common elements in the order they appear in the first array/list.
What people are saying about Optum Global Solutions
Given a structured list of books and their authors, format the information as specified.
The first line of input contains an integer ‘T' representing the number of test...
The task is to format a list of authors and their books in a specific way as per the given input format.
Parse the input to extract the number of test cases, number of authors, author names, and their respective books.
Format the output by printing the author names and their books in the specified format.
Ensure correct sequence and labeling of authors and books as per the example provided.
Handle multiple test cases ...
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 adjacent...
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.
Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.
If the graph has connected components, color ea...
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'.
The first line con...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
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 ...
Find the minimum number of days required to complete all tasks given specific completion days for each task.
Sort the tasks based on day1 in ascending order.
For each task, choose the minimum of day1 and day2 as the completion day.
Keep track of the maximum completion day for each task.
The final answer is the maximum completion day of all tasks.
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
The first line contains an integer 'T' re...
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
Implement the Bubble Sort algorithm to sort the array in place.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat this process until the array is sorted.
Time complexity of Bubble Sort is O(n^2) in the worst case.
Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, 8...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order to easily find the Kth largest element.
Ensure all elements in the array are distinct for accurate results.
Handle multiple test cases efficiently by iterating through each case.
Aptitude, core concepts and a code
I learned the importance of teamwork and collaboration from my college club.
Developed strong communication skills by working with diverse group of individuals
Learned how to delegate tasks effectively to achieve common goals
Gained experience in problem-solving and conflict resolution through group projects
I want to experience living in a different country and immersing myself in a new culture.
Traveling to a foreign country and learning about their customs and traditions
Trying new foods and experiencing different ways of life
Making friends with locals and exploring the local attractions
I applied via Campus Placement and was interviewed in Jan 2024. There were 2 interview rounds.
Technical round was really good
Binary search is a search algorithm that finds the position of a target value within a sorted array.
Divide and conquer approach
Compares target value with middle element of array
If target value is smaller, search left half; if larger, search right half
Repeat process until target value is found or subarray is empty
A linked list is a data structure consisting of nodes where each node contains a data field and a reference to the next node in the sequence.
Linked list elements are not stored in contiguous memory locations like arrays.
Each node in a linked list contains data and a reference to the next node.
Linked lists can be singly linked (each node points to the next node) or doubly linked (each node points to both the next and pr...
An index in SQL Server is a database object that improves the speed of data retrieval operations on a table.
Indexes are similar to a book's index, allowing quick access to data without scanning the entire table.
There are two main types of indexes: clustered and non-clustered. A clustered index determines the physical order of data.
Example of a clustered index: If a table has a primary key, SQL Server automatically crea...
Interface is a contract with no implementation, while abstract class can have some implementation.
Interface cannot have any implementation, only method signatures.
Abstract class can have both abstract methods and concrete methods.
A class can implement multiple interfaces but can only inherit from one abstract class.
Interfaces are used to achieve multiple inheritance in Java.
Example: interface Shape { void draw(); } abs...
Basic aptitude number theory
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Jan 2024. There were 3 interview rounds.
Aptitude test of 1hr, logical reasoning and dat interpretation questions were asked of intermediate difficulty
2 basic coding questions in 30mins
Some of the top questions asked at the Optum Global Solutions Software Developer interview -
The duration of Optum Global Solutions Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 19 interview experiences
Difficulty level
Duration
based on 52 reviews
Rating in categories
Claims Associate
4.1k
salaries
| ₹2 L/yr - ₹5.1 L/yr |
Senior Software Engineer
3.3k
salaries
| ₹15.8 L/yr - ₹26 L/yr |
Software Engineer
2.8k
salaries
| ₹6.5 L/yr - ₹24 L/yr |
Medical Coder
1.7k
salaries
| ₹1.1 L/yr - ₹6.5 L/yr |
Senior Claims Associate
1.2k
salaries
| ₹2.6 L/yr - ₹5.9 L/yr |
Accenture
Wipro
Cognizant
Capgemini