hardArrayCountingEnumerationHash TableSorting 0 views

Count Almost Equal Pairs II

Attention: In this version, the number of operations that can be performed, has been increased to twice.

Attention: In this version, the number of operations that can be performed, has been increased to twice.

You are given an array nums consisting of positive integers.

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

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 II diagram

Example 1

Input: nums = [1023,2310,2130,213]

Output: 4

Explanation: The almost equal pairs of elements are:

Example 2

Input: nums = [1,10,100]

Output: 3

Explanation: The almost equal pairs of elements are:

Constraints

  • 2 <= nums.length <= 5000
  • 1 <= nums[i] < 10^7

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.