Skip to content
Noteshch-log
AboutSupport
< Back to notes

Browse 4 notes tagged frequency counting.

#frequency counting

LeetCode 424: Longest Repeating Character Replacement in TypeScript

Keep the submitted frequency-counting sliding-window solution and explain why maxFreq can retain its historical maximum.

#LeetCode#Blind 75#TypeScript+5
2026-09-03

LeetCode 49: Group Anagrams in TypeScript, From Sorting Keys to Count Signatures

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

#LeetCode#Blind 75#TypeScript+5
2026-09-01

LeetCode 347: Top K Frequent Elements in TypeScript, From Frequency Sorting to Buckets

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

#LeetCode#Blind 75#TypeScript+5
2026-09-01

LeetCode 242: Valid Anagram in TypeScript, From Sorting to Character Counts

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

#LeetCode#Blind 75#TypeScript+5
2026-08-31
Copyright ©2025-2026 hch-log.com. All rights reserved.
Written by Hung-Chih Hsueh ↗ · g3n-data ↗ · All links ↗
Support on Ko-fiAboutPrivacy Policy

Google services settings

Analytics and advertising stay off until you choose.

En中文