Filter interviews by
Inheritance and encapsulation are core OOP concepts that promote code reuse and data protection in software development.
Inheritance allows a class to inherit properties and methods from another class, promoting code reuse. Example: class Dog extends Animal.
Encapsulation restricts access to certain components of an object, protecting its state. Example: using private variables with public getters/setters.
Inheritanc...
Normal forms in database management systems help in organizing data to reduce redundancy and improve data integrity.
Normal forms are rules used to design relational database tables to minimize redundancy and dependency.
Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form (3NF) where every determinant is a candidate key.
BCNF helps in eliminating anomalies like insertion, update, and deletion ano...
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked lis...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
Use Kadane's algorithm to solve the problem efficiently.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort ...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each array has only one element.
Merge the sorted halves to produce a completely sorted array.
Time complexity of Merge Sort is O(n log n).
Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
WHILE is used in loops to repeatedly execute a block of code, while HAVING is used in SQL queries to filter results based on aggregate functions.
WHILE is used in programming languages like SQL to create loops for executing a block of code multiple times.
HAVING is used in SQL queries to filter results based on aggregate functions like SUM, COUNT, AVG, etc.
WHILE is used for iterative operations, while HAVING is used...
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the ...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
Inheritance and encapsulation are core OOP concepts that promote code reuse and data protection in software development.
Inheritance allows a class to inherit properties and methods from another class, promoting code reuse. Example: class Dog extends Animal.
Encapsulation restricts access to certain components of an object, protecting its state. Example: using private variables with public getters/setters.
Inheritance can...
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
30 Aptitude problems and two coding questions
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
Use Kadane's algorithm to solve the problem efficiently.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Round duration - 90 minutes
Round difficulty - Medium
Data structure and algorithms plus object oriented problems
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each array has only one element.
Merge the sorted halves to produce a completely sorted array.
Time complexity of Merge Sort is O(n log n).
Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Round duration - 60 miinutes
Round difficulty - Easy
Database questions and discussion about projects
Normal forms in database management systems help in organizing data to reduce redundancy and improve data integrity.
Normal forms are rules used to design relational database tables to minimize redundancy and dependency.
Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form (3NF) where every determinant is a candidate key.
BCNF helps in eliminating anomalies like insertion, update, and deletion anomalie...
WHILE is used in loops to repeatedly execute a block of code, while HAVING is used in SQL queries to filter results based on aggregate functions.
WHILE is used in programming languages like SQL to create loops for executing a block of code multiple times.
HAVING is used in SQL queries to filter results based on aggregate functions like SUM, COUNT, AVG, etc.
WHILE is used for iterative operations, while HAVING is used for ...
Tip 1 : Competitive Programming
Tip 2 : Do atleast 2 projects
Tip 1 : To be precise, mention your technical skills, achievements, dont write anything unnecessary plus write your professional summary good mention your project details in not more than 2 lines and make sure those sentences make sense to reader.
Tip 2 : Resume should be not more than one page. Write everything within one page
Top trending discussions
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
Normal questions (technical and logical question)
I applied via unstop and was interviewed before Oct 2023. There were 3 interview rounds.
It was medium to difficult level test
posted on 22 Oct 2024
I applied via Company Website and was interviewed in Sep 2024. There were 3 interview rounds.
Question related to profile.
Aptitude test questions
posted on 19 May 2024
Problem solving, binary search, shorting technique
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...
Basic coding questions related to javascript or Java
Specific to your skills, for FE web development angular related questions.
posted on 18 Jan 2022
C programming
I applied via Naukri.com and was interviewed in Oct 2023. There were 4 interview rounds.
Simple coding test related to fundamental of programming
Some of the top questions asked at the UnitedHealth Software Developer interview for freshers -
based on 1 interview experience
based on 23 reviews
Rating in categories
Senior Software Engineer
1.2k
salaries
| ₹14.6 L/yr - ₹26 L/yr |
Claims Associate
944
salaries
| ₹2 L/yr - ₹5.1 L/yr |
Software Engineer
713
salaries
| ₹9.3 L/yr - ₹16 L/yr |
Senior Claims Associate
480
salaries
| ₹2.6 L/yr - ₹7 L/yr |
Assistant Manager
283
salaries
| ₹8 L/yr - ₹14.1 L/yr |
Apollo Hospitals
GeBBS Healthcare Solutions
Max Healthcare
Sahrudaya Healthcare (Medicover Hospitals)