solves longest palindrome in python

Author: anishLearnsToCode

README.md

@@ -110,7 +110,7 @@
 | 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/SumOfLeftLeaves.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/sum_of_left_leaves.py) |
 | 405 | [Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/ConvertNumberToHexadecimal.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/convert_a_number_to_hexadecimal.py) |
 | 408 | 🔒 [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) | Easy | |
-| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/LongestPalindrome.java) |
+| 409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/LongestPalindrome.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/longest_palindrome.py) |
 | 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/FizzBuzz.java) |
 | 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/ThirdMaximumNumber.java) |
 | 415 | [Add Strings](https://leetcode.com/problems/add-strings) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/AddString.java) |

python/longest_palindrome.py

@@ -0,0 +1,14 @@
+class Solution:
+    def longestPalindrome(self, s: str) -> int:
+        character_frequency = {}
+        for character in s:
+            character_frequency[character] = character_frequency.get(character, 0) + 1
+        length = 0
+        had_odd_length = False
+        for frequency in character_frequency.values():
+            if frequency % 2 == 0:
+                length += frequency
+            else:
+                length += frequency - 1
+                had_odd_length = True
+        return length + int(had_odd_length)