#1814

Count Nice Pairs in an Array

specialist · 890 · lc medium +31 · premium · verified · 48.5% accepted · 2,042 likes · top 34%

Description

Given a non-negative integer array nums with rev(x) defined as reversing the digits of x, a pair (i, j) is nice if 0 <= i < j and nums[i] + rev(nums[j]) == nums[j] + rev(nums[i]). Return the count of nice pairs modulo 10⁹ + 7.

Code

1

2

3

class Solution:
    def countNicePairs(self, nums: List[int]) -> int:

class Solution:
    def countNicePairs(self, nums: List[int]) -> int: