Zoom Care Front end Developer Interview Questions and Answers

Q1. They asked me about web workers and web assembly. The whole questions were planned to reject the candidate.
Add your answer

Q1. Questions on optimizations
Add your answer
Q2. Question on React Js
Add your answer

Medium level DSA question in JS

Question are very tough and faad

Question like trees linked list and graphs

Q1. Given a matrix zeros and ones find minimum distance for each one to a zero.
Ans. 
Given a matrix of zeros and ones, find the minimum distance for each one to a zero.
• Use breadth-first search (BFS) to find the minimum distance from each one to a zero.

• Start by initializing a queue with all the zeros in the matrix.

• While the queue is not empty, dequeue a zero and enqueue its neighboring ones.

• Keep track of the distance from each one to the nearest zero.

• Repeat until all ones have been visited.

• Return the ma...read more
Answered by AI
Add your answer

30mins aptitude test

90 mins coding test for 3 questions

Q1. Why are you choosing this role
Ans. 
I am choosing this role because of my passion for creating user-friendly and visually appealing websites.
• Passion for front end development

• Enjoy creating user-friendly interfaces

• Excited about the creative aspect of web design
Answered by AI
Add your answer
Q2. Why should we write you
Ans. 
I am a dedicated and skilled front end developer with a passion for creating user-friendly interfaces.
• I have a strong understanding of HTML, CSS, and JavaScript

• I have experience with responsive design and cross-browser compatibility

• I am proficient in using front end frameworks like React and Angular
Answered by AI
Add your answer

Coding a frontend UI from provided image. And creating a fucntional star rating system

Q1. Designing a Component API in React using Typescript.
Ans. 
Designing a Component API in React using Typescript involves defining props, state, and methods for the component.
• Define the props interface to specify the expected input data for the component

• Use typescript types to ensure type safety and prevent runtime errors

• Define the state interface to manage the internal state of the component

• Implement methods to handle user interactions and component logic

• Document the component ...read more
Answered by AI
Add your answer
Q2. Create a function that can clear all the timer ids at once.
Ans. 
Function to clear all timer ids at once
• Create an array to store all timer ids

• Iterate through the array and clear each timer id using clearTimeout() function
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was held during university hours and consisted of 2 coding questions.

Round duration - 120 minutes
Round difficulty - Easy

Make sure you do no cutting and are clear about the approach you'd be following. 
 

Q1. What is the running median of an input stream?
Ans. 
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
• Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.

• Keep the number of elements in the two heaps balanced or differ by at most 1.

• If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

Q1. 
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...read more
Ans. 
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
• Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

• Use level-order input to construct the Binary Tree.

• Traverse the Binary Tree recursively to generate the required traversals.

• Ensure proper handling of null nodes represented by -1 in the input.

• Return the three traversals as ...read more
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Ans. 
Reverse a singly linked list by altering the links between nodes.
• Iterate through the linked list and reverse the links between nodes

• Use three pointers to keep track of the current, previous, and next nodes

• Update the links between nodes to reverse the list

• Return the head of the reversed linked list
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

Q1. 
Intersection of Two Arrays Problem Statement
Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...read more
Ans. 
The problem involves finding the intersection of two sorted arrays efficiently.
• Use two pointers to iterate through both arrays simultaneously.

• Compare elements at the pointers and move the pointers accordingly.

• Handle cases where elements are equal and update the intersection array.

• Return the intersection array as the result.
Answered by AI
Add your answer