i
Filter interviews by
I applied via campus placement at SRM Institute of Science & Technology, Chennai and was interviewed in Nov 2022. There were 4 interview rounds.
Aptitude questions 50
I am a dedicated and skilled technical intern with a passion for problem-solving and a strong background in Dedalus.
I have extensive knowledge and experience in working with Dedalus, which makes me a valuable asset to your team.
I am highly motivated and eager to learn, which allows me to quickly adapt to new technologies and challenges.
I have a proven track record of successfully completing technical projects and deliv...
Top trending discussions
General questions asked
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
Numerical reasoning test.
Binary tree traversal question
To add a node at the nth position in a linked list
Create a new node with the data to be inserted
Traverse the linked list to the (n-1)th node
Adjust the pointers to insert the new node at the nth position
posted on 6 Jun 2024
General questions asked
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
The action of simspeculam is to reflect or mimic something.
Simspeculam is a Latin word meaning 'mirror' or 'reflection'.
In a figurative sense, simspeculam can refer to imitating or copying someone or something.
For example, in art, an artist may use simspeculam to create a realistic depiction of a scene or object.
I applied via Referral and was interviewed in Mar 2023. There were 2 interview rounds.
posted on 20 Feb 2023
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
posted on 1 Jul 2021
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
Reverse an array of strings
Create a new array and iterate through the original array in reverse order, adding each element to the new array
Use the built-in reverse() method of the array object
Swap the first and last elements, then the second and second-to-last elements, and so on until the middle of the array is reached
Check if a binary tree is a binary search tree
Traverse the tree and check if each node satisfies the BST property
For each node, check if its left child is less than the node and right child is greater than the node
Use recursion to check all nodes in the tree
Interview experience
Associate Professional Product Developer
121
salaries
| ₹3.3 L/yr - ₹8.5 L/yr |
Professional 1 Product Developer
45
salaries
| ₹5.4 L/yr - ₹10 L/yr |
Product Developer
34
salaries
| ₹4.2 L/yr - ₹12.3 L/yr |
Associate Software Engineer
26
salaries
| ₹5 L/yr - ₹7.3 L/yr |
Associate Professional Product Test
24
salaries
| ₹4.3 L/yr - ₹6.7 L/yr |
Siemens Healthineers
Philips
GE Healthcare
Oracle Cerner