Filter interviews by
Be the first one to contribute and help others!
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.
posted on 10 Oct 2021
posted on 9 Oct 2021
I applied via Campus Placement and was interviewed before Oct 2020. There was 1 interview round.
posted on 7 Dec 2021
I applied via Campus Placement and was interviewed before Dec 2020. There were 3 interview rounds.
posted on 29 Jun 2015
posted on 29 Jun 2015
posted on 1 Apr 2021
posted on 1 Apr 2021
posted on 1 Apr 2021
posted on 25 Nov 2021
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
based on 4 reviews
Rating in categories
Senior HR Executive
4
salaries
| ₹3.6 L/yr - ₹3.6 L/yr |
Executive Accountant
3
salaries
| ₹2.2 L/yr - ₹3.6 L/yr |
Coca-Cola Company
Dhoot Transmission
Genius Consultants
Apotex Research