[English] Advent of code Day 9 Part 2 - O(nlogn) solution

[@ren164]

Thank you so much for this! I had thought about storing the indices for the free space blocks in order but couldn't figure out how to implement it. Went from a 30+ minute brute-force disaster that didn’t even yield the correct result to a 0.02s valid run, lol.

[@Svanar2]

Thank you. I really enjoyed your video :)

[@Tania-lz3my]

Thanks! It was really helpful

[@Entertainmentexe]

Thanks for the video I use Segment tree + Binary search to get an O(n log n) Solution.