Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

DSA Question: Find Maximum Element in Every Sliding Window of Size K #164

Open
skanarul8002 opened this issue Oct 9, 2024 · 4 comments
Open

Comments

@skanarul8002
Copy link
Contributor

skanarul8002 commented Oct 9, 2024

Description: Implement a solution to find the maximum element in every sliding window of size K for a given array of integers. This is a commonly asked interview problem in coding assessments and competitive programming, aimed at testing proficiency with data structures like queues or deques.

Kindly assign me this issue under Hacktoberfest 2024, Thank you @DhanushNehru !!

@ADeshmukh80
Copy link
Contributor

please assign this issue to me

@NilanshuRanjan
Copy link

Please assign me this algorithm under hactoberfest. please i need this for my grades at my college !!!

@anu098jaiswal
Copy link
Contributor

can you assign me this

@guptushar27
Copy link

kindly please assign this to me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

6 participants