In this video, we will be considering how to determine if a string is a palindrome permutation. Specifically:
Given a string, we wish to write a function to determine 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.
This video is part of a series on string processing and, specifically, on how these problems tend to show up in the context of a technical interview:
http://bit.ly/lp_string
This video is also part of an "Algorithm" series. For more algorithm tutorials:
http://bit.ly/lp_algos
The software written in this video is available at:
https://github.com/vprusso/youtube_tutorials/blob/master/algorithms/string_processing/is_palindrome_permutation.py
Do you like the development environment I'm using in this video? It's a customized version of vim that's enhanced for Python development. If you want to see how I set up my vim, I have a series on this here:
http://bit.ly/lp_vim
If you've found this video helpful and want to stay up-to-date with the latest videos posted on this channel, please subscribe:
http://bit.ly/lp_subscribe
