->in total there were 3 CODING questions AND 1 hour time

1.medium question: there was a tree given with weighted edges
there are q queries given are of two types
1.to update the edge btw x1 and x2
2. shortest distance between two nodes given x1 and x2
return sum of all the shortest distance in all given sum type queries
2.easier: given an array=[a1,a2,...an]
given a window size k return the minimum of all the peaks of the fixed k size windows
peak is defined as the highest value in the window
3.DID NOT EVEN READ IT NO TIME LEFT