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 Software Developer Interview Questions and Answers

Updated 19 Dec 2024

Digit Insurance Software Developer Interview Experiences

3 interviews found

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.

Round 1 - Aptitude Test 

Easy level to Medium level

Round 2 - Coding Test 

2 Easy questions of DSA

Round 3 - One-on-one 

(2 Questions)

  • Q1. One DSA question
  • Q2. Normal discussion about tech stack
Round 4 - HR 

(2 Questions)

  • Q1. Tell about yourself
  • Q2. Why do you want to join digit?

Interview Preparation Tips

Interview preparation tips for other job seekers - Go easy.. Nothing is hard in digit hiring

Software Developer Interview Questions & Answers

user image Rohit Shinde

posted on 19 Dec 2024

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

I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Duration 1Hr
2 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Don't remember the questions
  • Q2. Don't remember the questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - easy interview. anyone can crack easily if you are clear with basic concepts.

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic coding only not to worry much

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about ur self
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Excellent team player with good communication skills

  • Answered by AI
  • Q2. What is ur projects
  • Ans. 

    I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using React and Node.js

    • Created a mobile app for tracking fitness goals using Flutter

    • Implemented RESTful APIs for communication between frontend and backend systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - all the best do well!

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

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

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

(1 Question)

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

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Instahyre and was interviewed in Nov 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Easy to medium questions, Questions on DSA and Node.js.

Round 2 - Technical 

(2 Questions)

  • Q1. Valid parenthesis
  • Q2. Three sum problem

Interview Preparation Tips

Topics to prepare for Zetwerk Software Developer interview:
  • js
  • node.js
  • dsa
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I appeared for an interview in Feb 2025.

Round 1 - Aptitude Test 

Data Structures, Coding MCQs

Round 2 - Technical 

(2 Questions)

  • Q1. What is Data Structure
  • Ans. 

    Data structures are organized formats for storing, managing, and accessing data efficiently.

    • 1. Types: Common data structures include arrays, linked lists, stacks, queues, trees, and graphs.

    • 2. Arrays: Fixed-size collections of elements, e.g., [1, 2, 3, 4].

    • 3. Linked Lists: Collections of nodes where each node points to the next, e.g., 1 -> 2 -> 3.

    • 4. Stacks: Last-in, first-out (LIFO) structures, e.g., function call ...

  • Answered by AI
  • Q2. Write DFS Algorithm
  • Ans. 

    Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • DFS uses a stack data structure, either explicitly or via recursion.

    • It starts from a selected node and explores each branch before backtracking.

    • Example: In a binary tree, DFS can be implemented using pre-order, in-order, or post-order traversal.

    • DFS can be used to find connected components in a ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Familiar in Data Structures and Algorithms
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Stock buy and sell with at most 2 transaction
  • Ans. 

    Implement a solution to find the maximum profit from buying and selling stocks with at most 2 transactions.

    • Use dynamic programming to keep track of maximum profit at each day with 0, 1, or 2 transactions.

    • Consider the possibility of splitting the transactions into two separate parts.

    • Calculate the maximum profit by iterating through the prices array and updating the maximum profit accordingly.

  • Answered by AI
  • Q2. Binary search to find target
  • Ans. 

    Binary search is a divide and conquer algorithm that efficiently finds a target value in a sorted array.

    • Divide the array in half and compare the target value with the middle element

    • If the target is less than the middle element, search the left half. If greater, search the right half

    • Repeat the process until the target is found or the subarray is empty

  • Answered by AI
Round 2 - System Design 

(2 Questions)

  • Q1. General about project
  • Q2. Design paytm wallet
  • Ans. 

    Design a digital wallet system similar to Paytm.

    • Allow users to add money to their wallet using various payment methods like credit/debit cards, net banking, UPI, etc.

    • Enable users to make payments for various services like mobile recharge, bill payments, online shopping, etc.

    • Implement security measures like two-factor authentication, encryption of sensitive data, and regular security audits.

    • Provide features like transac...

  • Answered by AI

Skills evaluated in this interview

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

(2 Questions)

  • Q1. What is thread ?
  • Ans. 

    A thread is a lightweight process that can run concurrently with other threads within the same process.

    • Threads allow for parallel execution of tasks within a single process.

    • Threads share the same memory space and resources of the process they belong to.

    • Threads can communicate with each other through shared memory or message passing.

    • Examples: Java threads, POSIX threads (pthreads) in C/C++.

  • Answered by AI
  • Q2. Inter process communication and project?

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.

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 - Coding Test 

Seat reservation system
bit manipulation
binary tree related

Round 3 - Technical 

(1 Question)

  • Q1. Bfs / dfs traversal question

Digit Insurance Interview FAQs

How many rounds are there in Digit Insurance Software Developer interview?
Digit Insurance interview process usually has 2-3 rounds. The most common rounds in the Digit Insurance interview process are Aptitude Test, Coding Test and One-on-one Round.
How to prepare for Digit Insurance Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Digit Insurance. The most common topics and skills that interviewers at Digit Insurance expect are Javascript, Angular, Bootstrap, Fullstack Development and HTML.
What are the top questions asked in Digit Insurance Software Developer interview?

Some of the top questions asked at the Digit Insurance Software Developer interview -

  1. what is ur proje...read more
  2. Don't remember the questi...read more
  3. Normal discussion about tech st...read more

Tell us how to improve this page.

Digit Insurance Software Developer Interview Process

based on 7 interviews

Interview experience

4.1
  
Good
View more
Join Digit Insurance One of India's leading digital full stack insurance companies.
Digit Insurance Software Developer Salary
based on 54 salaries
₹4 L/yr - ₹13 L/yr
14% less than the average Software Developer Salary in India
View more details

Digit Insurance Software Developer Reviews and Ratings

based on 13 reviews

2.5/5

Rating in categories

2.6

Skill development

2.3

Work-life balance

2.4

Salary

3.6

Job security

2.4

Company culture

2.3

Promotions

2.3

Work satisfaction

Explore 13 Reviews and Ratings
Software Engineer
364 salaries
unlock blur

₹3.2 L/yr - ₹11.5 L/yr

Associate Manager
273 salaries
unlock blur

₹4.4 L/yr - ₹15.7 L/yr

Senior Associate
216 salaries
unlock blur

₹3.6 L/yr - ₹9 L/yr

Deputy Manager
159 salaries
unlock blur

₹6 L/yr - ₹17.2 L/yr

Associate
154 salaries
unlock blur

₹3 L/yr - ₹6.3 L/yr

Explore more salaries
Compare Digit Insurance with

Udaan

3.9
Compare

Swiggy

3.8
Compare

CARS24

3.5
Compare

BlackBuck

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