/u/Revolutionary-Teach2's posts
Give me the most elegant way to find the sum of k smallest elements among all window of len L in an array of size N......
Mark as read: Add to a list
In an array you can take any window of length L and decrement all element by 1... you can do this operation M number of times.... .. what's the maximum element value in array after M operations.... how to do it efficiently?
Mark as read: Add to a list