1st:
sliding window mean, given input array and sliding window size give avgs of each slide
2nd:
https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/description/
Idea to traverse in breadth first the elements, and then smartly map the values.
(FAIL)
TBH kinda disappointed that they ask a hard questions, how this is even supposed to take me 20 mins if I never seen the problem?

So I assume this will result into fail from my side.