# HashMap & HashSet & Sliding Window

- [Make Sum Divisible by P](/interview-prep/hashmap-and-hashset-and-sliding-window/make-sum-divisible-by-p.md)
- [Largest Continuous Sequence Zero Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/largest-continuous-sequence-zero-sum.md)
- [2 Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/2-sum.md)
- [4 Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/4-sum.md)
- [Diffk II](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled.md)
- [Group Anagrams](/interview-prep/hashmap-and-hashset-and-sliding-window/group-anagrams.md)
- [Copy List with Random Pointer](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-1.md)
- [Equal](/interview-prep/hashmap-and-hashset-and-sliding-window/equal.md)
- [Longest Substring Without Repeating Characters](/interview-prep/hashmap-and-hashset-and-sliding-window/longest-substring-without-repeating-characters.md)
- [Find the longest substring with k unique characters in a given string](/interview-prep/hashmap-and-hashset-and-sliding-window/find-the-longest-substring-with-k-unique-characters-in-a-given-string.md)
- [Longest Substring with At Most K Distinct Characters](/interview-prep/hashmap-and-hashset-and-sliding-window/longest-substring-with-at-most-k-distinct-characters.md)
- [Subarrays with K Different Integers](/interview-prep/hashmap-and-hashset-and-sliding-window/subarrays-with-k-different-integers.md)
- [Number of Substrings Containing All Three Characters](/interview-prep/hashmap-and-hashset-and-sliding-window/number-of-substrings-containing-all-three-characters.md)
- [Minimum Window Substring](/interview-prep/hashmap-and-hashset-and-sliding-window/minimum-window-substring.md)
- [Minimum Size Subarray Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/minimum-size-subarray-sum.md)
- [Shortest Subarray with Sum at Least K](/interview-prep/hashmap-and-hashset-and-sliding-window/shortest-subarray-with-sum-at-least-k.md)
- [Fraction to Recurring Decimal](/interview-prep/hashmap-and-hashset-and-sliding-window/fraction-to-recurring-decimal.md)
- [Max Points on a Line](/interview-prep/hashmap-and-hashset-and-sliding-window/max-points-on-a-line.md)
- [Substring with Concatenation of All Words](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-2.md)
- [Distinct Numbers in Window](/interview-prep/hashmap-and-hashset-and-sliding-window/distinct-numbers-in-window.md)
- [4Sum II](/interview-prep/hashmap-and-hashset-and-sliding-window/4sum-ii.md)
- [Hotel Reviews](/interview-prep/hashmap-and-hashset-and-sliding-window/hotel-reviews.md)
- [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/interview-prep/hashmap-and-hashset-and-sliding-window/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md)
- [Top K Frequent Elements](/interview-prep/hashmap-and-hashset-and-sliding-window/top-k-frequent-elements.md)
- [Minimum Time to Collect All Apples in a Tree](/interview-prep/hashmap-and-hashset-and-sliding-window/minimum-time-to-collect-all-apples-in-a-tree.md)
- [Longest Substring with At Least K Repeating Characters](/interview-prep/hashmap-and-hashset-and-sliding-window/longest-substring-with-at-least-k-repeating-characters.md)
- [People Whose List of Favorite Companies Is Not a Subset of Another List](/interview-prep/hashmap-and-hashset-and-sliding-window/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.md)
- [Rearrange Words in a Sentence](/interview-prep/hashmap-and-hashset-and-sliding-window/rearrange-words-in-a-sentence.md)
- [Longest Well-Performing Interval](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-3.md)
- [Sort Characters By Frequency](/interview-prep/hashmap-and-hashset-and-sliding-window/sort-characters-by-frequency.md)
- [Rabbits in Forest](/interview-prep/hashmap-and-hashset-and-sliding-window/rabbits-in-forest.md)
- [Image Overlap](/interview-prep/hashmap-and-hashset-and-sliding-window/image-overlap.md)
- [Brick Wall](/interview-prep/hashmap-and-hashset-and-sliding-window/brick-wall.md)
- [Subarray Sums Divisible by K](/interview-prep/hashmap-and-hashset-and-sliding-window/subarray-sums-divisible-by-k.md)
- [Swap For Longest Repeated Character Substring](/interview-prep/hashmap-and-hashset-and-sliding-window/swap-for-longest-repeated-character-substring.md)
- [Short Encoding of Words](/interview-prep/hashmap-and-hashset-and-sliding-window/short-encoding-of-words.md)
- [Find Duplicate File in System](/interview-prep/hashmap-and-hashset-and-sliding-window/find-duplicate-file-in-system.md)
- [Binary Subarrays With Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-4.md)
- [Contiguous Array](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-5.md)
- [Subarrays with equal 1s and 0s](/interview-prep/hashmap-and-hashset-and-sliding-window/subarrays-with-equal-1s-and-0s.md)
- [Equal 0, 1 and 2](/interview-prep/hashmap-and-hashset-and-sliding-window/equal-0-1-and-2.md)
- [Implement Magic Dictionary](/interview-prep/hashmap-and-hashset-and-sliding-window/implement-magic-dictionary.md)
- [Contains Duplicate III](/interview-prep/hashmap-and-hashset-and-sliding-window/contains-duplicate-iii.md)
- [Make Two Arrays Equal by Reversing Sub-arrays](/interview-prep/hashmap-and-hashset-and-sliding-window/make-two-arrays-equal-by-reversing-sub-arrays.md)
- [Check If a String Contains All Binary Codes of Size K](/interview-prep/hashmap-and-hashset-and-sliding-window/check-if-a-string-contains-all-binary-codes-of-size-k.md)
- [Prison Cells After N Days](/interview-prep/hashmap-and-hashset-and-sliding-window/prison-cells-after-n-days.md)
- [Find Elements in a Contaminated Binary Tree](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-6.md)
- [Flip Columns For Maximum Number of Equal Rows](/interview-prep/hashmap-and-hashset-and-sliding-window/flip-columns-for-maximum-number-of-equal-rows.md)
- [Least Number of Unique Integers after K Removals](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-7.md)
- [Check Arithmetic Progression](/interview-prep/hashmap-and-hashset-and-sliding-window/check-arithmetic-progression.md)
- [X of a Kind in a Deck of Cards](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-8.md)
- [Morning Assembly](/interview-prep/hashmap-and-hashset-and-sliding-window/morning-assembly.md)
- [Isomorphic Strings](/interview-prep/hashmap-and-hashset-and-sliding-window/isomorphic-strings.md)
- [Line Reflection](/interview-prep/hashmap-and-hashset-and-sliding-window/line-reflection.md)
- [Grid Illumination](/interview-prep/hashmap-and-hashset-and-sliding-window/grid-illumination.md)
- [Maximum Frequency Stack](/interview-prep/hashmap-and-hashset-and-sliding-window/maximum-frequency-stack.md)
- [Length of the largest subarray with contiguous elements](/interview-prep/hashmap-and-hashset-and-sliding-window/length-of-the-largest-subarray-with-contiguous-elements.md)
- [Length of the largest subarray with contiguous elements](/interview-prep/hashmap-and-hashset-and-sliding-window/length-of-the-largest-subarray-with-contiguous-elements-1.md)
- [Find Two Non-overlapping Sub-arrays Each With Target Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/find-two-non-overlapping-sub-arrays-each-with-target-sum.md)
- [Snapshot Array](/interview-prep/hashmap-and-hashset-and-sliding-window/snapshot-array.md)
- [Count pairs in array whose sum is divisible by K](/interview-prep/hashmap-and-hashset-and-sliding-window/count-pairs-in-array-whose-sum-is-divisible-by-k.md)
- [Pairs of Non Coinciding Points](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-9.md)
- [Find Anagram Mappings](/interview-prep/hashmap-and-hashset-and-sliding-window/find-anagram-mappings.md)
- [Smallest subarray with all occurrences of a most frequent element](/interview-prep/hashmap-and-hashset-and-sliding-window/smallest-subarray-with-all-occurrences-of-a-most-frequent-element.md)
- [Insert Delete GetRandom O(1) - Duplicates allowed](/interview-prep/hashmap-and-hashset-and-sliding-window/insert-delete-getrandom-o-1-duplicates-allowed.md)
- [Making File Names Unique](/interview-prep/hashmap-and-hashset-and-sliding-window/making-file-names-unique.md)
- [Avoid Flood in The City](/interview-prep/hashmap-and-hashset-and-sliding-window/avoid-flood-in-the-city.md)
- [Unique Word Abbreviation](/interview-prep/hashmap-and-hashset-and-sliding-window/unique-word-abbreviation.md)
- [Discrepancies in the Voters List](/interview-prep/hashmap-and-hashset-and-sliding-window/discrepancies-in-the-voters-list.md)
- [Check If Array Pairs Are Divisible by k](/interview-prep/hashmap-and-hashset-and-sliding-window/check-if-array-pairs-are-divisible-by-k.md)
- [Max Value of Equation](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-10.md)
- [Number of Sub-arrays With Odd Sum](/interview-prep/hashmap-and-hashset-and-sliding-window/number-of-sub-arrays-with-odd-sum.md)
- [Number of Good Ways to Split a String](/interview-prep/hashmap-and-hashset-and-sliding-window/number-of-good-ways-to-split-a-string.md)
- [Remove minimum elements from either side such that 2\*min becomes more than max](/interview-prep/hashmap-and-hashset-and-sliding-window/untitled-11.md)
