30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 564. Find the Closest Palindrome

Given a numeric string n (up to 18 digits), find the closest integer palindrome different from n (ties broken by smaller value). The typical approach is to generate candidate palindromes by adjusting and mirroring the prefix and including boundary cases (e.g., 10^k±1, all 9s), then pick the candidate with minimal absolute difference.

Asked at:

Uber

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid October, 2025

Uber

Senior

Mid August, 2025

Uber

Mid-level

Late July, 2025

Uber

Mid-level

Get Premium to View All 6 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 564. Find the Closest Palindrome

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact