String Compression - Strings & Arrays - Data Structures Interview Question - Part 6

Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or a phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words. Example: Input: "Tact Coa" Output: True (permutations: "taco cat", "acto cta", etc.)

00:00 - Introduction 01:58 - Brute Force Solution 06:25 - Exploring Palindromes 11:20 - Optimization - Sorting Initially 18:10 - Optimal Solution - HashMap 31:20 - Implementation 36:40 - Testing 40:10 - Summary

-————————————————————————————————————- Written Guides & Tutorials: https://tutorials.gn3.sh

NOTE: I am not a teacher by any means, these videos are just to help me improve my understanding.

Thanks for Watching! ... https://www.youtube.com/watch?v=aobg3cVzNOo