Company: Deutsche_Bank_IIT_Guwahati (Graduate Analyst role)
Difficulty: medium
Problem Description Given a String, need to find the maximum number of 3-lettered palindromes by using each letter a maximum of once in one word. (Letters can be skipped if you do not want to use them.) Examples Example 1 Input: s = "aaaabc" Output: 2 Explanation: We can form two palindromes, for example "aba" and "aca". Example 2 Input: s = "fknfkn" Output: 2 Explanation: We can form two palindromes, for example "fkf" and "nkn". Example 3 Input: s = "dd" Output: 0