{"id":"nice-substring-worst-case-quadratic","text":"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.","truth_value":"IN","source":"entries/2026/06/06/longest-nice-substring-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"nice-substring-worst-case-quadratic","truth_value":"IN","reason":"premise"}]}}