{"results":[{"id":"add-strings-avoids-int-conversion","text":"`addStrings` converts between characters and digit values using `ord()/chr()` arithmetic (`ord(c) - 48`, `chr(d + 48)`) and never calls `int()` or `str()`, satisfying the problem's constraint against built-in integer conversion.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"alien-dict-function-misnamed","text":"The function solving LeetCode 953 (alien dictionary verification) is named `reverse_string`, which has nothing to do with its actual behavior — a naming bug, not an alias.","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-groups-equal-length-k","text":"Every element returned by divideString has exactly k characters, guaranteed by the pad step preceding the slice step.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"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":"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":"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-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":"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":"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-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-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":"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":""},{"id":"box-category-exhaustive-return","text":"`boxCategory` always returns exactly one of four string literals; the if/elif chain covers all four (bulky, heavy) combinations with no unreachable or missing branch.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"box-category-flag-then-branch","text":"`boxCategory` separates classification into two phases: compute boolean flags (`bulky`, `heavy`) from thresholds, then map the flag pair to a string label via cascading if/elif.","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":"buddy-strings-early-exit-on-third-diff","text":"The diff-collection loop returns `False` immediately upon finding a 3rd mismatch, bounding the `diffs` list to at most length 2 and guaranteeing safe index access in the final check.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":218,"limit":20,"offset":0}