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

Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - • Data Structures And Al...
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: forms.gle/8eiU...
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: www.thetapacad...​
#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder #bitmanipulation

[@HarishSubash]

such a professional teacher...Good Explanation

[@ningus8522]

Thank you so much sir 🙏

[@sayantikasayantika858]

Honesty very nicely explained each and every thing

[@its-krishna-vani]

The Base condition should be if( i >= j) {...} not (i

[@anwar6971]

Very well explained

[@believer_foreverr]

Wow!!

[@premmore2304]

Sir how to solve leetcode question for palindrome?

[@shubhamdevghare7846]

❤❤❤

[@A2Z_Education_Academy]

Sir, this is failing 10 cases in GFG when using java,Could you please tell what needs to be modified in the code?

[@tgmani4525]

Go with iterative code it will work

[@MahadevaPrasadMM]

change base case into if (J < = i ) into if( j < i+1)

[@its-krishna-vani]

The Base condition should be if( i >= j) {...} not (i

[@vaddiralanagesh477]

Vey lag