Скачать или смотреть K-Palindrome | GFG POTD | C++ | Java | Code Kar Lo

Given a string str of length n, find if the string is K-Palindrome or not. A k-palindrome string transforms into a palindrome on removing at most k characters from it.

0:00 Introduction
0:10 Problem Statement
0:45 Explanation
9:49 C++ Code
14:04 Java Code

My DSA Journey:-    • How Did I Learn Data Structure | DSA Journ...  

How to Earn By GFG Articles:-    • How to Write Article on GFG | How to Earn ...  

Infosys Coding Questions:-    • Infosys Coding Questions  

Problem Link:-https://www.geeksforgeeks.org/problem...

Code Link:-https://github.com/ShubhamKashyap138/...

Playlist Link:-   • Geeks for Geeks POTD  

Linkedin:-   / shubham-kashyap-65a29a218  

Instagram:- https://instagram.com/im_shubham_kash...

My GFG Profile:- https://auth.geeksforgeeks.org/user/s...

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg


#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming