tag:blogger.com,1999:blog-694855878384792308.post3144583727346352133..comments2023-03-22T04:37:19.571-07:00Comments on Java67: [Solved] How to check if two String are Anagram in Java? Examplejavin paulhttp://www.blogger.com/profile/15028902221295732276noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-694855878384792308.post-70501270536950186212022-09-14T22:41:33.641-07:002022-09-14T22:41:33.641-07:00O(n) algorithm is straightforward, where n is leng...O(n) algorithm is straightforward, where n is length of the string. Keep count for number of times each character appears in string. If more than one character appears odd number of times, the string cannot be anagram of a palindrome, otherwise string is anagram of a palindrome.Wordy Alexhttps://wordmaker.info/how-many/string.htmlnoreply@blogger.com