{"results":[{"id":"alias-is-identity","text":"`min_time_to_remove_balloons` is a module-level alias (same function object) for `countStudents`, not a wrapper — likely exists for a test harness or problem variant that expects that name.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"all-nonalgorithmic-defects-invisible-at-runtime","text":"All engineering defects — whether sourced from the generation pipeline (naming errors, stale aliases) or from the isolation architecture (tooling confusion, convention drift, duplicated definitions) — are invisible at runtime because the submission-optimized architecture confines their blast radius to non-functional dimensions.","truth_value":"IN","justification_count":1,"dependent_count":1,"challenges":[],"last_reviewed":"2026-06-07T22:02:22","review_result":"pass","source_type":"derived"},{"id":"alternating-bits-o1","text":"`has_alternating_bits` runs in O(1) time and space with no loops or string conversion — pure arithmetic on two intermediate values.","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":"arithmetic-progression-sort-then-scan","text":"`can_construct` sorts the input then verifies constant consecutive difference in one pass — O(n log n) time, O(1) extra space beyond the sort.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"arithmetic-triplets-set-lookup-linear","text":"`count_arithmetic_triplets` achieves O(n) time via set-based membership lookups, treating each element as the largest of a potential triplet and checking for `x - diff` and `x - 2*diff` in a `seen` set","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-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":"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":"binary-search-on-value-pattern","text":"`is_perfect_square` binary-searches the range `[1, num]` for a value whose square equals `num`, achieving O(log n) time and O(1) space with no library calls.","truth_value":"IN","justification_count":0,"dependent_count":1,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"broken-set-disjoint-pattern","text":"`canBeTypedWords` converts `brokenLetters` to a set and uses `set.isdisjoint` against each word, achieving O(n) time in total text length instead of O(n*b).","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"busyStudent-inclusive-boundaries","text":"`busyStudent` uses `s <= queryTime <= e` (inclusive on both ends), meaning a student is counted as busy when queryTime equals exactly startTime or endTime.","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":"calpoints-linear-time","text":"`calPoints` runs in O(n) time and O(n) space, where n is the number of operations.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"canformarray-linear-time","text":"`canFormArray` runs in O(n) time where n = len(arr), visiting each element exactly once via a greedy left-to-right scan with hash-map lookups.","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":"circular-sentence-no-split","text":"`is_circular` checks circularity by scanning for spaces as word boundaries rather than calling `str.split()`, achieving O(n) time and O(1) auxiliary space.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"clock-times-enumerate-over-case-logic","text":"`count_valid_times` iterates over all 24 hours and 60 minutes (84 total iterations) and pattern-matches, rather than building conditional case tables per digit position.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"clock-times-hour-minute-independence","text":"`count_valid_times` exploits the independence of hour and minute wildcards, computing `matching_hours * matching_minutes` instead of enumerating all 1440 combinations.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":210,"limit":20,"offset":0}