I got interviewed for SDE 3 role for Hevo Data.
Question: Sliding Window Maximum.
https://leetcode.com/problems/sliding-window-maximum/

I presented with two approaches:

1. The brute force with O(n2) time complexity and O(1) space complexity.
2. Other one was Max heap approach with O(nlogk) time complexity and O(k) space complexity.

He was expecting O(n) solution by modifying O(nlogk) which we both discussed and tried to bring it down. Person who was taking interview was only 1 year experienced. I got the feedback that I got rejected but couldn't unederstand where I went wrong.

No woories I am sharing this for community if anyone is going to try for Hevo data.

#hevo data