InsuranceDekho Senior Frontend Web Developer Interview Questions and Answers

Q1. What is flutter
Ans. 
Flutter is a UI toolkit for building natively compiled applications for mobile, web, and desktop from a single codebase.
• Developed by Google

• Uses Dart programming language

• Hot reload feature for quick development

• Supports iOS, Android, Web, and Desktop platforms

• Provides a rich set of pre-built widgets
Answered by AI
Add your answer

Duration 1Hr
2 coding questions

Q1. Don't remember the questions
Add your answer
Q2. Don't remember the questions.
Add your answer

Profit loss , number system, code decode

Q1. What is DDL, DML, DQL
Ans. 
DDL stands for Data Definition Language, DML stands for Data Manipulation Language, and DQL stands for Data Query Language.
• DDL is used to define the structure of database objects such as tables, indexes, and views.

• DML is used to manipulate data in the database, such as inserting, updating, and deleting records.

• DQL is used to retrieve data from the database using queries.

• Examples: CREATE TABLE is a DDL statement, INSERT...read more
Answered by AI
Add your answer

Q1. Implement queue,
Add your answer
Q2. React life cycle
Add your answer
Q3. Some output based questions
Add your answer
Q4. What is polyfill, implemented one two polyfill
Ans. 
A polyfill is a piece of code that provides modern functionality on older browsers that do not natively support it.
• Polyfills are commonly used for adding support for new JavaScript features on older browsers.

• Two popular polyfills are 'Babel' for ES6 features and 'fetch' for the Fetch API.

• Polyfills help ensure a consistent user experience across different browsers.

• Polyfills can be implemented using JavaScript libraries ...read more
Answered by AI
Add your answer
Q5. Create todo list using react
Ans. 
Create a todo list using React for managing tasks and reminders.
• Use React components to create a form for adding tasks

• Store tasks in state and display them in a list

• Add functionality to mark tasks as completed and delete tasks

• Implement features like filtering tasks by status or due date
Answered by AI
Add your answer
Q6. Closure and hoisting
Add your answer

All aptitude type questions as well as core computer science subject questions comes

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...read more
Ans. 
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
• Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

• Iterate through each item and update the array based on whether including the item would increase the total value.

• The final value in the array at index W will be the maximum value that can be stolen.
Answered by AI
Add your answer
Q2. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
Find the second largest element in an array of integers.
• Iterate through the array to find the largest and second largest elements.

• Handle cases where all elements are identical.

• Return -1 if a second largest element does not exist.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
Ans. 
Design a scalable system for Twitter with key components and architecture.
• Use microservices architecture for scalability and fault isolation.

• Key components include user service, tweet service, timeline service, and notification service.

• Use a distributed database like Cassandra for storing tweets and user data.

• Implement a message queue like Kafka for handling real-time updates and notifications.

• Use a caching layer like ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

Q1. 
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...read more
Ans. 
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
• Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

• Compare the two lists and find the last common node.

• Return the last common node as the lowest common ancestor.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Ans. 
The problem is to find a subarray with the maximum sum in a given array.
• Iterate through the array and keep track of the maximum sum and the current sum.

• If the current sum becomes negative, reset it to 0.

• Update the maximum sum if the current sum is greater.

• Also keep track of the start and end indices of the subarray with the maximum sum.

• Return the subarray using the start and end indices.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Easy

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in an array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that have a greater element to their right.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empty, the...read more
Answered by AI
Add your answer
Q2. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right side of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

• Sum up the amount of water trapped at each bar to get the total amo
Answered by AI
View 5 more answers

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc