Filter interviews by
Top trending discussions
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
based on 1 interview experience
Software Developer
7
salaries
| ₹12.3 L/yr - ₹22 L/yr |
Field Service Engineer
5
salaries
| ₹6 L/yr - ₹9.7 L/yr |
HR Generalist
5
salaries
| ₹7.8 L/yr - ₹9 L/yr |
System Administrator
4
salaries
| ₹3.6 L/yr - ₹6.9 L/yr |
Senior Software Developer
4
salaries
| ₹9 L/yr - ₹24 L/yr |
Udaan
BigBasket
Swiggy
Oyo Rooms