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.

Sign up for GitHub

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

Jump to bottom

Solve Problem 2762. Continuous Subarrays #2265

Open
threeal opened this issue Dec 14, 2024 · 0 comments · May be fixed by #2266
Open

Solve Problem 2762. Continuous Subarrays #2265

threeal opened this issue Dec 14, 2024 · 0 comments · May be fixed by #2266
Assignees
@threeal
Labels
feat test
Milestone
December 2024

Comments

@threeal
Copy link
Owner

threeal commented Dec 14, 2024

This issue suggests solving the problem 2762. Continuous Subarrays. To achieve this, we can utilize a sliding window to find the largest subarrays that meet the requirements while maintaining the maximum or minimum values in the subarray for an optimal requirement check.
@threeal threeal added this to the December 2024 milestone Dec 14, 2024
@threeal threeal self-assigned this Dec 14, 2024
@threeal threeal linked a pull request Dec 14, 2024 that will close this issue
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@threeal threeal

Labels
feat test
Projects
None yet
Milestone
December 2024
Development

Successfully merging a pull request may close this issue.

Solve Problem 2762. Continuous Subarrays threeal/leetspace
1 participant
@threeal