Скачать или смотреть Longest Palindrome String

Question: Longest Palindrome
Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.
Letters are case sensitive, for example, "Aa" is not considered a palindrome here.
Approach: Greedy Algorithm
Count how many times each character appears in the given string.
Add up the lengths of all characters that appear an even number of times.
Additionally, if there is at least one character that appears an odd number of times, it adds one to the total length.
This gives us the length of the longest possible palindrome that can be formed using the characters in the string.

Time complexity: O(n)
Space complexity is O(k), where k is the number of unique characters in the string.

Code: https://github.com/LeandrAnders0n/DSA-/blo...

#softwareengineer #dsa #interviewpreparation