i
Dassault
Systemes
Work with us
Filter interviews by
Write code for micro service
Top trending discussions
Interview questions for Application Engineer role covering various topics.
Subset sum variant - finding a subset of numbers that add up to a given sum
Single loop missing number - finding a missing number in an array using a single loop
Difference between two dates - calculating the difference between two dates in Java
Core Java concepts - knowledge of basic Java concepts such as inheritance, polymorphism, etc.
SQL - knowle...
I applied via Campus Placement and was interviewed before Feb 2022. There were 4 interview rounds.
Test consisted of multiple sections like CS, English, Aptitude etc. Questions covered most of the aspects of aptitude, logical reasoning and verbal ability
You should hire me because of my strong technical skills, passion for problem-solving, and ability to work well in a team. I am interested in working at any location that aligns with the company's goals and values.
I have a solid background in engineering and extensive experience in application development.
I am highly skilled in programming languages such as Java, C++, and Python.
I have a proven track record of successf...
I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.
MCQ test on DSA+computer science fundamentals+aptitude
Find missing and repeating numbers in a group of billions of numbers without extra space.
Use bitwise XOR to find the missing number
Use modulo and division to find the repeating number
Divide the numbers into smaller chunks to avoid memory overflow
Check if two binary trees are identical or not.
Traverse both trees simultaneously and compare each node
If any node is different, return false
If both trees are traversed completely and all nodes are same, return true
Subset Sum Problem: Determine if a subset of numbers sums to a target value using dynamic programming.
Dynamic programming approach builds a table to store results of subproblems.
Define a boolean array 'dp' where dp[i] indicates if a sum 'i' can be formed.
Initialize dp[0] = true (0 sum can always be formed with an empty subset).
Iterate through each number and update the dp array from back to front.
Example: For nums = [3...
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
1 DP Question, 1 Rest API, 10 Aptitude MCQs, 10 English MCQs
I applied via Campus Placement
To find the longest path in a binary tree (leaf to leaf), we need to perform a depth-first search and keep track of the maximum path length.
Perform a depth-first search on the binary tree, keeping track of the maximum path length encountered so far.
At each node, calculate the maximum path length by adding the maximum left and right subtree depths.
Update the maximum path length if the current path length is greater.
Repe...
based on 2 interview experiences
based on 2 reviews
Rating in categories
R&D Engineer
627
salaries
| ₹9.3 L/yr - ₹19.9 L/yr |
Software Engineering Specialist
459
salaries
| ₹9.5 L/yr - ₹17 L/yr |
Software Engineer
360
salaries
| ₹8.6 L/yr - ₹15 L/yr |
Software Developer
353
salaries
| ₹9.4 L/yr - ₹16.1 L/yr |
QA Engineer
146
salaries
| ₹7.9 L/yr - ₹13.2 L/yr |
Autodesk
Oracle
Amdocs
Automatic Data Processing (ADP)