Care Health Insurance Front end Developer Interview Questions and Answers

Q1. Expected salery
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. Array Approach
We will use an array of type Pair<key, value> to implement our LRU Cache where the larger the index is, the more recently the key is used. Means, the 0th index denotes the least recently used pair, and the last index denotes the most recently used pair.
 
The key will be considered as accessed if we try to perform any operation on it. So while performing the get operation on a key, we will do a ...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q2. DBMS Questions
normalization, indexing
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

late at 8.00 pm

Q1. 
Priority CPU Scheduling Problem
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...read more
Ans. Sorting
Approach:
 
• Recall the following:
  • Finish Time: The time at which the process complete and exits from the system.
  • Turn Around Time: The total time taken by the process. In other words, Turn Around time = Finish Time - Arrival Time.
  • Waiting Time: The total time taken by the process in the ready queue. In other words, Waiting Time = Turn Around Time - Burst Time.
• We also have the ’priority’ of each process. The high...read more
Answered Anonymously
Add your answer
Q2. Can you explain the concept of data spooling in operating systems?
Add your answer
Q3. What is the difference between inheritance and generalization in the context of database management systems?
Add your answer

Q1. Closures, setTimeout, Eventloop in javascript
Add your answer
Q2. How to center a div in css3
Ans. 
To center a div in CSS3, use the 'margin: auto;' property along with a set width.
• Set the width of the div

• Use 'margin: auto;' to center the div horizontally

• Make sure the parent container has a defined width
Answered by AI
Add your answer
Q3. Call , bind and apply functions in javascript
Ans. 
call, bind, and apply are methods used to manipulate the context of a function in JavaScript.
• call() is used to invoke a function with a specified 'this' value and arguments provided individually.

• bind() is used to create a new function with a specified 'this' value and initial arguments.

• apply() is used to invoke a function with a specified 'this' value and arguments provided as an array.
Answered by AI
Add your answer

Q1. Basi questions on resume
Add your answer

Q1. Javascript question based on finding median
Add your answer
Q2. React hooks and context api
Add your answer

Q1. Expected salery
Add your answer

Online Assignment of 1 hr. questions were around - JS, React JS, 1 DSA question

Q1. DSA round- 1 medium DSA question asked and some questions around JS
Add your answer

Q1. Technical Round - 1 hour.
Add your answer

Shared a hacker rank assessment test. In which coding is a high weightage.

Q1. In technical, you have to prepare JS core and react js core.
Add your answer
Q2. What is currying? What is closures? Whar are hooks?
Ans. 
Currying is a technique of transforming a function that takes multiple arguments into a sequence of functions that each take a single argument. Closures are functions that have access to variables in their lexical scope. Hooks are functions that allow you to use state and other React features without writing a class.
• Currying allows for partial application of functions

• Closures are used to create private variables and fu...read more
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. Array Approach
We will use an array of type Pair<key, value> to implement our LRU Cache where the larger the index is, the more recently the key is used. Means, the 0th index denotes the least recently used pair, and the last index denotes the most recently used pair.
 
The key will be considered as accessed if we try to perform any operation on it. So while performing the get operation on a key, we will do a ...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q2. DBMS Questions
normalization, indexing
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

late at 8.00 pm

Q1. 
Priority CPU Scheduling Problem
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...read more
Ans. Sorting
Approach:
 
• Recall the following:
  • Finish Time: The time at which the process complete and exits from the system.
  • Turn Around Time: The total time taken by the process. In other words, Turn Around time = Finish Time - Arrival Time.
  • Waiting Time: The total time taken by the process in the ready queue. In other words, Waiting Time = Turn Around Time - Burst Time.
• We also have the ’priority’ of each process. The high...read more
Answered Anonymously
Add your answer
Q2. Can you explain the concept of data spooling in operating systems?
Add your answer
Q3. What is the difference between inheritance and generalization in the context of database management systems?
Add your answer