An interactive SVG-based visualization engine demonstrating the O(N log N) optimization of the Longest Flat Subsequence problem using Segment Trees and Coordinate Compression.
-
Updated
Jun 20, 2026 - JavaScript
An interactive SVG-based visualization engine demonstrating the O(N log N) optimization of the Longest Flat Subsequence problem using Segment Trees and Coordinate Compression.
Two-stack integer sorting with strict input parsing, coordinate compression, chunk-based optimization, and bonus checker.
Add a description, image, and links to the coordinate-compression topic page so that developers can more easily learn about it.
To associate your repository with the coordinate-compression topic, visit your repo's landing page and select "manage topics."