Digit Insurance Graduate Trainee Interview Questions and Answers

Q1. BRD related questions
Add your answer

Q1. Generic Hr questions
Add your answer

Q1. What lib list ?
Ans. 
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
Answered by AI
Add your answer
Q2. What is Physical file
Ans. 
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.
Answered by AI
Add your answer

Q1. What is batch job
Ans. 
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.
Answered by AI
Add your answer
Q2. What is interctive job
Ans. 
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.
Answered by AI
Add your answer

Q1. Basic oops concepts
Add your answer
Q2. Web api questions
Add your answer

Q1. Tell me about your self
Ans. 
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
Answered by AI
Add your answer
Q2. About your current education
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

Q1. 
BFS Traversal in a Graph
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 ...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
DFS Traversal Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer
Q3. 
Nth Fibonacci Number Problem Statement
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.
Input:
...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

Q1. 
Determine the Left View of a Binary Tree
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Right View of Binary Tree
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. 
Height of Binary Tree
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.

Q1. Details about yourself
Add your answer
Q2. Personal information
Add your answer

They asked question from sql from join group by and from excel they asked about xlookup, vlookup, sumif,countif etc