i
InsuranceDekho
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Slicing in Python allows you to extract a subset of elements from a list.
Slicing is done using square brackets and the start:stop:step notation.
The start index is inclusive, while the stop index is exclusive.
You can omit any of the three parameters, defaulting to 0 for start, length of list for stop, and 1 for step.
Negative indices can be used to slice from the end of the list.
Example: list = [1, 2, 3, 4, 5], list[1:4]
Asked Question from Tree nad linked list
I was interviewed in Feb 2024.
Normal nomerical qustion
Implement a stack using two queues
Use two queues to simulate stack operations
Push operation: Enqueue the element to queue1
Pop operation: Dequeue all elements from queue1 to queue2, dequeue the last element from queue1, then swap the queues
Top operation: Dequeue all elements from queue1 to queue2, dequeue the last element from queue1, then swap the queues without dequeuing the element
Empty operation: Check if both queue
posted on 5 Dec 2024
All aptitude type questions as well as core computer science subject questions comes
I was interviewed in Jul 2021.
Round duration - 60 minutes
Round difficulty - Easy
Easy level DSA questions were asked to implement.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure the traversal starts from vertex 0 and follows the BFS order.
Output the BFS traversal sequence for each test case in a separate line.
Handle disconnected components by checking for unvisited nodes.
Consider t...
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Round duration - 60 minutes
Round difficulty - Easy
DSA questions based on trees were asked to implement.
You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...
The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.
Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.
Use a queue to perform level order traversal of the binary tree.
Store the leftmost node at each level in the result array.
Return the result array containing the left view of the binary
Given a binary tree of integers, your task is to output the right view of the tree.
The right view of a binary tree includes the nodes that are visible when the tree is observed...
The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.
Perform level order traversal of the binary tree.
For each level, add the rightmost node to the result.
Print the result as the right view of the binary tree.
Handle null nodes represented by -1 in the input.
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...
Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.
The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.
Consider edge cases like a single node tree or empty tree while calculating the height.
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round where the interviewer asked questions to know more about me.
Tip 1 : Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
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.
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...
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.
Round duration - 50 Minutes
Round difficulty - Easy
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...
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...
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...
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
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
I was interviewed before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
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...
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.
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.
ARR = [2,...
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.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
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 ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I was interviewed in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
based on 1 interview
Interview experience
Relationship Manager
141
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Manager
39
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
36
salaries
| ₹0 L/yr - ₹0 L/yr |
PolicyBazaar
Coverfox
Turtlemint
BankBazaar