Given a very long list of URLs, find the first URL which is unique ( occurred exactly once ).
Approach:
Iterate through the urls, and store them in linkedHashMap (keys are stored in doubly linklist and the insertion order is maintained).
Whenever you encounter that some key (url) already exists, delete the entry in the linkedHashMap.
In the end you will have only non-repeated urls in the linkedHashMap.
the first entry (head) of the linkedHashMap will be the first non repeated URL.
Time complexity: theta of N, space complexity: O(N)
Sample Input:
String [] str = { "http://www.google.com/",
"http://www.yahoo.com/",
"http://www.amazon.com/",
"http://www.apache.com/",
"http://www.google.com/",
"http://www.mycar.com/",
"http://www.microsoft.com/",
"http://www.casandra.com/",
"http://www.apache.com/",
"http://www.google.com/",
"http://www.oracle.com/",
"http://www.yahoo.com/",
"http://www.oracle.com/",
"http://www.facebook.com/",
"http://www.pandora.com/",
"http://www.microsoft.com/",
"http://www.google.com/",
"http://www.mycar.com/",
"http://www.amazon.com/",
"http://www.apple.com/",
};
Sample output:
1 : http://www.casandra.com/
1 : http://www.facebook.com/
1 : http://www.pandora.com/
1 : http://www.apple.com/
First Non Repeated URL: http://www.casandra.com/
Approach:
Iterate through the urls, and store them in linkedHashMap (keys are stored in doubly linklist and the insertion order is maintained).
Whenever you encounter that some key (url) already exists, delete the entry in the linkedHashMap.
In the end you will have only non-repeated urls in the linkedHashMap.
the first entry (head) of the linkedHashMap will be the first non repeated URL.
Time complexity: theta of N, space complexity: O(N)
Sample Input:
String [] str = { "http://www.google.com/",
"http://www.yahoo.com/",
"http://www.amazon.com/",
"http://www.apache.com/",
"http://www.google.com/",
"http://www.mycar.com/",
"http://www.microsoft.com/",
"http://www.casandra.com/",
"http://www.apache.com/",
"http://www.google.com/",
"http://www.oracle.com/",
"http://www.yahoo.com/",
"http://www.oracle.com/",
"http://www.facebook.com/",
"http://www.pandora.com/",
"http://www.microsoft.com/",
"http://www.google.com/",
"http://www.mycar.com/",
"http://www.amazon.com/",
"http://www.apple.com/",
};
Sample output:
1 : http://www.casandra.com/
1 : http://www.facebook.com/
1 : http://www.pandora.com/
1 : http://www.apple.com/
First Non Repeated URL: http://www.casandra.com/
Great solution. Just wanted to mention
ReplyDelete"In the end you will have only non-repeated urls in the linkedHashMap." --> this will not be right since imagine we have an element which is repeated 3 times. What will happen on each appearance:
1st: add it to the LL
2nd: remove it from the LL
3rd: add it to the LL
So finally we will have it in the LLMap but still it will not be unique.
Ya georgi kalchev is right. This solution is wrong
ReplyDelete