Program To Check If A String Is Palindrome Using Recursion | FREE DSA Course in JAVA | Lecture 35

Video Description

Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - https://youtube.com/playlist?list=PLU83Ru7iGtAvP1rqt65MCDSBPFCzUKGXG a We are up with the lecture 35 of our much awaited dsa course in java. Is there something special with the word - RACECAR? Yes it reads same from both the side ie. it is a palindrome. Today we will see a program to find whether a string is a palindrome or not? Wait Wait Wait, we already covered this program in our previous lectures. Yes but today we will see how wecan solve this program using recursion. Recursion gives us a more effective way to solve this program in less time. Let's see the logic behind the palindrome program in java. Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course. For more information, fill this form: https://forms.gle/8eiUmM92Fx563Aen9 or call us at 8884881203 Facebook: https://www.facebook.com/thetapacademy Instagram:https://www.instagram.com/tapacademy_online Linkedin: https://www.linkedin.com/company/73820805 Website: https://www.thetapacademy.com​ #dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder #bitmanipulation