Filter interviews by
I was interviewed before Nov 2020.
Merge sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Sort each half recursively
Merge the two sorted halves
Time complexity: O(n log n)
Space complexity: O(n)
Top trending discussions
The first round is aptitude round it is basically on aptitude, reasoning
They give some mid level dsa questions
posted on 20 Feb 2024
Dsa with medium leetcode questions
Implementing an LRU cache with optimization techniques for efficient data storage and retrieval.
Use a doubly linked list to keep track of the most recently used items
Implement a hash map for fast lookups and updates
Optimize by using a combination of both data structures for efficient cache management
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
posted on 22 Jan 2025
I was interviewed in Dec 2024.
The first round is aptitude round it is basically on aptitude, reasoning
They give some mid level dsa questions
posted on 20 Feb 2024
Dsa with medium leetcode questions
Implementing an LRU cache with optimization techniques for efficient data storage and retrieval.
Use a doubly linked list to keep track of the most recently used items
Implement a hash map for fast lookups and updates
Optimize by using a combination of both data structures for efficient cache management
posted on 17 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
Software Developer
7
salaries
| ₹5 L/yr - ₹11.5 L/yr |
Software Engineer
6
salaries
| ₹3.3 L/yr - ₹8 L/yr |
Associate Software Engineer
6
salaries
| ₹4.5 L/yr - ₹6 L/yr |
QA Engineer
4
salaries
| ₹3.2 L/yr - ₹4 L/yr |
Full Stack Developer
3
salaries
| ₹5.3 L/yr - ₹6.2 L/yr |
TCS
Infosys
Wipro
HCLTech