Given a string str containing only lowercase characters. The task is to print the characters having an odd frequency in the order of their occurrence.
Note: Repeated elements with odd frequency are printed as many times they occur in order of their occurrences.
Input: str = “geeksforgeeks”
Character Frequency ‘g’ 2 ‘e’ 4 ‘k’ 2 ‘s’ 2 ‘f’ 1 ‘o’ 1 ‘r’ 1
‘f’, ‘o’ and ‘r’ are the only characters with odd frequencies.
Input: str = “elephant”
Approach: Create a frequency array to store the frequency of each of the character of the given string str. Traverse the string str again and check whether the frequency of that character is odd. If yes, then print the character.
Below is the implementation of the above approach:
Time Complexity: O(n)
Auxiliary Space: O(1)
- Print characters and their frequencies in order of occurrence
- Print characters and their frequencies in order of occurrence using a LinkedHashMap in Java
- Print 2-D co-ordinate points in ascending order followed by their frequencies
- Print the last occurrence of elements in array in relative order
- Print common characters of two Strings in alphabetical order
- Print all distinct characters of a string in order (3 Methods)
- Python code to print common characters of two Strings in alphabetical order
- Queries for frequencies of characters in substrings
- XOR of Prime Frequencies of Characters in a String
- Check whether the frequencies of all the characters in a string are prime or not
- Sum and Product of Prime Frequencies of Characters in a String
- Character whose frequency is equal to the sum of frequencies of other characters of the given string
- Print a Binary Tree in Vertical Order | Set 3 (Using Level Order Traversal)
- Queries to insert, delete one occurrence of a number and print the least and most frequent element
- Group multiple occurrence of array elements ordered by first occurrence
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.