Closed parth2211 closed 2 years ago
Gave optimal solution of DSA->Queues->Hard->Q1 in c++. The time complexity is O(N) and Space complexity is O(k). Used deque as the data structure for implementing the problem statement.
Gave optimal solution of DSA->Queues->Hard->Q1 in c++. The time complexity is O(N) and Space complexity is O(k). Used deque as the data structure for implementing the problem statement.