i
Optum Global Solutions
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
Two questions and aptitude questions
Two data structures and algorithms questions
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
Small aptitude questions only and a hackerank code
Object-oriented programming concepts that help in organizing and structuring code.
Encapsulation: bundling data and methods together in a class
Inheritance: creating new classes from existing ones
Polymorphism: using a single interface to represent different types
Abstraction: hiding unnecessary details and exposing only essential features
The Fibonacci program generates the Fibonacci sequence. Quick sort has a complexity of O(n log n).
The Fibonacci program can be implemented using recursion or iteration.
Quick sort has an average and best case complexity of O(n log n), but worst case complexity of O(n^2).
I would prefer quick sort for its efficiency in most cases.
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
What people are saying about Optum Global Solutions
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Apr 2021. There were 3 interview rounds.
Coding on java ,spring , hibernate
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Amcat and was interviewed before Jul 2021. There were 2 interview rounds.
Refer R S Agarwal book for apptitude
A C program to perform arithmetic operations on fractional numbers.
Use float or double data type to store fractional numbers.
Use scanf() to take input from the user.
Perform arithmetic operations like addition, subtraction, multiplication, and division.
Use printf() to display the result.
based on 2 interviews
Interview experience
based on 13 reviews
Rating in categories
Claims Associate
4.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
2.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
2.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Medical Coder
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Claims Associate
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Cognizant
Accenture
IBM
TCS