Filter interviews by
Top trending discussions
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by first building a heap from the input array.
Then it repeatedly extracts the maximum element from the heap, and places it at the end of the sorted array.
The heap is then updated to exclude the extracted element, and the process is repeated until the heap is empty.
Heap sort has a worst-case and average time complexi...
I applied via Walk-in and was interviewed in Apr 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Oct 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2021. There were 3 interview rounds.
Round 1 is quit easy , only verbal ability is little bit difficult. So anyone can easy to qualify round.
I applied via Referral and was interviewed in Dec 2020. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Mar 2021. There was 1 interview round.
based on 3 interviews
Interview experience
based on 38 reviews
Rating in categories
Softwaretest Engineer
92
salaries
| ₹2.2 L/yr - ₹6.1 L/yr |
Plsql Developer
63
salaries
| ₹3 L/yr - ₹4.6 L/yr |
Software Developer
21
salaries
| ₹3.2 L/yr - ₹6 L/yr |
SQL Developer
20
salaries
| ₹3.2 L/yr - ₹5 L/yr |
Production Support Engineer
18
salaries
| ₹2.8 L/yr - ₹3.8 L/yr |
TCS
Accenture
Wipro
Cognizant