{"results":[{"id":"array-transform-simultaneous-update","text":"All comparisons in a single round use the pre-round snapshot (`arr`), not the in-progress mutations (`new`), making updates simultaneous rather than sequential.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"assumes-square-grid","text":"`projectionArea` uses a single `n = len(grid)` for both dimensions, relying on the LeetCode constraint that the grid is always n × n; non-square grids would produce incorrect results","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":"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":"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":"brute-force-deletion-over-analytical","text":"`can_equal_frequency` uses O(n^2) brute-force simulation (try every single deletion) rather than an analytical O(n) approach, deliberately trading efficiency for correctness — this problem is notorious for edge-case bugs in analytical solutions.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"buddy-strings-cross-match-invariant","text":"The final correctness check requires that the two differing positions cross-match (`s[i] == goal[j]` and `s[j] == goal[i]`), not merely that they differ — this is the necessary and sufficient condition for a single-swap solution.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"buy-sell-stock-single-pass-greedy","text":"`maxProfit` runs in O(n) time and O(1) space by tracking the running minimum price — a Kadane's-style greedy pattern.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"buy-sell-stock-single-transaction-only","text":"`maxProfit` finds the best single buy-sell pair; it is not the unlimited-transactions variant (LeetCode #122).","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"calpoints-stack-only","text":"`calPoints` uses a single list as a stack, accessing only `[-1]` and `[-2]` — never arbitrary indexes.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"canonical-pipeline-has-exactly-two-instantiations","text":"The preprocess-then-stream pipeline has exactly two concrete forms — hash-then-stream (Counter/set for membership and frequency queries) and sort-then-stream (sorted order for positional queries) — matching the two preprocessing paradigms one-to-one with a single shared consumption phase.","truth_value":"IN","justification_count":1,"dependent_count":2,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":""},{"id":"cell-range-single-char-columns","text":"`cell_range` parses the input string by fixed character positions (s[0], s[1], s[3], s[4]), so it only handles single-letter columns (A-Z) and single-digit rows (1-9).","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"check-double-linear-complexity","text":"`checkIfExist` runs in O(n) time and O(n) space via single-pass iteration with hash set lookups","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"circular-distance-idiom-min-diff-n-minus-diff","text":"The `min(diff, N - diff)` idiom for shortest arc on a modular ring appears across multiple solutions including `minimum-time-to-type-word-using-special-typewriter`, `distance-between-bus-stops`, and (without wrap) `single-row-keyboard`.","truth_value":"IN","justification_count":0,"dependent_count":1,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"closest-value-self-contained-file","text":"The closest-binary-search-tree-value `solution.py` defines `TreeNode`, the solution, a level-order tree builder (`_build`), and a full `unittest` test suite in a single file.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"common-digit-always-optimal","text":"When both digit arrays share a digit, the smallest shared digit is always the answer, because any single-digit value (1-9) is strictly less than any two-digit value (11-99).","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"complement-count-one-pass","text":"For problems with exactly two valid target patterns (e.g., alternating binary strings), the repo counts mismatches against one pattern and derives the other as `len - count`, requiring only a single pass.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"complement-no-special-case-needed","text":"The XOR-with-mask algorithm handles all valid inputs (1 to 2^31 - 1) without branching; edge cases like single-bit numbers (e.g., `1 ^ 1 = 0`) resolve correctly through the general formula.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"confusing-number-single-pass","text":"The solution extracts digits right-to-left and rebuilds the rotated number left-to-right in one pass, simultaneously reversing digit order and applying the rotation mapping in O(d) time.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":201,"limit":20,"offset":0}