I'd assume they store the 'profile ID' in a hash data structure on the cache server.

Or it could also be a probabilistic data structure like bloom filter.

Yet I don't think the space complexity is O(n^2), probably each person dislikes a limited number of people compared to the total users of Tinder.