{"results":[{"id":"add-to-array-form-prepend-quadratic-worst-case","text":"When `k` has more digits than `num`, each extra digit triggers an O(n) `list.insert(0, ...)`, making the overflow phase O(d*n) rather than the O(max(n,d)) achievable with append-and-reverse.","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-capacity-hardcoded","text":"The basket capacity of 5000 is hardcoded in `maxNumberOfApples`, not parameterized — matching the LeetCode spec but preventing reuse with different limits.","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":"apples-greedy-optimality","text":"Sorting ascending and taking greedily is provably optimal for maximizing item count under a weight budget when all items have equal value (1 apple = 1 unit).","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":"array-transform-strict-comparison","text":"Only strict local minima/maxima trigger adjustments; elements equal to a neighbor are left unchanged, meaning plateaus are inherently stable.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"ascending-subarray-function-name-is-wrong","text":"The function is named `concatenated_binary` but implements maximum ascending subarray sum; this is a copy-paste naming bug that doesn't affect correctness since tests import by name.","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":"average-salary-unique-values-invariant","text":"Correctness of the average-salary solution depends on all salary values being unique; duplicate min or max values would cause only one copy to be subtracted, producing a wrong answer.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balloon-hardcoded-target-not-generalizable","text":"The five-argument `min(...)` in `max_number_of_balloons` encodes the word \"balloon\" directly; changing the target word requires rewriting the return expression rather than parameterizing.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"balloon-needs-double-l-and-o","text":"The `// 2` divisor in `max_number_of_balloons` is applied to exactly `l` and `o` counts because \"balloon\" contains two of each; all other target characters (`b`, `a`, `n`) appear once.","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":"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":"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":"chebyshev-distance-for-8dir-grid","text":"The minimum steps between two points on an 8-directional grid equals Chebyshev distance `max(|dx|, |dy|)`, not Manhattan distance `|dx| + |dy|`; diagonal moves close both axes simultaneously.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"concat-array-wrong-method-name","text":"The concatenation-of-array solution method is named `maxValue` but should be `getConcatenation` per LeetCode 1929's expected interface — a copy-paste naming error.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"consecutive-requires-both-checks","text":"The consecutive-array check requires both a uniqueness test (`len(set) == n`) and a range test (`max - min + 1 == n`); either alone has false positives (`[1,1,3]` passes range-only, `[1,2,4]` passes uniqueness-only).","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""},{"id":"count-balls-alias-is-identity","text":"`maxWidthOfVerticalArea` is a direct class-level reference to `countBalls` (same code object), not a wrapper — likely a copy-paste artifact from a different LeetCode problem's template.","truth_value":"IN","justification_count":0,"dependent_count":0,"challenges":[],"last_reviewed":null,"review_result":null,"source_type":""}],"count":187,"limit":20,"offset":0}