hash-map

A 3Sum solution using sorting and a two-sum-style hash map approach.

A comparison of sorting and character counting for the Valid Anagram problem.

Using frequency counting and bucket arrays to return the top k frequent elements

Comparing brute force, two-pass hash map, and one-pass hash map approaches for Two Sum