Darwinbox Software Engineer Interview Questions and Answers

Basic string manipulation and general DSA questions

Q1. Tree traversal iteratively
Add your answer
Q2. Implement DFS,BFS on graph
Add your answer

There will be 3 coding questions given to us for solving,we need solve two questions compulsory.

Q1. Introduce yourself
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring, and Angular

• Strong problem-solving skills
Answered by AI
Add your answer
Q2. Questions related to frontend
Add your answer

Q1. Threading: Write and use a mutex?
Ans. 
A mutex is a synchronization primitive that ensures only one thread can access a resource at a time.
• Create a mutex object using the appropriate library or language-specific function.

• Lock the mutex before accessing the shared resource to prevent other threads from accessing it.

• Unlock the mutex after finishing the operation on the shared resource to allow other threads to access it.

• Example: pthread_mutex_t mutex; pthread...read more
Answered by AI
Add your answer
Q2. Find the memory leak in a given set of code.
Ans. 
Identify memory leak in code
• Check for any dynamically allocated memory that is not being freed

• Look for any infinite loops or recursive functions that consume memory

• Use memory profiling tools like Valgrind to detect leaks

• Check for any global variables that are not properly managed
Answered by AI
Add your answer

Q1. Basic React questions
Add your answer

Q1. Project explanation
Add your answer

Q1. Tell me about yourself?
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Q1. Rectangle Area
You are given a list of rectangles where each rectangle is represented by an array of four integers (i.e. Rectangle[i]=[x1, y1, x2, y2], where x1, y1 represents the bottom left point of the ...read more
Ans.  Coordinate Compression
• As we can have only 200 distinct rectangles with us so we don’t need to worry about point constraint, we can use the coordinate compression technique to map these points all The x-axis points and y-axis points as well.
• Now these mapped coordinates can be used to form our grid. we can make a grid grid[x][y] = True for rx1 <= x < rx2 and ry1 <= y < ry2. Where rx1 , rx2, ry1, ry2 correspo...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 Minutes
Round difficulty - Medium

Oops concepts and 1 DSA problem

Q1. Bit Set
You are given a sequence of only digits in the form of a string 'DIGIT_PATTERN', your task is to find the first repeating digit. If no digit is repeating you should return -1.
Example:
G...read more
Ans. Brute Force
The basic idea of the approach is that we iterate for each index ‘i’ digit in the string ‘DIGIT_PATTERN’, and store the occurrence of that digit in the array/list ‘store’. At any index ‘i’, if the occurrence of the digit is already 1 in the array/list ‘store’, then we would return that digit Or else if the digit has occurred for the first time in the iteration then make the value 1 at index ‘digit’ in the ar...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 Minutes
Round difficulty - Medium

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

Q1. Print Permutations
Given an input string (STR), print all possible permutations of the input string.
Note:
The input string may contain the same characters, so there will also be the same permutations.
T...read more
Ans. 
Recursively solved 1stl one
Then applied set data structure to solve second one
Answered by CodingNinjas
View 1 more amswer