Filter interviews by
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
They asked general aptitude questions .
I applied via LinkedIn and was interviewed before May 2020. There were 3 interview rounds.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
General topics like mathe, English, social etc
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
posted on 22 Oct 2023
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
Just plain leetcode medium questions
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
Basic Aptitude questions like quantitative and logical
Programs have to written for given questions
I applied via Company Website and was interviewed in May 2022. There were 4 interview rounds.
The test contains basic programming output questions and some aptitude questions.
We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.
Three technical questions related to string manipulation and clock calculations.
For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.
To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.
To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H
The question asks to check if a number is prime and add all its digits.
To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.
If the number is divisible by any of these numbers, it is not prime.
To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
based on 1 interview
Interview experience
based on 39 reviews
Rating in categories
Software Developer
39
salaries
| ₹4.2 L/yr - ₹9 L/yr |
Software Engineer
38
salaries
| ₹4.8 L/yr - ₹12.5 L/yr |
Softwaretest Engineer
24
salaries
| ₹3 L/yr - ₹6.1 L/yr |
Test Engineer
24
salaries
| ₹3.9 L/yr - ₹8 L/yr |
Java Developer
20
salaries
| ₹3.6 L/yr - ₹5 L/yr |
Maxgen Technologies
Magic Edtech
VDart
Value Point Systems