Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by Digit Insurance Team. If you also belong to the team, you can get access from here

Digit Insurance Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Digit Insurance Full Stack Developer Interview Questions and Answers

Updated 7 Dec 2022

Digit Insurance Full Stack Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

It was easy just a few basic apti questions nothing complicated

Round 3 - Coding Test 

4-5 codes on java/python or on ur preferred coding skill

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep calm and interview face to face was a easy proc=cess

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Basic oops concepts
  • Q2. Web api questions
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(5 Questions)

  • Q1. Oops concept and c# basic questions for freshers and sql basics
  • Q2. What is .net framework
  • Ans. 

    .NET Framework is a software framework developed by Microsoft that provides a runtime environment for building and running applications.

    • .NET Framework is a platform for developing and running applications on Windows.

    • It includes a large library of pre-built code and a runtime environment for executing applications.

    • It supports multiple programming languages such as C#, VB.NET, and F#.

    • It provides features like memory mana...

  • Answered by AI
  • Q3. Stored procesure insert update syntax
  • Q4. Oops questions inheritance constructors
  • Q5. Joins in sql and types
  • Ans. 

    Joins in SQL are used to combine rows from two or more tables based on a related column between them.

    • There are different types of joins in SQL: inner join, left join, right join, and full outer join.

    • Inner join returns only the matching rows from both tables.

    • Left join returns all the rows from the left table and the matching rows from the right table.

    • Right join returns all the rows from the right table and the matching ...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • 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
  • 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
Round 2 - Technical 

(2 Questions)

  • 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
  • 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
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Mar 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Difference b/w map and array in CPP. What are generators in Python. What is Polynomial Regression? Normalisation in DBMS.
  • Ans. 

    Map and array in CPP are both data structures, but map is a key-value pair container while array is a collection of elements with a fixed size.

    • Map in CPP is a container that stores elements in key-value pairs, allowing fast lookups based on keys.

    • Array in CPP is a collection of elements of the same data type, stored in contiguous memory locations.

    • Generators in Python are functions that allow you to iterate over a sequen...

  • Answered by AI
  • Q2. Realtional Algebra in DBMS
  • Ans. 

    Relational Algebra is a procedural query language used to query databases in DBMS.

    • Relational Algebra is used to perform basic operations like selection, projection, join, etc. on relations.

    • It helps in retrieving specific information from databases based on certain conditions.

    • Examples of operations in Relational Algebra include Union, Intersection, Difference, Cartesian Product, etc.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Expect that all the questions will be from the resume.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Tell me About yourself

I was interviewed in Jul 2021.

Round 1 - Video Call 

(3 Questions)

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 ...

  • 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...

  • Answered by AI
  • 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...

  • 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
  • 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:

    ...
  • 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
Round 2 - Video Call 

(3 Questions)

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...

  • 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
  • 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...

  • 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
  • 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...

  • 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
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

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

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPolicyBazaar.com interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed in Jan 2025.

Round 1 - Aptitude Test 

Basic aptitude questions to

Round 2 - Coding Test 

Basic coding questions

Round 3 - Technical 

(2 Questions)

  • Q1. Thanks tougfh roubd was there
  • Q2. What type of round was conducted during the interview?

Interview Preparation Tips

Interview preparation tips for other job seekers - All the best , thanks for asking

I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Priority queue code, Fibonacci series, bfs-dfs implementation,tree data structures (like height,left view,right view) basically easy level question of GFG on tree

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

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

Digit Insurance Interview FAQs

How many rounds are there in Digit Insurance Full Stack Developer interview?
Digit Insurance interview process usually has 3 rounds. The most common rounds in the Digit Insurance interview process are Resume Shortlist, Aptitude Test and Coding Test.

Tell us how to improve this page.

Digit Insurance Full Stack Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 425 Interviews
PolicyBazaar Interview Questions
3.6
 • 346 Interviews
Udaan Interview Questions
4.0
 • 333 Interviews
CARS24 Interview Questions
3.6
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Blinkit Interview Questions
3.7
 • 180 Interviews
BlackBuck Interview Questions
3.8
 • 175 Interviews
Tata AIG Interview Questions
4.1
 • 154 Interviews
View all
Software Engineer
356 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
265 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
219 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Deputy Manager
157 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
151 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Digit Insurance with

PolicyBazaar

3.6
Compare

ICICI Lombard General Insurance Company

3.7
Compare

Bajaj Allianz

3.8
Compare

HDFC Ergo General Insurance

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview