Created 1512_Number of Good Pairs.py

[OjasTulswani]

Flow of Program -

1. The class is initialized with an array of integers nums.
2. Inside the class, a dictionary is used to count how many times each number appears in the nums array.
3. It then iterates through the nums array, updating the count for each number in the dictionary.
4. After counting, it calculates the number of good pairs for each number (where a good pair is two equal numbers with the first one occurring before the second).
5. Finally, it returns the total count of good pairs for the entire nums array.
   List any dependencies that are required for this change.

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• Test A
• Test B

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!