mediumArrayCountingEnumerationHash TableSorting 0 views

Count Almost Equal Pairs I

You are given an array nums consisting of positive integers.

You are given an array nums consisting of positive integers.

We call two integers x and y in this problem almost equal if both integers can become equal after performing the following operation at most once:

Return the number of indices i and j in nums where i < j such that nums[i] and nums[j] are almost equal.

Note that it is allowed for an integer to have leading zeros after performing an operation.

Count Almost Equal Pairs I diagram

Example 1

Input: nums = [3,12,30,17,21]

Output: 2

Explanation: The almost equal pairs of elements are:

Example 2

Input: nums = [1,1,1,1,1]

Output: 10

Explanation: Every two elements in the array are almost equal.

Example 3

Input: nums = [123,231]

Output: 0

Explanation: We cannot swap any two digits of 123 or 231 to reach the other.

Constraints

  • 2 <= nums.length <= 100
  • 1 <= nums[i] <= 10^6

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.