564. Find the Closest Palindrome | maths | strings | Leetcode Daily Challenge | DSA | Hindi
Problem Name:
564. Find the Closest Palindrome
Problem Statement:
Given a string n representing an integer, return the closest integer (not including itself), which is a palindrome. If there is a tie, return the smaller one.
The closest is defined as the absolute difference minimized between two integers.
Problem Link:
https://leetcode.com/problems/find-th...
Solution Link:
https://github.com/Tiwarishashwat/Int...
Graph Playlist:
• Graph Data Structure Series
Java Plus DSA Placement Course Playlist:
• Playlist
Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...
Notes:
https://github.com/Tiwarishashwat/Jav...
Telegram Link:
https://shashwattiwari.page.link/tele...
Ultimate Recursion Series Playlist:
• Playlist
Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...
Samsung Interview Experience:
• I cracked Samsung | SRIB Interview Experie...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
0:59 - what is palindrome
2:36 - how to make minimum change in a number
4:58 - prev and next palindrome
9:20 - all 9's and 1 0's 1
13:17 - forming palindrome using firsthalf
18:15 - time and space complexity
19:15 - code
#ShashwatTiwari #coding #problemsolving