i
Dassault Systemes
Filter interviews by
posted on 8 Apr 2021
posted on 5 Dec 2021
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Use Dijkstra's algorithm to find the shortest path between 2 vertices in a graph.
Implement Dijkstra's algorithm to find the shortest path
Create a priority queue to keep track of the vertices with the shortest distance
Use a visited set to avoid revisiting vertices
Stop when the destination vertex is reached
Return the shortest path found
Example: finding the shortest path between A and D in a graph with weighted edges: A->...
Find pairs in an array with sum equal to 0.
Use a hash table to store the frequency of each element.
Iterate through the array and for each element, check if its complement (negative value) exists in the hash table.
If it exists, add the frequency of the complement to the count of pairs.
Return the count of pairs.
Example: array = [2, -2, 3, 0, -3], pairs = 2 (-2, 2 and -3, 3)
I appeared for an interview in Jul 2019.
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
posted on 4 Mar 2021
Learning programming languages is important for software engineers to effectively communicate with computers and develop software solutions.
Programming languages are the foundation of software development.
Learning multiple languages expands the range of problems a software engineer can solve.
Different languages have different strengths and are suited for different tasks.
Knowing multiple languages improves adaptability ...
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
posted on 7 Oct 2021
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Data Structure related questions
based on 1 interview
Interview experience
R&D Engineer
621
salaries
| ₹6.8 L/yr - ₹24.5 L/yr |
Software Engineering Specialist
375
salaries
| ₹7 L/yr - ₹18.8 L/yr |
Software Developer
352
salaries
| ₹5 L/yr - ₹20 L/yr |
Software Engineer
303
salaries
| ₹6 L/yr - ₹18 L/yr |
QA Engineer
134
salaries
| ₹4.8 L/yr - ₹13.5 L/yr |
Autodesk
Oracle
Automatic Data Processing (ADP)
24/7 Customer