Dassault Systemes Software Developer Interview Questions and Answers for Freshers

Coding questions related to trees and graphs

Q1. Anagrams related
Add your answer
Q2. Sorting related
Add your answer

Q1. Tell me about yourself
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

• Team player with excellent communication skills
Answered by AI
Add your answer
Q2. Motivation behind the move
Ans. 
I was motivated to move to this role because of my passion for coding and desire to work on challenging projects.
• Passion for coding and technology

• Desire to work on challenging projects

• Opportunity for growth and learning

• Interest in the company's products or services
Answered by AI
Add your answer

Q1. They will ask questions based on what you have mentioned in your resume
Add your answer

Q1. They have asked about my previous company project and questions related to that
Add your answer

Q1. Basics of c and unix. Since it telecommunications company they are still working with C and proC .
Add your answer

Round duration - 75 Minutes
Round difficulty - Hard

Online Round - 2 questions. 
75 minutes

Q1. Construct the Lexicographically Largest Valid Sequence
You are given a positive integer N. Your task is to create the lexicographically largest sequence of length 2*N - 1 containing integers between 1 to N...read more
Ans. Backtracking Approach
Approach:
 
In this approach, we will be trying to find the valid sequence using backtracking. We will be creating our sequence from left to right and will be trying to fix the biggest possible integer yet to be used at the current position. We are fixing the biggest integer first because that will give us the lexicographically largest sequence that is possible. For every position, we will be fi...read more
Answered by CodingNinjas
Add your answer
Q2. Zuma Game
You have several balls on the table in the form of a string named 'BOARD'. The colors of the balls can be red(R), blue(B), green(G), white(W), and yellow(Y). You also have several balls i...read more
Ans. Recursive Approach
The idea here is to use recursion. At each step, we plan to insert the remaining balls in the string hand to the string board. Now the question arises, in which position do we have to insert the ‘i’th character of the string hand? The answer is simple; we have to insert ‘i’th character to all the positions on board to get all possible answers. That’s why we are using the recursive approach. After inse...read more
Answered by CodingNinjas
Add your answer

Round duration - 40 Minutes
Round difficulty - Hard

1 Coding problem and 1 OOP problem

Q1. Ninja and Chocolates
Ninja is hungry and wants to eat his favorite chocolates but his mother won’t let him eat since he has already eaten enough chocolates. There are ‘N’ jars filled with chocolates. His m...read more
Ans. Brute Force
The brute force approach to this problem is that we continuously iterate on the speed of eating chocolates till Ninja can eat all the chocolates within ‘M’ Minutes.
 
Algorithm:
1. Make a variable ‘sum’, which will store the sum of all chocolates which are present in all N jars.
2. Now to find the starting speed, we’ll use the fact that our required speed has to be greater than the average speed(sum/M), else the ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. OOP Question
Virtual function and abstract class
Add your answer

Round duration - 40 minutes
Round difficulty - Hard

Resume based problems, OOPs, DBMS, OS problems

Q1. OS Questions
Virtual memory ? Usage , example4
Threads, Processes , differences.
Add your answer
Q2. System Design Question
Design linkedin kind platform
Add your answer

Round duration - 15 Minutes
Round difficulty - Hard

Typical HR interview round. Short and crisp

Q1. Basic HR Questions
Are you reliable? or Can I trust you with responsibilities? 
What are the three things that are most important for you in a job? 
What was the toughest decision you ever had to ma...read more
Ans. 
Tip 1 : Be quick and direct.
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was in the morning. The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 40mins.Questions were mainly from Data structure, OS, DBMS, SQL.

Q1. Morty and his array
Rick gave Morty an array 'Arr' of length ‘N’ and an integer ‘K’ and asked him to find the minimum possible cost to split the array into non-empty sub-arrays such that the follow...read more
Ans. Naive Approach
The basic idea is to generate all the possible subarrays and find the cost of every possible split and then returning the minimum cost from all of them. 
The steps are as follows:
 
1. Recursively go through every possible split of the array Arr.
2. Store all the subarrays of one split into a vector<vector<int>> split.
3. Now go through every subarray of that split and find the frequency of every ...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Longest Common Prime Subsequence
Ninja got a very long summer vacation. Being very bored and tired about it, he indulges himself in solving some puzzles.
He encountered a problem in which he was given tw...read more
Ans. Dynamic Programming
The simplest idea is to consider all subsequences of arr1[] and check if all numbers in this subsequence are prime and appear in arr2[]. Then find the longest length of these subsequences. But the time complexity for this operation will be O(M * (2 ^ N)) where ‘M’ is the length of the first array and ‘N’ is the length of the second array.
 
We can think of an efficient solution in which first we c...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was conducted in the evening around 4:30PM-5:30PM. Questions were bit difficult. Questions were mainly from Data Structures and there was total of 3 questions.

Q1. Split Array
You have given an integer array/list ‘arr’ of size ‘N’. You have to split the array into the maximum number of subarrays such that the first and last occurrence of every distinct element lies i...read more
Ans. Iterative
The key idea in this problem is storing the first and last occurrence index of every element. So, we can store the first and last index and then iterate over the array, and in each iteration, we check if the maximum index of the last occurrence of all the previous elements of the current subarray is less than or equal to the current index. 
 
We use array hash to store the last occurrence of an elemen...read more
Answered by CodingNinjas
Add your answer
Q2. Split Array in ‘K’ consecutive subarrays with a given condition.
You have given an integer array ‘arr’ size ‘N’. You have to split the array into ‘K’ consecutive non-overlapping subarrays of length ‘M’ suc...read more
Ans. Array Traversal.
We will be solving this problem using a simple array traversal. At each position, we will check if the element at the current index i and (i + M) are the same or not. Moreover, if it is the same, then we will increment the counter, and as soon as our counter becomes equal to K, it means the array can be split, and we will return the answer at that step. If, after all, iterations are still if the count i...read more
Answered by CodingNinjas
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

It was in the evening. Interviewer first ask simple questions to keep me calm and it was nice interaction with her the environment created by her was very interesting to answer

Q1. Basic HR Questions
On a scale of 1 to 10 how would you rate yourself as a leader? 
What makes you angry?
Ans. 
Tip 1 : Research about the company thoroughly
Tip 2 : Avoid any kind of hesitation while giving the answers
Tip 3 : Try to give practical and optimized approaches which shows some professionalism in you.
Answered by CodingNinjas
Add your answer