i
Fynd
Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2024. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix
posted on 22 Feb 2024
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There were 6 interview rounds.
A zoo management system to track animals, enclosures, staff, and visitor information.
Create classes for animals, enclosures, staff, and visitors
Implement functions for adding, updating, and deleting records
Include features for scheduling feeding times, cleaning enclosures, and managing staff shifts
Standard DSA questions
I applied via campus placement at Rajalakshmi Engineering College, Chennai and was interviewed before Aug 2023. There were 2 interview rounds.
Aptitude of from all topics
It is simple MCQ machine test and test result is generated then forwarded for First round which is telephonic round.
This round is on Zoom and will try to check your coding knowledge. Like your role in existing project in current company etc. Totally project related
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
1 hour, focus on concurrency (mutex, semaphore, conditional lock, etc)
I applied via Naukri.com and was interviewed in Oct 2021. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Mar 2022. There were 3 interview rounds.
In depth interview about projects related to job description
The immediate higher number to the right of each element in an array
Iterate through the array from right to left
For each element, compare it with the elements to its right to find the immediate higher number
Store the immediate higher number in a new array
Count pairs in an array whose sum is a perfect square.
Iterate through the array and calculate the sum of each pair.
Check if the sum is a perfect square using a function.
Increment a counter if the sum is a perfect square.
Return the final count of pairs.
To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.
Perform an in-order traversal of the BST to get the elements in non-decreasing order.
Keep track of the Kth largest element while traversing the BST.
Return the Kth largest element once found.
based on 1 interview
Interview experience
based on 12 reviews
Rating in categories
Software Development Engineer
83
salaries
| ₹8 L/yr - ₹27 L/yr |
Software Development Engineer 1
77
salaries
| ₹9 L/yr - ₹27 L/yr |
Software Developer
66
salaries
| ₹7.5 L/yr - ₹30 L/yr |
Software Development Engineer II
59
salaries
| ₹20 L/yr - ₹46 L/yr |
Software Engineer
48
salaries
| ₹7 L/yr - ₹25.5 L/yr |
Myntra
Flipkart
Snapdeal
Shopclues