Afrikaans
Akan
Albanian
Amharic
Arabic
Armenian
Azerbaijani
Basque
Belarusian
Bemba
Bengali
Bihari
Bosnian
Breton
Bulgarian
Cambodian
Catalan
Cebuano
Cherokee
Chichewa
Chinese (Simplified)
Chinese (Traditional)
Corsican
Croatian
Czech
Danish
Dutch
English
Esperanto
Estonian
Ewe
Faroese
Filipino
Finnish
French
Frisian
Ga
Galician
Georgian
German
Greek
Guarani
Gujarati
Haitian Creole
Hausa
Hawaiian
Hebrew
Hindi
Hmong
Icelandic
Igbo
Indonesian
Interlingua
Irish
Italian
Japanese
Javanese
Kannada
Kazakh
Kinyarwanda
Kirundi
Kongo
Korean
Krio (Sierra Leone)
Kurdish
Kurdish (Soranรฎ)
Kyrgyz
Laothian
Latin
Latvian
Lingala
Lithuanian
Lozi
Luganda
Luo
Luxembourgish
Macedonian
Malagasy
Malay
Malayalam
Maltese
Maori
Marathi
Mauritian Creole
Moldavian
Mongolian
Myanmar (Burmese)
Montenegrin
Nepali
Nigerian Pidgin
Northern Sotho
Norwegian
Norwegian (Nynorsk)
Occitan
Oriya
Oromo
Pashto
Persian
Polish
Portuguese (Brazil)
Portuguese (Portugal)
Punjabi
Quechua
Romanian
Romansh
Runyakitara
Russian
Samoan
Scots Gaelic
Serbian
Serbo-Croatian
Sesotho
Setswana
Seychellois Creole
Shona
Sindhi
Sinhalese
Slovak
Slovenian
Somali
Spanish
Spanish (Latin American)
Sundanese
Swahili
Swedish
Tajik
Tamil
Tatar
Telugu
Thai
Tigrinya
Tonga
Tshiluba
Tumbuka
Turkish
Turkmen
Twi
Uighur
Ukrainian
Urdu
Uzbek
Vietnamese
Welsh
Wolof
Xhosa
Yiddish
Yoruba
Zulu
Welcome back, ladies and gentlemen.
And if you've made it so far, that's definitely an achievement.
The materials in this chorus are not the easiest ones.
And there were a lot of opportunities to leave the course.
But still, you decided that you going to be commuted and you've made it so far at this point.
And for that, I want to tell you.
Well done.
You've also passed the string section successfully and now there is just a little bit left to finish
this section.
So let's get ready.
Get yourself something nice to drink and let's start with our awesome milestone.
So this milestone involves strings.
And particularly what we have to do is to write a program that checks whether a string entered by the
user is a palindrome or not.
And a palindrome is simply a term that says that if we read a given string from left to right, as we
usually do, and if we read the same string from right to left, starting from the rightmost element
up to the leftmost element, then we will see that both the strings will be the same.
So, for example, if we take the word, let's say noon and we can see that if we will read it from
the left to the right, we will get the word noon.
But also, if we will read this word from right to left.
OK.
Starting from the rightmost element to the left one, we will see also the same word which is known.
And what this means is that this specific string noone is actually a palindrome.
So there will be a lot of different strings which are palindrome.
No is one of them.
But if it would take the word, let's say Tak.
OK.
This is our new string and we read it from Ray or from right to left or from left to right.
We will get different strings.
So this means that the word attack is not a palindrome.
So once again, if we are to, let's say, summarize what a palindrome is, we can say that a palindrome
is simply when a string equals two, it's reverse string.
Is that clear?
And the last note for palindromes that I want you to know when to to actually refer when you're writing
your program is that palindromes can be of an even or an odd length.
For example, we've seen that the word noon is of an even length.
And it's actually a palindrome.
And if we take the word let's say wow.
Which is often odd length.
We can see that it's also a palindrome.
We can read it from right to left or from left, right.
And we still get the same word, meaning.
That's a palindrome.
So make sure that you support both of these options are both.
That strings may be palindrome even if the strings are even or odd length.
So once again, what you have to do is to write a program that simply checks for Given's three and use
palindrome or not.
And basically, based on the result are your program should print a corresponding message.
Now, there is more than just one way to solve it.
So give it a try.
Guys, I know you can do it.
And I'll see you in the next video.
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.