Upload Button Icon Add office photos

Darwinbox

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Darwinbox Senior Software Development Engineer Interview Questions and Answers

Updated 10 Mar 2024

Darwinbox Senior Software Development Engineer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Oops concepts, database structure

Interview questions from similar companies

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

Focused more on Logics and DSA

Round 2 - HR 

(1 Question)

  • Q1. Just with Formal Questions

Interview Questionnaire 

1 Question

  • Q1. Algorithms, Computer languages, Aptitude & Reasoning
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Copy constructor implementation it was based on
Round 2 - Technical 

(1 Question)

  • Q1. Binary search question on array
Round 3 - HR 

(1 Question)

  • Q1. Experience and expectations on salary
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 Resume tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Laravel Question
Round 3 - HR 

(1 Question)

  • Q1. Salary Discussion
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Not Selected

I applied via Walk-in and was interviewed in Dec 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

It's more deficult it's not easy round

Round 2 - HR 

(2 Questions)

  • Q1. Speed and distance
  • Q2. Age problem and ratioo
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Based on profile and Job description

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

The test had it's webcam on, we were not allowed to go out of the frame.

  • Q1. 

    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. 

    The program calculates the Nth Fibonacci number using a recursive formula.

    • The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.

    • The program uses a recursive function to calculate the Nth Fibonacci number.

    • The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.

  • Answered by AI
  • Q2. 

    Longest Consecutive Sequence Problem Statement

    You are provided with an unsorted array/list ARR of N integers. Your task is to determine the length of the longest consecutive sequence present in the array...

  • Ans. 

    The task is to find the length of the longest consecutive sequence in an unsorted array of integers.

    • Sort the array to bring consecutive numbers together

    • Iterate through the sorted array and keep track of the current consecutive sequence length

    • Update the maximum length if a longer sequence is found

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

The interview was online from home.

  • Q1. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.

    • Iterate through the string from the last character to the first character and append each character to a new string.

    • Alternatively, you can use built-in string reversal functions or methods available in your programming language.

    • To solve the follow-up question with O(1) space complexity, you can use a tw...

  • Answered by AI
Round 3 - HR 

Round duration - 20 minutes
Round difficulty - Easy

This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals . 
The interviewer was very understanding and supportive.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in GurgaonEligibility criteriaNoGreyOrange interview preparation:Topics to prepare for the interview - Data Structures, Object-Oriented Programming, Algorithms, Dynamic programming, Graphs, Operating Systems and Database Management System,Java, MySQL, HTML, CSS, JavaScript, Nodejs, PythonTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Find a good course, and first clear all your fundamentals and implementation of every data structure. You should be thorough with their time as well as space complexities. 
Tip 2 : Upon clearing the fundamentals, select a platform where you have a large no of questions, also whose test cases are good. eg. LeetCode, InterviewBit or Codezen. Go and complete 300-400 questions.
Tip 3 : Also whenever you're not able to solve the problem, check out the editorial and then re-attempt it again. Also, check the discussion if there is some good solution to the same problem.
Tip 4 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 5 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.

Application resume tips for other job seekers

Tip 1 : Resume should contain facts, numbers, and data comparison.
Tip 2 : Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 3 : Technical achievements in the field you're applying to, would be good.
Tip 4 : DO NOT FAKE THINGS, the interviewer is smart enough.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. System architecture
  • Q2. Dict ,list and other questions

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

  • Q1. 

    Aggressive Cows Problem Statement

    Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...

  • Ans. 

    The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.

    • Sort the array of stall positions in ascending order.

    • Use binary search to find the largest minimum distance between cows.

    • Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

    • If it is possible, update the maximum distance and continue binary search ...

  • Answered by AI
  • Q2. 

    Shortest Path in an Unweighted Graph

    The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...

  • Ans. 

    The problem is to find the shortest path between two houses in an unweighted graph.

    • The graph represents the city of Ninjaland with houses connected by roads.

    • The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

    • The output is a vector of nodes representing the shortest path from the starting house to the ending house.

    • If there are multiple shor...

  • Answered by AI
  • Q3. 

    Count Set Bits Problem Statement

    Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...

  • Ans. 

    The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.

    • Convert each number from 1 to N into its binary representation

    • Count the number of '1' bits in each binary representation

    • Sum up the counts of '1' bits for all numbers

    • Return the sum modulo 1e9+7

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.

    • Split the string into words using spaces as delimiters

    • Reverse the order of the words

    • Join the reversed words with a single space between them

    • Remove any leading or trailing spaces

  • Answered by AI
  • Q2. 

    Reverse Linked List in Groups of K

    You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...

  • Ans. 

    The task is to reverse a linked list in groups of size K.

    • Iterate through the linked list in groups of size K

    • Reverse each group using a helper function

    • Connect the reversed groups to form the final reversed linked list

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

  • Q1. 

    Remove Consecutive Duplicates From String Problem Statement

    Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...

  • Ans. 

    The task is to remove consecutive duplicate characters from a given string and return the new string.

    • Iterate through the characters of the string

    • Compare each character with the next character

    • If they are the same, skip the next character

    • If they are different, add the current character to the new string

    • Return the new string

  • Answered by AI
  • Q2. 

    Maximum Path Sum in a Matrix

    Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...

  • Ans. 

    The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.

    • Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

    • For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

    • Store the maximum sum path ending at each cell in a se...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute Of Information Technology Sonepat. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPA with no backlogs.PeopleStrong interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, DBMS, Operating Systems, Computer Networking, System Design, OOPS.Time required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.

Application resume tips for other job seekers

Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Darwinbox Interview FAQs

How many rounds are there in Darwinbox Senior Software Development Engineer interview?
Darwinbox interview process usually has 1 rounds. The most common rounds in the Darwinbox interview process are Technical.

Recently Viewed

INTERVIEWS

Automotive Manufacturers

No Interviews

INTERVIEWS

Darwinbox

No Interviews

CAMPUS PLACEMENT

KIIT University, Bhuvaneshwar

INTERVIEWS

Darwinbox

No Interviews

INTERVIEWS

Automotive Manufacturers

No Interviews

INTERVIEWS

Haier Appliances India

No Interviews

CAMPUS PLACEMENT

Sastra University

INTERVIEWS

Automotive Manufacturers

No Interviews

INTERVIEWS

Panasonic Life Solutions India

No Interviews

INTERVIEWS

Automotive Manufacturers

No Interviews

Tell us how to improve this page.

Darwinbox Senior Software Development Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

PeopleStrong Interview Questions
3.4
 • 51 Interviews
Grey Orange Interview Questions
3.2
 • 38 Interviews
Mobileum Interview Questions
3.3
 • 37 Interviews
CodeClouds Interview Questions
4.5
 • 35 Interviews
Sakon Interview Questions
3.1
 • 29 Interviews
greytHR Interview Questions
3.9
 • 25 Interviews
SirionLabs Interview Questions
3.8
 • 23 Interviews
View all
Product Specialist
74 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
71 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Consultant
57 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
55 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
50 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Darwinbox with

PeopleStrong

3.4
Compare

SAP SuccessFactors

5.0
Compare

greytHR

3.8
Compare

Sumtotal Systems

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