Care Health Insurance Software Developer Interview Questions and Answers

The topic was -> "One nation one election"

Q1. What is a String pool in Java?
Ans. 
String pool in Java is a pool of unique strings stored in memory to optimize memory usage.
• String pool is a part of Java's memory where unique string literals are stored.

• When a new string is created, Java checks if it already exists in the pool to save memory.

• Strings created using double quotes are added to the pool, while those created using 'new' keyword are not.

• Example: String str1 = "hello"; String str2 = "hello"; /...read more
Answered by AI
Add your answer
Q2. Explain different types of exception in Java.
Ans. 
Java has checked and unchecked exceptions. Checked exceptions must be handled at compile time, while unchecked exceptions do not need to be handled explicitly.
• Checked exceptions: Must be caught or declared in the method signature. Example: IOException, SQLException

• Unchecked exceptions: Do not need to be caught or declared. Example: NullPointerException, ArrayIndexOutOfBoundsException
Answered by AI
Add your answer

Q1. Sort the list, after many queries
Add your answer
Q2. LRU cache with multi level caching
Ans. 
LRU cache with multi level caching involves implementing a cache with multiple levels of storage, where the least recently used items are evicted first.
• Implement a two-level cache system with a primary cache (e.g. in-memory) and a secondary cache (e.g. disk-based).

• Use a data structure like a doubly linked list and a hash map to efficiently manage the cache and track the least recently used items.

• When an item is accesse...read more
Answered by AI
Add your answer

Q1. Basic oops, .net, c# coding, sql questions
Add your answer

Q1. More coding and details on project
Add your answer

Q1. More on projects and system design and troubleshooting approach
Add your answer

Q1. Salary discussion
Add your answer

Q1. More technical + managerial round even after HR round
Add your answer

One medium and one standard DP question

Q1. Medium level question based on binary search
Add your answer

Q1. Design google-pay
Ans. 
Design Google Pay - a digital wallet platform for online payments and transactions.
• Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.

• Enable users to make payments in stores, online, and within apps using their stored payment methods.

• Implement security features like biometric authentication, tokenization, and encryption to protect user data.

• Provide features fo...read more
Answered by AI
Add your answer
Q2. HLD of recursive
Ans. 
High Level Design (HLD) of recursive functions in software development.
• Recursive functions call themselves to solve smaller instances of the same problem.

• HLD of recursive functions involves defining the base case, recursive case, and termination condition.

• Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
Answered by AI
Add your answer

Q1. Puzzles available on GFG
Add your answer
Q2. Behavioral question
Add your answer

JavaScript questions

Q1. Array basics, java basics oops and all
Add your answer

1hr aptitude + coding

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

Q1. 
Container with Most Water Problem Statement
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...read more
Add your answer
Q2. 
Maze Obstacle Problem Statement
Given an N * M grid representing a maze with obstacles, compute and return the total number of distinct paths from the top-left cell to the bottom-right cell. A cell in the...read more
Add your answer

Round duration - 100 minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair : Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 10:00 A.M to 12:00 P.M

Q1. 
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...read more
Add your answer
Q2. 
Minimize Cash Flow Problem
You are provided with a list of 'transactions' involving 'n' friends who owe each other money. Each entry in the list contains information about a receiver, sender, and the tran...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a Telephonic Round (Audio Call). The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.