i
Digit Insurance
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
Asked programming coding questions
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
They have asked some basic aptitude and reasoning questions including english
2 questions of basic knowledge
posted on 17 Jun 2021
posted on 15 Feb 2023
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 3 interview rounds.
posted on 23 Jul 2024
A list of libraries used in software development.
Common libraries like React, Angular, jQuery
Backend libraries like Express, Django, Spring
Database libraries like Sequelize, SQLAlchemy, Hibernate
A physical file is a file stored on a physical storage device, such as a hard drive or solid-state drive.
Physical files are stored on physical storage devices like hard drives or SSDs.
They can be accessed and manipulated by software applications.
Examples include text documents, images, videos, and executable programs.
A batch job is a program that processes a large amount of data in a single run without user interaction.
Batch jobs are typically scheduled to run at specific times, often during off-peak hours.
They are commonly used for tasks such as data processing, report generation, and system maintenance.
Examples of batch job tools include cron in Unix/Linux systems and Task Scheduler in Windows.
An interactive job is a task or project that requires active participation and engagement from the user.
Interactive jobs involve real-time feedback and communication between the user and the system.
Examples include video games, online surveys, and interactive websites.
Users have control over the outcome of the task based on their input and decisions.
posted on 25 Jul 2024
posted on 19 May 2023
I am a highly experienced Senior Associate with a strong background in [specific field].
Over [number] years of experience in [specific field]
Expertise in [specific skills or areas]
Proven track record of [specific achievements or projects]
Strong leadership and team management skills
Excellent communication and problem-solving abilities
I appeared for an interview 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 applied via Referral and was interviewed in Aug 2023. There were 3 interview rounds.
They asked question from sql from join group by and from excel they asked about xlookup, vlookup, sumif,countif etc
based on 3 interviews
Interview experience
based on 15 reviews
Rating in categories
Software Engineer
359
salaries
| ₹3.2 L/yr - ₹11.5 L/yr |
Associate Manager
272
salaries
| ₹5 L/yr - ₹15.7 L/yr |
Senior Associate
229
salaries
| ₹3.3 L/yr - ₹9 L/yr |
Deputy Manager
159
salaries
| ₹6 L/yr - ₹17.2 L/yr |
Associate
154
salaries
| ₹3 L/yr - ₹6.3 L/yr |
PolicyBazaar
ICICI Lombard General Insurance Company
Bajaj Allianz
HDFC Ergo General Insurance