Status: IN
The divide-and-conquer approach is O(n^2) worst case when every split produces one empty and one n-1 partition (analogous to quicksort's worst case); best case is O(n log n) with balanced splits.
Source: entries/2026/06/06/longest-nice-substring-solution.md