No Duplicates: Difference between revisions
Jump to navigation
Jump to search
imported>Kmk21 Created page with "This problem asks us whether any word in the input is duplicated. Store seen words in a hashmap. Even the n^2 brute force solution will work. Category:ICPC Problems Ca..." |
imported>Kmk21 No edit summary |
||
Line 8: | Line 8: | ||
[[Category:Implementation Trivial]] | [[Category:Implementation Trivial]] | ||
[[Category:Brute Force]] | [[Category:Brute Force]] | ||
[[Category:Hashmap]] |
Revision as of 23:50, 1 December 2017
This problem asks us whether any word in the input is duplicated.
Store seen words in a hashmap. Even the n^2 brute force solution will work.