Data structures and algorithms are among the most fundamental concepts of Computer Science. Whether it’s real-world problems you’re trying to solve or the typical coding question asked in an interview, almost every problem requires you to demonstrate a deep understanding of data structures and algorithms. 

This course is a detailed review of some of the most common data structures and algorithms that you’ll see in interviews and your everyday work. With implementation details, thorough explanations, and hands-on coding exercises, you’ll quickly gain the confidence you need to solve any problem, no matter the situation.

Data Structures and Algorithms in Python

In this lesson, we will consider how to determine if a string is a palindrome permutation. 

Specifically:

Given a string, write a function to check if it is a permutation of a palindrome.

Recall: 

>**Palindrome**: A word or phrase that is the same forwards and backward. 

>**Permutation**: A rearrangement of letters.

The palindrome does not need to be limited to just dictionary words.

Before jumping straight to the code, let's think about how we can approach this problem. Here is an example of a palindrome:

In this lesson, you will learn how to find if a string is a palindrome permutation or not. 

Introduction

Stack

Singly Linked Lists

Circular Linked Lists

Doubly Linked Lists

Arrays

Binary Trees

Binary Search Trees

Binary Search

Recursion

String Processing

Is Palindrome Permutation