Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3265. Count Almost Equal Pairs I
Count the number of index pairs (i<j) such that one number can be transformed into the other by performing at most one swap of two digits within a single number (swaps may create leading zeros). In other words, determine how many pairs of string representations differ by at most a single intra-number digit swap.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.