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

maximum-product-of-two-elements-in-an-array #96

Open
ishita3513 opened this issue Oct 21, 2023 · 2 comments
Open

maximum-product-of-two-elements-in-an-array #96

ishita3513 opened this issue Oct 21, 2023 · 2 comments
Assignees
Labels
Difficult hactoberfest question Further information is requested

Comments

@ishita3513
Copy link
Contributor

Given the array of integers nums, you will choose two different indices i and j of that array.
Return the maximum value of (nums[i]-1)*(nums[j]-1).

@ishita3513
Copy link
Contributor Author

Hey, @Nikhil-2002 I am interested in this problem. I have solved this problem in 3 ways. I want to contribute to this issue.
Please assign me this issue.

@Nikhil-2002 Nikhil-2002 added question Further information is requested hactoberfest Difficult labels Oct 21, 2023
@ishita3513
Copy link
Contributor Author

Please assign.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Difficult hactoberfest question Further information is requested
Projects
None yet
Development

No branches or pull requests

2 participants