##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Entry problem for sets
Given a sentence, count how many unique words it contains. Input: A single line of lowercase words separated by spaces. Output: The count of unique words. Example: - Input: "the quick brown fox jumps over the lazy dog" - Output: 8 The word "the" appears twice, but counts only once.
Before reading the solution, think about which data structure makes this trivial.
