Count Number of Bad Pairs #2364

Question

harshagrawal523 opened this issue 2 years ago · 3 comments

You are given a 0-indexed integer array nums. A pair of indices (i, j) is a bad pair if i < j and j - i != nums[j] - nums[i].

Return the total number of bad pairs in nums.

Answer 1 · 2022-10-06T20:08:18.000Z

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.

Answer 2 · 2022-10-15T08:24:19.000Z

hello!
I am very new to this open source community. I am interested in solving this problem. Can you guide me hoe to contribute the solution?

Answer 3 · 2022-10-17T17:41:47.000Z

Please assign this to me