Dassault Systemes Associate Software Developer Interview Questions and Answers

1 coding question and MCQ on CS fundamentals were asked.

Q1. Questions were on my project. It was a full stack project on MERN. I was asked about non blocking IO, promises, alternatives to react.
Add your answer
Q2. I was asked a DSA question to find the set of element that occurs twice in the array. I was expected to run the code.
Add your answer
Q3. I was asked basics about cloud and if I have any related experience as the role would be devops.
Add your answer

Q1. I was asked basics questions about myself. It was a very short 15 minute interview.
Add your answer

Basics of mathematics and core related topics

Q1. Based on resume and more about project work
Add your answer
Q2. Sql query,phython,oops concepts
Add your answer

Karet Interview :
5 back to back System design question, we don't need to explain each component but more like list as many as points. Need to finish all the question in 15min

1-2 problem solving question : It's not fency algorithm round with tough question. But true problem solving round using basic knowledge such as hashmap, heap

Q1. Design File System : You have given file size and collection in input 1 : get total size 2 : find top k collections in size
Ans. 
Design a file system to calculate total size and find top k collections in size.
• Create a file system class with methods to add files and calculate total size.

• Maintain a data structure to store the collections and their sizes.

• Implement a method to find the top k collections based on size.

• Consider using a priority queue or sorting the collections based on size.

• Handle edge cases like empty collections or invalid input siz
Answered by AI
Add your answer
Q2. Find total size
Ans. 
Calculate the total size of an array of strings.
• Iterate through the array and sum the length of each string.

• Use the `length` property of each string to get its size.

• Handle edge cases such as empty strings or null values.
Answered by AI
Add your answer
Q3. Find Top k collections
Ans. 
The question is asking to find the top k collections.
• Use a sorting algorithm to sort the collections in descending order based on a specific criteria.

• Select the top k collections from the sorted list.

• Return the selected collections as an array of strings.
Answered by AI
Add your answer

Q1. Oops, web api, design pattern
Add your answer

Q1. Difficulties faced
Ans. 
Some difficulties faced include managing complex codebases, debugging tricky issues, and keeping up with new technologies.
• Managing complex codebases with multiple dependencies

• Debugging tricky issues such as memory leaks or race conditions

• Keeping up with new technologies and frameworks to stay competitive
Answered by AI
Add your answer

Very hard question and 4 qs in total

Q1. Tell me about yourself
Add your answer

Q1. Tell me about 5 years after now
Add your answer

Q1. Minimum number of platforms required for a railway station.
Ans. 
Minimum 2 platforms required for a railway station.
• At least 2 platforms are required for trains to arrive and depart simultaneously.

• Additional platforms may be required based on the frequency of trains and passenger traffic.

• Platforms should be long enough to accommodate the longest trains that will use the station.

• Platforms should also have appropriate facilities for passengers, such as seating, shelter, and signage.
Answered by AI
Add your answer
Q2. Set of numbers from an array that can form nearest sum to the given number
Ans. 
Find set of numbers from an array that can form nearest sum to the given number.
• Sort the array in ascending order

• Use two pointers approach to find the nearest sum

• Return the set of numbers
Answered by AI
Add your answer

Q1. Trapping Rain water problem
Ans. 
Trapping Rain Water Problem
• The problem involves calculating the amount of water trapped between bars in a histogram

• The solution involves finding the maximum height of bars on both sides of each bar and subtracting the height of the bar itself

• This can be done using two arrays to store the maximum height of bars on the left and right side of each bar
Answered by AI
Add your answer
Q2. Least cost to travel from source to destination(DP problem)
Ans. 
The problem is to find the least cost to travel from source to destination using dynamic programming.
• Use dynamic programming to solve the problem

• Create a 2D array to store the minimum cost to reach each cell

• Fill the array using the recurrence relation: minCost[i][j] = cost[i][j] + min(minCost[i-1][j], minCost[i][j-1], minCost[i-1][j-1])

• The final answer will be stored in minCost[m][n], where m and n are the coordinates ...read more
Answered by AI
Add your answer

Q1. Interfaces, diamond problem, abstraction, OOPs concepts, inheritance, abstract classes, Race condition, Normalization
Add your answer
Q2. Arrays coding question and a DP problem in mid to high level of difficulty.
Add your answer
Q3. System design question
Add your answer

Q1. DP problems (mid - high difficulty)
Add your answer

Q1. Level order traversal of Binary tree
Ans. 
Level order traversal of Binary tree
• Use a queue to traverse the tree level by level

• Enqueue the root node and then dequeue it and enqueue its children

• Repeat until the queue is empty
Answered by AI
Add your answer