Count distinct strings with your own hash table, then on a GPU

Given an array of strings, return how many distinct strings it contains, without using library hash sets or maps: build your own hash table with a hash function and collision handling.

Then explain how you would run it in parallel on a GPU: many threads inserting at once, atomic compare-and-swap on slots, open addressing versus chaining, and how variable-length strings are stored and compared.