← All problemsSign in

3267. Count Almost Equal Pairs II

LeetCodeArrayHash TableSortingCountingEnumerationOpen on judge ↗

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: - Choose either x or y and swap any two digits within the chosen number. Return the number of indi

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start