{"results":[{"id":"abstraction-cost-predicts-convergence-strength","text":"Strategy convergence strength in an uncoordinated repo appears predictable from abstraction overhead: streaming (zero abstractions) converges strongest, hash-then-stream (one preprocessing step with Counter/set) converges next, sort-then-scan (ordering prerequisite plus pointer management) converges weakest — the adoption barrier gradient closely tracks the abstraction cost gradient.","truth_value":"IN","justification_count":1,"dependent_count":2,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","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":"all-ones-check-idiom","text":"`(m & (m + 1)) == 0` tests whether `m` is zero or all-ones up to the MSB — the complement of the `n & (n-1) == 0` power-of-two check, reusable across bit-manipulation problems.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"anchor-tracking-pattern-shared","text":"The \"last-seen non-zero\" anchor-tracking idiom appears in both `max_captured_forts` and `countHillValley` — skip irrelevant elements, compare the current significant value to the previous one.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"apples-early-return-index","text":"`maxNumberOfApples` returns the loop index `i` (not `i+1`) on budget overflow because `enumerate` is zero-based and `i` equals the count of previously accumulated apples before the one that broke the budget.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"apply-ops-two-phase-pattern","text":"`apply-operations-to-an-array` uses a two-phase in-place transformation: Phase 1 (pairwise doubling, left-to-right with sequential dependency) must complete before Phase 2 (zero compaction via write-pointer), and interleaving them produces incorrect results.","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":"ascending-subarray-resets-to-current","text":"On a non-ascending step, `current_sum` resets to the current element (not zero), because the current element is always the start of the next potential ascending subarray.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"assign-cookies-zero-extra-space","text":"The two-pointer algorithm uses O(1) auxiliary space beyond the in-place sort — no heaps, hash maps, or copied arrays.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"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":"balanced-substring-always-even-result","text":"`longestBalancedSubstring` always returns an even integer (including 0) because `best` is updated as `2 * min(zeros, ones)`, and updates occur only when processing `'1'` characters.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balanced-substring-reset-on-zero-after-ones","text":"Both `zeros` and `ones` counters reset to zero when a `'0'` follows a `'1'`, which prevents stale zero-counts from inflating results across non-contiguous balanced segments.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balanced-substring-single-pass-counter","text":"`longestBalancedSubstring` uses a single-pass O(n) time, O(1) space counter technique — tracking running counts of consecutive zeros and ones — rather than checking all substrings or using groupby.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"base7-zero-special-case","text":"`convert_to_base7` handles input 0 via an explicit early return; without this guard, the `while num:` loop would never execute and the function would return an empty string.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"binary-string-segment-depends-on-no-leading-zeros","text":"The `\"01\" not in s` check for at-most-one-segment-of-ones is only correct because the problem guarantees no leading zeros; without that constraint, `\"011\"` (a valid single segment) would be incorrectly rejected.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"boundary-handling-complete-unless-degenerate-input-escapes","text":"Streaming's structural boundary handling (sentinel initialization + early exit) combined with observed crash-freedom for degenerate inputs jointly establish that the streaming paradigm handles all boundary conditions without conditional logic — provided no degenerate input (single-element, empty, zero) escapes the sentinel+early-exit net.","truth_value":"OUT","justification_count":1,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":"derived"},{"id":"build-array-permutation-precondition","text":"The modular encoding algorithm is only correct when `nums` is a valid zero-based permutation (all values in `[0, n)`, each appearing exactly once); invalid input produces silently wrong results.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"build-helper-uses-list-pop-zero","text":"`_build` constructs trees via BFS using `queue.pop(0)`, which is O(n) per pop on a Python list, making tree construction O(n^2) — acceptable for small test inputs but not optimal","truth_value":"OUT","justification_count":0,"dependent_count":2,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"buy-sell-stock-returns-zero-for-no-profit","text":"When no profitable transaction exists (monotonically decreasing prices), `maxProfit` returns `0`, never a negative number.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"check-double-zero-pair","text":"Two zeros in the input correctly return `True` because the second zero finds `2 * 0 = 0` already in `seen` from the first zero","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":185,"limit":20,"offset":0}