Available question text
Given an integer N, find the nearest integer (by absolute difference, with usual tie-breaking) whose decimal representation has every digit occurring an even number of times — a "fair" integer. The task centers on constructing the closest number that satisfies digit-parity constraints, handling carries and possible length changes (solvable with digit-DP or greedy/backtracking over digits).
Related questions
Continue with questions that share topics or the same question type.
- Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
Coding
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
- Add to Array-Form of Integer
Coding
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2417. Closest Fair Integer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source