Skip to content
Noteshch-log
AboutSupport
< Back to notes

Browse 2 notes tagged sorting.

#sorting

LeetCode 15: 3Sum in TypeScript, Why Skipping Duplicates Does Not Lose Answers

My progression from a global Set that loses answers to two pointers, with an explanation of all three duplicate checks, complexity, and executable assertions.

#LeetCode#Blind 75#TypeScript+3
2026-09-07

LeetCode 56: Merge Intervals in TypeScript

Derive a TypeScript merge-intervals solution through sorting, one linear scan, input immutability, and an honest O(n log n) complexity analysis.

#LeetCode#TypeScript#algorithms+3
2026-08-24
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中文