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

Add solution of Weekly Contest 2024. #19

Open
Ayu-hack opened this issue Oct 7, 2024 · 8 comments
Open

Add solution of Weekly Contest 2024. #19

Ayu-hack opened this issue Oct 7, 2024 · 8 comments
Assignees
Labels
hacktoberfest-accepted Marks a PR as valid under Hacktoberfest, counting towards participant contributions.

Comments

@Ayu-hack
Copy link
Owner

Ayu-hack commented Oct 7, 2024

Add solution of Weekly Contest 2024.

How to Contribute:
Fork the Repository: Create a copy of the repo under your GitHub account and ⭐ star the repo to show your support!
Find the Issue: Browse the issues, choose one you’d like to work on, and comment with "assign me."
Make a Pull Request (PR): Submit a PR with your solution. Include a screenshot of the working feature or bug fix to help us review it faster!
Your contributions are valuable, and we can't wait to see what you'll bring to the project! 🎉

@Ayu-hack Ayu-hack self-assigned this Oct 7, 2024
@Ayu-hack Ayu-hack added the hacktoberfest-accepted Marks a PR as valid under Hacktoberfest, counting towards participant contributions. label Oct 8, 2024
@SaurabhKumar171
Copy link
Contributor

Maximum Possible Number by Binary Concatenation

Can you please assign me this problem under Hacktoberfest 2024?
#Hacktoberfest2024

@Sri5275
Copy link
Contributor

Sri5275 commented Oct 8, 2024

3275.Kth - Nearest Obstacle Queries
Hey @Ayu-hack ,I would like to contribute to this repo with this problem, could you please assign me this issue under hactoberfest.

@Ayu-hack
Copy link
Owner Author

Ayu-hack commented Oct 8, 2024

@Sri5275 @SaurabhKumar171 assigned. please share the screenshot in PR.

@SaurabhKumar171
Copy link
Contributor

Title: Maximum Product

Description:
Given an integer array arr of length n and two integers l and r where l <= r, your task is to find the maximum possible product by selecting one element from the subarray arr[l : r] (inclusive) and another element from the remaining array (excluding the subarray). The objective is to maximize the product of these two selected elements. Both elements must come from different parts of the array—one from the subarray and the other from outside it.

Can you please assign me this problem ?
#Hacktoberfest2024

@dhruvaaArya05
Copy link
Contributor

Hello @Ayu-hack, I would like to contribute by adding this week codechef contest problems.
Please assign me this issue.

Thank You.

@Ayu-hack
Copy link
Owner Author

Ayu-hack commented Oct 8, 2024

@SaurabhKumar171 @dhruvaaArya05 Assigned.

Ayu-hack added a commit that referenced this issue Oct 10, 2024
Added Codechef Contest Problems #19
@SammyUrfen
Copy link

Hello @Ayu-hack , is it possible to submit this week's solution weekly codechef's contest

@Ayu-hack
Copy link
Owner Author

@SammyUrfen assigned

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
hacktoberfest-accepted Marks a PR as valid under Hacktoberfest, counting towards participant contributions.
Projects
None yet
Development

No branches or pull requests

5 participants