{"results":[{"id":"abstraction-overhead-explains-strategy-hierarchy","text":"Non-streaming strategies require lookup abstractions (Counter, set, binary search) as load-bearing infrastructure between pipeline phases, while streaming requires none — this asymmetric abstraction overhead causally explains the strategy hierarchy: streaming dominates because it avoids the data-structure selection and initialization cost that alternatives impose on each solution author.","truth_value":"IN","justification_count":1,"dependent_count":1,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":""},{"id":"add-to-array-form-k-as-carry","text":"The add-to-array-form solution uses the input integer `k` as both the addend and carry accumulator via `k //= 10`, eliminating the need for a separate carry variable.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"algorithmic-coherence-emerges-without-engineering","text":"Despite zero cross-solution coordination and no consistency enforcement, solutions independently converge on two dominant paradigms (streaming and sort-then-scan), demonstrating that LeetCode's problem domain naturally constrains the algorithmic solution space.","truth_value":"IN","justification_count":1,"dependent_count":4,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":""},{"id":"alien-dict-assumes-valid-order","text":"The alien dictionary solution assumes `order` covers all characters in `words`; a missing character produces an unhandled `KeyError` — no input validation.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"alien-dict-prefix-rule","text":"The alien dictionary solution explicitly enforces the prefix rule: if all shared characters match but the first word is longer, it returns `False`.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"alien-dict-rank-map-idiom","text":"The alien dictionary solution builds a `{char: index}` dict from the ordering string, converting custom-alphabet comparison to integer comparison with O(1) lookups.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"all-solutions-pure-python-no-imports","text":"All five solutions use only Python builtins and (optionally) `typing.List` or `unittest` — none import third-party libraries or non-trivial standard library modules, keeping each solution self-contained","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"all-solutions-reduce-to-adapted-streaming","text":"Every solution in the repo is fundamentally a streaming algorithm: pure streaming solutions operate directly, while sort-then-scan and hash-then-scan solutions use preprocessing as a domain adapter that transforms the problem into one where streaming's self-sufficiency applies — making the preprocessing phase structurally optional rather than architecturally distinct.","truth_value":"IN","justification_count":1,"dependent_count":4,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"invalid","source_type":"derived"},{"id":"ap-integer-division-exact","text":"In `missing-number-in-arithmetic-progression/solution.py`, the expression `(arr[-1] - arr[0]) // n` never truncates under valid inputs because the span of a valid AP is always an exact multiple of the gap count.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"architecture-immune-to-own-engineering-defects","text":"The repo's architecture exhibits structural immunity to its own engineering defects: zero-coupling costs are invisible at runtime because each solution's correctness is independent, and the most prominent such cost — naming drift — serves no functional role at any layer. This means the architecture cannot be degraded by the class of inconsistencies it systematically produces; even adversarial naming errors would be absorbed without observable effect.","truth_value":"IN","justification_count":1,"dependent_count":4,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":"derived"},{"id":"average-salary-divisor-assumes-length-gte-3","text":"The expression `len(salary) - 2` in the average-salary solution would produce a ZeroDivisionError if called with fewer than 3 elements; correctness relies on the problem's length guarantee.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"average-salary-single-pass-arithmetic","text":"The average-salary solution computes the trimmed mean algebraically via `(sum - min - max) / (n - 2)` using three linear scans, avoiding O(n log n) sorting entirely.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"average-salary-unique-values-invariant","text":"Correctness of the average-salary solution depends on all salary values being unique; duplicate min or max values would cause only one copy to be subtracted, producing a wrong answer.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"backspace-compare-reverse-two-pointer-o1-space","text":"The backspace-string-compare solution uses reverse traversal with a skip counter instead of a stack, achieving O(1) auxiliary space and O(n+m) time for comparing two backspace-processed strings.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balanced-strings-function-name-mismatch","text":"`find_special_integer` in `split-a-string-in-balanced-strings/solution.py` does not match the problem it solves — it's a template artifact that was never renamed, suggesting other solutions may share this issue.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balanced-tree-short-circuit-propagation","text":"The balanced-binary-tree solution achieves O(n) time by short-circuiting: once any subtree returns `-1` (unbalanced), the value propagates upward immediately without recursing into sibling subtrees.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"bare-function-vs-solution-class-inconsistency","text":"Some solutions use a `Solution` class with methods (e.g., `reverseVowels`, `maximumWealth`, `countPoints`) while others use bare functions (e.g., `judgeCircle`, `reverse_words_in_string`) — the repo is not consistent about which convention to use.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"binary-gap-bit-scan-pattern","text":"`binary_gap` uses `n & 1` / `n >>= 1` right-shift scanning rather than `bin()` string conversion — the same bit-scanning idiom appears in `number-of-1-bits/solution.py`.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"binary-search-variants-share-convergence-structure","text":"All binary search solutions share the same convergence loop structure (narrow [lo, hi] until they meet) but vary along three independent dimensions: what is searched (raw values vs. derived monotonic functions), bias direction (leftmost vs. rightmost match), and post-loop extraction (lo, hi, or result variable).","truth_value":"IN","justification_count":1,"dependent_count":2,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":""},{"id":"bit-walking-over-string-conversion","text":"`even_odd_indices` walks bits via `n & 1` and `n >>= 1` rather than converting to a binary string with `bin()`, avoiding string allocation and keeping the solution at O(log n) with no dependencies.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":526,"limit":20,"offset":0}