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 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 Answer
• Q3. I was asked basics about cloud and if I have any related experience as the role would be devops.
  Add Answer

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

Basics of mathematics and core related topics

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

Mental Ability and Programming

• Q1. Overall Skills are checked
  Add Answer

English Comprehension

Round duration - 75 Minutes
Round difficulty - Medium

This was an online coding round where we had 2 questions to solve under 75 minutes. The questions were of Medium to Hard level of difficulty and I found the problem statements to be a bit tricky.

• Q1. Balanced parentheses Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the g...read more
  View Answers (2)
• Q2. Longest Happy String Ninja likes to play with strings, and he calls a string ‘S’ Happy if it only contains letters ‘a’, ‘b’, and ‘c’, and no three consecutive l...read more
  View Answers (4)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 preety decent questions of DSA . The interviewer was also quite freindly and helpful. I was able to solve both the questions under the given time frame and also discussed their respective time and space complexites.

• Q1. Print All Paths You are given a graph with ‘N’ nodes and ‘M’ unidirectional edges. Also you are given two integers ‘S’ and ‘D’ denoting the source and destinati...read more
  View Answers (2)
• Q2. Cycle Detection in a Singly Linked List You have given a Singly Linked List of integers, determine if it forms a cycle or not. A cycle occurs when a node's ...read more
  View Answers (4)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 question related to BST followed by some standard questions from OOPS and Operating Systems.

• Q1. Pair with Given Sum in a Balanced BST You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target,’ you have to tell if there exists any pa...read more
  View Answers (3)
• Q2. OOPS Question

  What is Early Binding and Late Binding in C++ ?

  View Answers (1)
• Q3. OS Question

  What is deadlock? How to prevent deadlock?

  View Answers (1)
• Q4. OS Question

  What is meant by Multitasking and Multithreading in OS?

  View Answers (1)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

• Q1. Basic HR Question

  Tell me something not there in your resume.

  View Answers (1)

Not that much difficult

Data structure

• Q1. Normal questions like where do you see yourself
  View Answers (2)