Open Ayu-hack opened 1 month ago
Maximum Possible Number by Binary Concatenation
Can you please assign me this problem under Hacktoberfest 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.
@Sri5275 @SaurabhKumar171 assigned. please share the screenshot in PR.
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 ?
Hello @Ayu-hack, I would like to contribute by adding this week codechef contest problems. Please assign me this issue.
Thank You.
@SaurabhKumar171 @dhruvaaArya05 Assigned.
Hello @Ayu-hack , is it possible to submit this week's solution weekly codechef's contest
@SammyUrfen assigned
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! 🎉