{"id":"index-pairs-brute-force-complexity","text":"indexPairs runs in O(W × N × L) time where W = len(words), N = len(text), L = max word length, due to nested loops with slice comparison. No trie or Aho-Corasick; appropriate for constraints ≤ 100.","truth_value":"IN","source":"entries/2026/06/06/index-pairs-of-a-string-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"index-pairs-brute-force-complexity","truth_value":"IN","reason":"premise"}]}}