Browse 5 notes tagged Map.

#Map

LeetCode 3: Longest Substring Without Repeating Characters in TypeScript

Keep an initial reset-and-rescan attempt, explain its O(n²) limit, then use a one-pass Map sliding window.

Work through a sorting-based Group Anagrams solution, its repeated-array-copy cost, and a count signature for the fixed lowercase alphabet.

Start with Map frequency counting and sorting, then remove the O(n log n) sort with frequency buckets.

Compare sorting, Map-based frequency differences, and a fixed-size count array for Valid Anagram, including correctness, invariants, and complexity.

Replace nested pair checks with a Map of earlier values and indices, then explain complement lookup, the loop invariant, and expected O(n) time.