Count Nice Pairs in an Array - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
1814. Count Nice Pairs in an Array
Medium
30 Points
Array
Hash Table
Math
Counting
You are given an array nums that consists of non-negative integers. Let us define rev(x) as the reverse of the non-negative integer x. For example, rev(123) = 321, and rev(120) = 21. A pair of indices (i, j) is nice if it satisfies all of the following conditions:
Return the number of nice pairs of indices. Since that number can be too large, return it modulo 109 + 7.
You are given an array nums that consists of non-negative integers. Let us define rev(x) as the reverse of the non-negative integer x. For example, rev(123) = 321, and rev(120) = 21. A pair of indices (i, j) is nice if it satisfies all of the following conditions:
Return the number of nice pairs of indices. Since that number can be too large, return it modulo 109 + 7.