LeetCode #1512 - Number of Good Pairs | Brute Force C++ Solution

🚀 In this video, I solve LeetCode 1512 - Number of Good Pairs using C++ with a simple and beginner-friendly explanation.

📌 Approach:

Use two nested loops to check every pair
Compare nums[i] with nums[j]
If both values are equal and i less than j, increase count
Return total number of good pairs

🔗 GitHub:
https://github.com/AnshPatel191207/

🧠 LeetCode Profile:
https://leetcode.com/u/AnshPatel191207/

💼 LinkedIn:
https://www.linkedin.com/in/anshpatel191207/

📝 Notes:

Problem: Number of Good Pairs
Difficulty: Easy
Language: C++
Topics: Array, Hash Table, Brute Force

#leetcode #cpp #dsa #codinginterview #programming #leetcodeeasy #arrays #bruteforce

Видео LeetCode #1512 - Number of Good Pairs | Brute Force C++ Solution канала Ansh Patel