Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Challenge: Using Stack to Find Palindrome | Advanced Data Structures
Algorithms and Data Structures Overview
course content

Contenido del Curso

Algorithms and Data Structures Overview

Algorithms and Data Structures Overview

1. Introduction to ADS
2. List and Array
3. Advanced Data Structures
4. Graphs

bookChallenge: Using Stack to Find Palindrome

Tarea

The palindrome checker task involves determining whether a given string is a palindrome or not. A palindrome is a sequence of characters that reads the same forwards and backward, ignoring spaces, punctuation, and capitalization.
For example, the following words are palindromes: level, radar, and madam.

We can use stack to solve this task effectively!.
By pushing characters onto the stack in the order they appear in the string, we can then pop characters off the stack and compare them with those from the string. This approach allows us to simultaneously compare characters from both ends of the string, making it an effective way to check for palindromes.

Your task is to fill in all gaps in is_palindrome().

Switch to desktopCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones
¿Todo estuvo claro?

¿Cómo podemos mejorarlo?

¡Gracias por tus comentarios!

Sección 3. Capítulo 3
toggle bottom row

bookChallenge: Using Stack to Find Palindrome

Tarea

The palindrome checker task involves determining whether a given string is a palindrome or not. A palindrome is a sequence of characters that reads the same forwards and backward, ignoring spaces, punctuation, and capitalization.
For example, the following words are palindromes: level, radar, and madam.

We can use stack to solve this task effectively!.
By pushing characters onto the stack in the order they appear in the string, we can then pop characters off the stack and compare them with those from the string. This approach allows us to simultaneously compare characters from both ends of the string, making it an effective way to check for palindromes.

Your task is to fill in all gaps in is_palindrome().

Switch to desktopCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones
¿Todo estuvo claro?

¿Cómo podemos mejorarlo?

¡Gracias por tus comentarios!

Sección 3. Capítulo 3
toggle bottom row

bookChallenge: Using Stack to Find Palindrome

Tarea

The palindrome checker task involves determining whether a given string is a palindrome or not. A palindrome is a sequence of characters that reads the same forwards and backward, ignoring spaces, punctuation, and capitalization.
For example, the following words are palindromes: level, radar, and madam.

We can use stack to solve this task effectively!.
By pushing characters onto the stack in the order they appear in the string, we can then pop characters off the stack and compare them with those from the string. This approach allows us to simultaneously compare characters from both ends of the string, making it an effective way to check for palindromes.

Your task is to fill in all gaps in is_palindrome().

Switch to desktopCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones
¿Todo estuvo claro?

¿Cómo podemos mejorarlo?

¡Gracias por tus comentarios!

Tarea

The palindrome checker task involves determining whether a given string is a palindrome or not. A palindrome is a sequence of characters that reads the same forwards and backward, ignoring spaces, punctuation, and capitalization.
For example, the following words are palindromes: level, radar, and madam.

We can use stack to solve this task effectively!.
By pushing characters onto the stack in the order they appear in the string, we can then pop characters off the stack and compare them with those from the string. This approach allows us to simultaneously compare characters from both ends of the string, making it an effective way to check for palindromes.

Your task is to fill in all gaps in is_palindrome().

Switch to desktopCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones
Sección 3. Capítulo 3
Switch to desktopCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones
some-alt