Filter interviews by
I applied via Referral and was interviewed before Apr 2023. There were 2 interview rounds.
Merge overlapping intervals in an array of strings.
Sort the intervals based on the start time.
Iterate through the intervals and merge overlapping ones.
Return the merged intervals.
Binary search is a divide and conquer algorithm used to efficiently search for a target value within a sorted array.
Binary search compares the target value to the middle element of the array and narrows down the search range based on the comparison.
It requires the array to be sorted in ascending or descending order for the algorithm to work correctly.
The time complexity of binary search is O(log n), making it more effi...
Top trending discussions
Interview experience
Sales Executive
3
salaries
| ₹3 L/yr - ₹14 L/yr |
Cognizant
Sutherland Global Services
Hexaware Technologies
Virtusa Consulting Services