Given a linked list of size N consisting of a string as node value, the task is to find the majority string, having frequency greater than [N/3], in the linked list.
Note: It is guaranteed that there is only one majority string.
Input: head -> geeks -> geeks -> abcd -> game -> knight -> geeks -> harry.
The frequency of geeks string in link list is 3 which is greater than [7/3] i.e 2.
Input: head -> hot -> hot -> cold -> hot -> hot
The frequency of hot string in the link list is 4 which is greater than [5/3] i.e 1.
Store the frequency of every string in a Map. Traverse the map and look for the string whose frequency is ≥ N / 3.
Time Complexity: O(N)
Auxiliary Space: O(N)
The idea is based on Moore’s Voting algorithm.
Find two candidates and check if any of these two candidates is actually a majority element or not.
Below is the implementation of the above approach:
Time Complexity: O(N)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Maximum difference between frequency of two elements such that element having greater frequency is also greater
- Create new linked list from two given linked list with greater element at each node
- Count pairs (p, q) such that p occurs in array at least q times and q occurs at least p times
- Count pairs in an array such that frequency of one is at least value of other
- Count of Substrings with at least K pairwise Distinct Characters having same Frequency
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Count of Binary Strings of length N such that frequency of 1's exceeds frequency of 0's
- Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
- Count minimum frequency elements in a linked list
- Sum of all odd frequency nodes of the Linked List
- Create a linked list from two linked lists by choosing max element at each position
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Merge a linked list into another linked list at alternate positions
- Convert singly linked list into circular linked list
- Difference between Singly linked list and Doubly linked list
- Convert Singly Linked List to XOR Linked List
- Generate Linked List consisting of maximum difference of squares of pairs of nodes from given Linked List
- Check if a linked list is Circular Linked List
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.
Improved By : stutipathak31jan