I had initial phone screen with Meta for E4 position:
Find average of each Sliding window. Given an input array of n elements and a sliding window fo size k, find the average of each sliding window.
input = [1,2,3,4,5,6,7,8,9]
k = 7
output = [4.0, 5.0, 6.0]
https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/solution/
This was my first ever FAANG interview experience, have been grinding leetcode for a while. I got rejection email after 3 business days, I thought I did well as I was able to solve both optimally Time and Space. However, I think 2nd question got me as I solved using stack but interviewer asked me to solve without using stack. I told him it will not make difference on space complexity and just mentioned the approach.