{"results":[{"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":"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":"anagram-comparison-target-is-last-accepted","text":"Each word is compared against `result[-1]` (the last *accepted* word), not the previous word in the input — when consecutive anagrams are dropped, the comparison target stays the same until a non-anagram breaks the run.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"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":"apples-mutates-input","text":"`maxNumberOfApples` mutates the caller's list via `weight.sort()` rather than using `sorted()`, so callers cannot rely on original order being preserved.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"arithmetic-progression-mutates-input","text":"`can_construct` calls `arr.sort()`, mutating the input list in place; callers needing the original order must pass a copy.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"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":"array-partition-mutates-input","text":"`nums.sort()` mutates the caller's list in-place rather than using `sorted()` to preserve the original.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"array-partition-no-validation","text":"`array_pair_sum` assumes even-length input and performs no length or type checking; odd-length input silently produces a wrong answer.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"array-transform-no-mutation","text":"The input list is copied on entry (`arr[:]`), so the caller's original list is never modified — contrasting with array-partition and assign-cookies which mutate in-place.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"ascending-subarray-empty-input-crashes","text":"Passing an empty list raises `IndexError` on `nums[0]`; the function relies on the LeetCode guarantee that `nums` is non-empty rather than handling this edge case.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"ascii-32-detects-case-pairs","text":"`abs(ord(a) - ord(b)) == 32` is true if and only if `a` and `b` are the same English letter in different cases, given inputs restricted to `[a-zA-Z]`, because ASCII lower and upper variants of every letter differ by exactly 32.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"assign-cookies-mutates-inputs","text":"`find_content_children` mutates both input lists via in-place `.sort()`; callers cannot assume list order is preserved.","truth_value":"IN","justification_count":0,"dependent_count":1,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"ba-substring-equivalence","text":"`\"ba\" not in s` is equivalent to \"every 'a' precedes every 'b'\" when the input contains only 'a' and 'b' — the only way to violate the ordering is a b-to-a transition, which is exactly the substring \"ba\".","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"base7-sign-magnitude","text":"Negative inputs in convert_to_base7 are handled by converting to absolute value and prepending `\"-\"`, avoiding Python's floor-division behavior on negative numbers which would complicate digit extraction.","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":"bigram-empty-input-degrades-gracefully","text":"When `text` has fewer than 3 words, `range(len(words) - 2)` produces an empty range and the result is `[]` — no special-case code needed","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"binary-gap-negative-input-infinite-loop","text":"Passing a negative integer to `binary_gap` causes an infinite loop because Python's arbitrary-precision right-shift of a negative number never reaches `0`.","truth_value":"OUT","justification_count":0,"dependent_count":1,"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":"boyer-moore-constant-space","text":"The Boyer-Moore implementation uses exactly two scalar variables (`candidate`, `count`) — O(1) auxiliary space regardless of input size.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":307,"limit":20,"offset":0}