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

I want to contribute a solution of leetcode problem number 1512 #439

Open
OjasTulswani opened this issue Oct 4, 2023 · 1 comment
Open

I want to contribute a solution of leetcode problem number 1512 #439

OjasTulswani opened this issue Oct 4, 2023 · 1 comment

Comments

@OjasTulswani
Copy link

PS - Given an array of integers nums, return the number of good pairs.

A pair (i, j) is called good if nums[i] == nums[j] and i < j.
@welcome
Copy link

welcome bot commented Oct 4, 2023

Thanks for helping us improve and opening your first issue here! Don't forget to give us a 🌟 to support us.

While you're waiting, I just wanted to make sure you've had a chance to look at our Readme and Pull Request Guidelines.

Sidd7000 added a commit to Sidd7000/LeetCode-Solutions that referenced this issue Oct 17, 2023
@Sidd7000
Create 1512. good pairs.cpp
25324fc 
Solved issue codedecks-in#439
@Sidd7000 Sidd7000 mentioned this issue Oct 17, 2023
Open
10 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@OjasTulswani