Optum Java Developer Interview Questions and Answers

Q1. Oops related insharitance encapsulation
Add your answer

Q1. Basic introduction and soo on.
Add your answer

Question related to profile.

Aptitude test questions

Convert Number to words

Q1. SOLID principles with real time examples
Ans. 
SOLID principles are a set of guidelines for writing maintainable and scalable code.
• Single Responsibility Principle: A class should have only one reason to change.

• Open/Closed Principle: A class should be open for extension but closed for modification.

• Liskov Substitution Principle: Subtypes should be substitutable for their base types.

• Interface Segregation Principle: Clients should not be forced to depend on interfaces ...read more
Answered by AI
Add your answer

Q1. Difference b/w full and partial selectors
Ans. 
Full selectors select all descendants of a specified element, while partial selectors select only direct children.
• Full selectors use a space between the parent and child elements, while partial selectors use the > symbol.

• Full selectors are more general and can target multiple levels of descendants, while partial selectors are more specific and target only direct children.

• Example of full selector: div p selects all

  ele...read more
Answered by AI
Add your answer
Q2. What is Screen scraping and data scraping
Ans. 
Screen scraping is extracting data from a website's HTML code, while data scraping is extracting data from various sources.
• Screen scraping involves extracting data from the visual representation of a website, usually using automation tools like web scrapers.

• Data scraping involves extracting data from various sources such as databases, APIs, and documents.

• Both screen scraping and data scraping are used to collect and an...read more
Answered by AI
Add your answer

Q1. Explain about pagination
Ans. 
Pagination is the process of dividing content into separate pages to improve user experience and optimize performance.
• Pagination is commonly used in websites to display a large amount of data in manageable chunks.

• It allows users to navigate through different pages of content, typically with options like 'Next' and 'Previous'.

• Pagination can also include features like page numbers, page size selection, and total item cou...read more
Answered by AI
Add your answer

Q1. General Managerial questions
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

30 Aptitude problems and two coding questions

Q1. Count Inversions
For a given integer array/list 'ARR' of size 'N', find the total number of 'Inversions' that may exist.
An inversion is defined for a pair of integers in the arra...read more
Ans. 
This problem is classic problem known as inversion count. I solved this problem using merge sort tree and got full points if we apply brute force on this then we will get time limit exceeded so we have to solve this in O(nlogn) complexity.
Answered Anonymously
Add your answer
Q2. Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since w...read more
Ans. 
This problem in know as kadane's algorithm i solved this one using single for loop and passed successfully all the test cases.
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Data structure and algorithms plus object oriented problems

Q1. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. 
Step 1 : I wrote first merge sort algorithm then i explained the worst case complexity for this one.
Step 2 : Interviewer cross questioned me what is divide and conquer approach.
Step 3 : I gave the definition for divide and conquer method
Step 4 : Then I continued explaining quick sort algorithm
Step 5 : Interviewer asked me about worst case scenario for quick sort then i replied when the array is already sorted he was ha
Answered Anonymously
Add your answer
Q2. Delete Node In A Linked List
You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete...read more
Ans. 
Step 1 : I wrote all condition for deletion in linked list first from the beginning of the linked list then between linked list and then deleting last node for linked list
Step 2 : Interviewer asked about complexity for each of them i replied for all three cases.
Step 3 : Then i explained it using diagram how we are implementing this algo
Step 4 : He found an error in my code when we have only one node
Step 5 : I resolved
Answered Anonymously
Add your answer

Round duration - 60 miinutes
Round difficulty - Easy

Database questions and discussion about projects

Q1. DBMS
What is normal form and explain BCNF.
Ans. 
Tip 1 : Do clear your concept of basic dbms topics like functional dependency and normal forms
Tip 2 : Do practice on Sql commands
Tip 3 : Read examples on each normal forms
Answered Anonymously
Add your answer
Q2. DBMS
What is the difference between while keyword and having keyword?
Ans. 
Tip 1 : Do practice on sql commands
Tip 2 : Read about concepts of Sql like primary key candidate key foreign key
Tip 3 : Read concepts like DDL,DML,DCL
Answered Anonymously
Add your answer

Q1. Javascript, React, hooks , life-cycle methods,
Add your answer

Problem solving, binary search, shorting technique