Open sg-iitg opened 3 years ago
A program to retrieve the maximum/minimum element of each k sized continuous window of an array in O(n) time complexity. A good example where deque is useful.
I am a GSSOC'21 participant, and I would like to contribute the C++ code for this problem. I will make sure that the code is commented properly and follows all the given guidelines. Please give me this opportunity. Thankyou! @tarun26091999
do link it with the special algo folder.
@tarun26091999 I can do this question in Java? I am also a gssoc Patricipant
I am a GSSOC'21 participant. I would like to contribute the code in JAVA and PYTHON with proper description, indentation, comment and time complexity. Please assign this issue to me @tarun26091999
@shiv-30 do it in python.
@shiv-30 do it in python.
Thanks @tarun26091999
@tarun26091999 I have created the pull request - Create sliding_window_maximum.cpp #676
But I am unable to link the PR to this issue
Hey, I'm a GSSOC'21 participant. I would like to work on this issue in C++, please assign it to me.
A program to retrieve the maximum/minimum element of each k sized continuous window of an array in O(n) time complexity. A good example where deque is useful.
I am a GSSOC'21 participant, and I would like to contribute the C++ code for this problem. I will make sure that the code is commented properly and follows all the given guidelines. Please give me this opportunity. Thankyou! @tarun26091999