We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
It becomes very easy using deque. You just have to
use one deque to store incoming list
another one to store maximum element at one end(Just need to take into consideration few points like how many element to pop from deque of max storage)
Each query will taking O(n) time
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Queries with Fixed Length
You are viewing a single comment's thread. Return to all comments →
It becomes very easy using deque. You just have to
use one deque to store incoming list
another one to store maximum element at one end(Just need to take into consideration few points like how many element to pop from deque of max storage) Each query will taking O(n) time