Parallel Scan 알고리즘을 통한 괄호 매칭 작업의 O(log n) 시간 복잡도 달성
Parallel Parentheses Matching
Parallel Parentheses Matching
How prefix-sum binary search makes text line-breaking O(log n) with zero allocation
Running State Pattern — LeetCode #1480: Running Sum of 1D Array