# HashTable, HashMap, HashSet

- [(interesting one) 1002. Find Common Characters](/cracking-leetcode/hashtable/interesting-one-1002.-find-common-characters.md)
- [1171. Remove Zero Sum Consecutive Nodes from Linked List](/cracking-leetcode/hashtable/1171.-remove-zero-sum-consecutive-nodes-from-linked-list.md)
- [1647. Minimum Deletions to Make Character Frequencies Unique](/cracking-leetcode/hashtable/1647.-minimum-deletions-to-make-character-frequencies-unique.md)
- [1481. Least Number of Unique Integers after K Removals](/cracking-leetcode/hashtable/1481.-least-number-of-unique-integers-after-k-removals.md)
- [Page 8](/cracking-leetcode/hashtable/page-8.md)
- [2131. Longest Palindrome by Concatenating Two Letter Words](/cracking-leetcode/hashtable/2131.-longest-palindrome-by-concatenating-two-letter-words.md)
- [1679. Max Number of K-Sum Pairs](/cracking-leetcode/hashtable/1679.-max-number-of-k-sum-pairs.md)
- [1. Two Sum](/cracking-leetcode/hashtable/1.-two-sum.md)
- [36. Valid Sudoku](/cracking-leetcode/hashtable/36.-valid-sudoku.md)
- [49. Group Anagrams](/cracking-leetcode/hashtable/49.-group-anagrams.md)
- [170. Two Sum III - Data structure design](/cracking-leetcode/hashtable/170.-two-sum-iii-data-structure-design.md)
- [454. 4Sum II](/cracking-leetcode/hashtable/454.-4sum-ii.md)
- [242. Valid Anagram](/cracking-leetcode/hashtable/242.-valid-anagram.md)
- [243. Shortest Word Distance](/cracking-leetcode/hashtable/243.-shortest-word-distance.md)
- [244. Shortest Word Distance II](/cracking-leetcode/hashtable/244.-shortest-word-distance-ii.md)
- [245. Shortest Word Distance III](/cracking-leetcode/hashtable/245.-shortest-word-distance-iii.md)
- [350. Intersection of Two Arrays II](/cracking-leetcode/hashtable/350.-intersection-of-two-arrays-ii.md)
- [1160. Find Words That Can Be Formed by Characters](/cracking-leetcode/hashtable/1160.-find-words-that-can-be-formed-by-characters.md)
- [2032. Two Out of Three](/cracking-leetcode/hashtable/2032.-two-out-of-three.md)
- [981. Time Based Key-Value Store](/cracking-leetcode/hashtable/981.-time-based-key-value-store.md)
- [954. Array of Doubled Pairs](/cracking-leetcode/hashtable/954.-array-of-doubled-pairs.md)
- [2007. Find Original Array From Doubled Array](/cracking-leetcode/hashtable/2007.-find-original-array-from-doubled-array.md)
- [811. Subdomain Visit Count](/cracking-leetcode/hashtable/811.-subdomain-visit-count.md)
- [833. Find And Replace in String](/cracking-leetcode/hashtable/833.-find-and-replace-in-string.md)
- [1554. Strings Differ by One Character](/cracking-leetcode/hashtable/1554.-strings-differ-by-one-character.md)
- [846. Hand of Straights, 1296. Divide Array in Sets of K Consecutive Numbers](/cracking-leetcode/hashtable/846.-hand-of-straights-1296.-divide-array-in-sets-of-k-consecutive-numbers.md)
- [1512. Number of Good Pairs](/cracking-leetcode/hashtable/1512.-number-of-good-pairs.md)
- [387. First Unique Character in a String](/cracking-leetcode/hashtable/387.-first-unique-character-in-a-string.md)
- [1010. Pairs of Songs With Total Durations Divisible by 60](/cracking-leetcode/hashtable/1010.-pairs-of-songs-with-total-durations-divisible-by-60.md)
- [1152. Analyze User Website Visit Pattern](/cracking-leetcode/hashtable/1152.-analyze-user-website-visit-pattern.md)
- [1657. Determine if Two Strings Are Close](/cracking-leetcode/hashtable/1657.-determine-if-two-strings-are-close.md)
- [1347. Minimum Number of Steps to Make Two Strings Anagram](/cracking-leetcode/hashtable/1347.-minimum-number-of-steps-to-make-two-strings-anagram.md)
- [2598. Smallest Missing Non-negative Integer After Operations](/cracking-leetcode/hashtable/2598.-smallest-missing-non-negative-integer-after-operations.md)