Darwinbox Software Engineer Interview Questions and Answers

Q1. Tell me about yourself?
Add your answer

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:
...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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...read more
Answered by AI
Add your answer

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.

Round duration - 120 Minutes
Round difficulty - Easy

Q1. 
Rectangle Area Calculation
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...read more
Ans. 
Calculate total area covered by a list of rectangles on a plane.
• Iterate through each rectangle and calculate its area

• Check for overlapping areas between rectangles

• Sum up the total area covered by all rectangles
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Oops concepts and 1 DSA problem

Q1. 
Bit Set Problem Statement
You are provided with a string, termed as DIGIT_PATTERN, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...read more
Ans. 
Identify the first repeating digit in a given string of digits.
• Iterate through the string and keep track of seen digits using a set.

• Return the first digit that repeats, or -1 if no digit repeats.

• Time complexity: O(n), where n is the length of the input string.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Firstly Some general questions and then suddenly a cosing question with modifications

Q1. 
Print All Permutations of a String
Given an input string STR, generate and print all possible permutations of the string.
Input:
str
Output:
All permutations of the input string, each on a new line.
...read more
Ans. 
Generate and print all possible permutations of a given input string.
• Use recursion to generate all permutations by swapping characters in the string.

• Maintain a visited array to keep track of characters already used in a particular permutation.

• Print each permutation as it is generated.

• Handle duplicate characters by skipping swapping if the character is already in the current position.
Answered by AI
Add your answer

Q1. The interviewer asked Basic SQL and Linux OS-related questions.
Add your answer

Q1. The interviewer asked questions regarding projects and experience.
Add your answer
Q2. The interviewer asked some aptitude and logical reasoning questions.
Add your answer

Q1. Salary negotiations.
Add your answer