Home / kamyu104 / LeetCode-Solutions
AI Slop Code RIsk Monitor

kamyu104/LeetCode-Solutions

🏋️ Python / Modern C++ Solutions of All 4073 LeetCode Problems (Weekly Update)

8.7 Moderate pattern signal View on GitHub

Maintenance and Governance Review

This report summarizes scanner evidence for kamyu104/LeetCode-Solutions, a C++ project with 5,945 GitHub stars. SynthScan examined 336,816 lines of code across 7760 source files, recording 1358 pattern matches distributed across 10 syntactic categories. The legacy adjusted pattern signal is 8.7 (Moderate pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

8.7
Adjusted Signal
8.7
Raw Pattern Score
100%
Time Factor
2026-10-10
Last Push
5.9K
Stars
C++
Language
336.8K
Lines of Code
7.8K
Files
1.4K
Pattern Hits
2026-10-12
Scan Date
0.05
HC Hit Rate

Risk Review · v3

Use each vector to guide manual verification of the underlying findings.

Cognitive Ownership Risk 13.1/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 949 finding(s).

Hallucinated Dependency & Supply Chain Risk 1.6/100 · LOW

Are imports declared and package/API names verified? 33 finding(s).

Agent Over-Engineering Ratio 25.1/100 · MEDIUM

Are wrappers, guards, and repeated structures necessary? 452 finding(s).

PR Review Velocity Impact 38.8/100 · MEDIUM

Which changes need focused human review? 1358 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 0HIGH 389MEDIUM 3LOW 966

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 1358 distinct pattern matches across 10 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Cross-File Repetition373 hits · 1865 pts
SeverityFileLineSnippetContext
HIGHPython/online-majority-element-in-subarray.py0initialize your data structure here. :type nums: list[int]STRING
HIGHPython/falling-squares.py0initialize your data structure here. :type nums: list[int]STRING
HIGHPython/range-sum-query-immutable.py0initialize your data structure here. :type nums: list[int]STRING
HIGHPython/range-sum-query-mutable.py0initialize your data structure here. :type nums: list[int]STRING
HIGHPython/count-the-number-of-fair-pairs.py0:type nums: list[int] :type lower: int :type upper: int :rtype: list[str]STRING
HIGHPython/count-of-range-sum.py0:type nums: list[int] :type lower: int :type upper: int :rtype: list[str]STRING
HIGHPython/find-all-numbers-disappeared-in-an-array-ii.py0:type nums: list[int] :type lower: int :type upper: int :rtype: list[str]STRING
HIGHPython/missing-ranges.py0:type nums: list[int] :type lower: int :type upper: int :rtype: list[str]STRING
HIGHPython/count-stable-subarrays.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximum-xor-with-an-element-from-array.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximum-xor-score-subarray-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…ents-in-array-after-removing-and-replacing-elements.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/peaks-in-array.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/mark-elements-on-array-by-performing-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/range-xor-queries-with-subarray-reversals.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximize-count-of-distinct-primes-after-split.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimum-absolute-difference-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/threshold-majority-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…smallest-remaining-even-integer-in-subarray-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…umber-of-integers-with-popcount-depth-equal-to-k-ii.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimum-cost-to-move-between-indices.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/peaks-in-array-ii.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…thon/sum-of-special-evenly-spaced-elements-in-array.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/reachable-nodes-in-subdivided-graph.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/top-k-frequent-elements.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/k-radius-subarray-averages.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/sliding-window-maximum.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-the-most-competitive-subsequence.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-the-power-of-k-size-subarrays-i.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/rotate-non-negative-elements.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-the-power-of-k-size-subarrays-ii.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-x-value-of-array-i.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…n/smallest-subarray-to-sort-in-every-sliding-window.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…n/find-subsequence-of-length-k-with-the-largest-sum.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximize-sum-of-at-most-k-distinct-elements.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/reverse-k-subarrays.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/largest-subarray-length-k.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/distinct-numbers-in-each-subarray.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/concatenated-divisibility.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/delayed-count-of-equal-elements.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/limit-occurrences-in-sorted-array.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximum-sum-of-3-non-overlapping-subarrays.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-all-good-indices.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…divide-an-array-into-subarrays-with-minimum-cost-ii.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimum-time-for-k-connected-components.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimize-maximum-component-cost.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…thon/maximize-spanning-tree-stability-with-upgrades.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…on/minimum-cost-to-repair-edges-to-traverse-a-graph.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/zero-array-transformation-i.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximum-xor-of-two-non-overlapping-subtrees.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…max-number-of-edges-to-keep-graph-fully-traversable.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/find-champion-ii.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/count-the-number-of-complete-components.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…inimum-distance-excluding-one-maximum-weighted-edge.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/maximum-sum-of-edge-values-in-a-graph.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGH…minimum-time-to-reach-destination-in-directed-graph.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimum-cost-path-with-edge-reversals.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/incremental-even-weighted-cycle-queries.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/count-valid-paths-in-a-tree.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
HIGHPython/minimum-degree-of-a-connected-trio-in-a-graph.py0:type n: int :type edges: list[list[int]] :type hasapple: list[bool] :rtype: intSTRING
313 more matches not shown…
Deep Nesting787 hits · 787 pts
SeverityFileLineSnippetContext
LOWPython/find-the-grid-of-region-average.py6CODE
LOWPython/finding-3-digit-even-numbers.py38CODE
LOWPython/check-if-word-can-be-placed-in-crossword.py5CODE
LOWPython/check-if-word-can-be-placed-in-crossword.py40CODE
LOWPython/time-taken-to-mark-all-nodes.py6CODE
LOWPython/time-taken-to-mark-all-nodes.py11CODE
LOWPython/time-taken-to-mark-all-nodes.py30CODE
LOW…er-of-flips-to-convert-binary-matrix-to-zero-matrix.py8CODE
LOWPython/maximum-manhattan-distance-after-k-changes.py6CODE
LOW…hon/longest-path-with-different-adjacent-characters.py9CODE
LOW…hon/longest-path-with-different-adjacent-characters.py49CODE
LOW…hon/longest-path-with-different-adjacent-characters.py15CODE
LOW…hon/longest-path-with-different-adjacent-characters.py55CODE
LOWPython/count-all-possible-routes.py8CODE
LOWPython/count-all-possible-routes.py54CODE
LOW…/build-binary-expression-tree-from-infix-expression.py13CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py6CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py57CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py115CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py165CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py22CODE
LOW…on/maximize-the-distance-between-points-on-a-square.py73CODE
LOWPython/sum-of-remoteness-of-all-cells.py6CODE
LOWPython/sum-of-remoteness-of-all-cells.py12CODE
LOWPython/maximum-xor-of-two-non-overlapping-subtrees.py33CODE
LOWPython/maximum-xor-of-two-non-overlapping-subtrees.py40CODE
LOWPython/maximum-xor-of-two-non-overlapping-subtrees.py55CODE
LOW…/maximum-number-of-subsequences-after-one-inserting.py6CODE
LOW…imum-operations-to-form-subsequence-with-target-sum.py7CODE
LOW…max-number-of-edges-to-keep-graph-fully-traversable.py24CODE
LOWPython/word-squares-ii.py9CODE
LOWPython/word-squares-ii.py38CODE
LOWPython/search-in-rotated-sorted-array-ii.py5CODE
LOWPython/count-of-integers.py6CODE
LOWPython/count-of-integers.py15CODE
LOWPython/maximum-compatibility-score-sum.py9CODE
LOWPython/maximum-compatibility-score-sum.py17CODE
LOWPython/minimum-xor-sum-of-two-arrays.py6CODE
LOWPython/minimum-xor-sum-of-two-arrays.py9CODE
LOWPython/max-points-on-a-line.py14CODE
LOWPython/minimum-operations-to-form-subset-sum-i.py6CODE
LOWPython/minimum-operations-to-form-subset-sum-i.py37CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py6CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py87CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py134CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py15CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py96CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py143CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py16CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py97CODE
LOWPython/find-minimum-diameter-after-merging-two-trees.py144CODE
LOWPython/word-pattern-ii.py17CODE
LOW…n/count-non-decreasing-arrays-with-given-digit-sums.py23CODE
LOWPython/minimum-operations-to-form-subset-sum-ii.py6CODE
LOWPython/minimum-operations-to-form-subset-sum-ii.py44CODE
LOWPython/minimum-operations-to-form-subset-sum-ii.py79CODE
LOWPython/swap-adjacent-in-lr-string.py9CODE
LOWPython/maximum-number-of-fish-in-a-grid.py6CODE
LOWPython/maximum-number-of-fish-in-a-grid.py12CODE
LOWPython/sparse-matrix-multiplication.py5CODE
727 more matches not shown…
Cross-Language Confusion16 hits · 95 pts
SeverityFileLineSnippetContext
HIGHPython/find-the-index-of-the-large-integer.py17 left, right = 0, reader.length()-1CODE
HIGHPython/guess-the-majority-in-a-hidden-array.py27 for i in reversed(xrange(4, reader.length())):CODE
HIGHPython/implement-stack-using-queues.py35 self.q_.push(x)CODE
HIGHPython/implement-stack-using-queues.py37 self.q_.push(self.q_.pop())CODE
HIGHPython/implement-stack-using-queues.py63 self.q_.push(x)CODE
HIGHPython/implement-stack-using-queues.py70 self.q_.push(self.top_)CODE
HIGH⚡Python/find-in-mountain-array.py39 peak = binarySearch(mountain_arr, 0, mountain_arr.length()-1,CODE
HIGH⚡Python/find-in-mountain-array.py45 right = binarySearch(mountain_arr, peak, mountain_arr.length()-1,CODE
HIGH⚡Python/find-in-mountain-array.py47 if right <= mountain_arr.length()-1 and mountain_arr.get(right) == target:CODE
HIGH⚡Python/invert-binary-tree.py40 nodes.push(root)CODE
HIGH⚡Python/invert-binary-tree.py45 nodes.push(node.left)CODE
HIGH⚡Python/invert-binary-tree.py47 nodes.push(node.right)CODE
HIGH…perations-to-make-elements-within-k-subarrays-equal.py142 self.left.push(val)CODE
HIGH…perations-to-make-elements-within-k-subarrays-equal.py145 self.right.push(val)CODE
HIGH…perations-to-make-elements-within-k-subarrays-equal.py162 self.left.push(self.right.top())CODE
HIGH…perations-to-make-elements-within-k-subarrays-equal.py167 self.right.push(self.left.top())CODE
Over-Commented Block83 hits · 83 pts
SeverityFileLineSnippetContext
LOWC++/encode-n-ary-tree-to-binary-tree.cpp81// Your Codec object will be instantiated and called as such:COMMENT
LOWC++/subtree-removal-game-with-fibonacci-tree.cpp1// Time: O(1)COMMENT
LOWC++/subsequences-with-a-unique-middle-mode-ii.cpp41 result += nC2(l) * nC2(r);COMMENT
LOWC++/pizza-with-3n-slices.cpp1// Time: O(n^2)COMMENT
LOWC++/sum-of-all-odd-length-subarrays.cpp1// Time: O(n)COMMENT
LOWC++/smallest-all-ones-multiple.cpp1// Time: O(k)COMMENT
LOWC++/lowest-common-ancestor-of-a-binary-tree.cpp21 // 1. If the current subtree contains both p and q,COMMENT
LOWC++/airplane-seat-assignment-probability.cpp1// Time: O(1)COMMENT
LOWC++/clumsy-factorial.cpp1// Time: O(1)COMMENT
LOWC++/smallest-integer-divisible-by-k.cpp1// Time: O(k)COMMENT
LOWC++/minimum-knight-moves.cpp21 // [2,(1),4]COMMENT
LOWC++/divisor-game.cpp1// Time: O(1)COMMENT
LOWC++/cat-and-mouse-ii.cpp201 q1.emplace(ni, nj, nt);COMMENT
LOW…+/minimum-one-bit-operations-to-make-integers-zero.cpp1// Time: O(logn)COMMENT
LOW…+/minimum-one-bit-operations-to-make-integers-zero.cpp41 // f(100) = 2 * f(10) + 1 = 7COMMENT
LOWC++/intersection-of-two-arrays-ii.cpp1// If the given array is not sorted and the memory is unlimited:COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp1// Time: O(1)COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp21 // 1 1 1COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp41 // 1 1 1 1 1 1COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp61 // extend:COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp81 // 1 1 1 2 2 2COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp101 // 1 1 4 4COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp121 // 1 1 1 4 4COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp141 // 1 1 2 2 2 2 2COMMENT
LOWC++/the-number-of-ways-to-make-the-sum.cpp161 // 1 1 1 1 1 1 1 6COMMENT
LOWC++/maximum-students-taking-exam.cpp1// Time: O(m * n * sqrt(m * n))COMMENT
LOWC++/implement-trie-prefix-tree.cpp61};COMMENT
LOW…/minimum-garden-perimeter-to-collect-enough-apples.cpp1// Time: O(1)COMMENT
LOW…/minimum-garden-perimeter-to-collect-enough-apples.cpp41 // . . . COMMENT
LOW…/minimum-garden-perimeter-to-collect-enough-apples.cpp81 // . . . COMMENT
LOWC++/sum-game.cpp1// Time: O(n)COMMENT
LOWC++/range-sum-query-immutable.cpp21COMMENT
LOWC++/super-egg-drop.cpp21 // let f(n, K) be the max number of floors could be solved by n moves and K eggs,COMMENT
LOWC++/maximum-of-absolute-value-expression.cpp1// Time: O(n)COMMENT
LOWC++/find-array-given-subset-sums.cpp1// Time: O(n * 2^n), len(sums) = 2^nCOMMENT
LOWC++/encode-and-decode-tinyurl.cpp41// Solution solution;COMMENT
LOWC++/subsequences-with-a-unique-middle-mode-i.cpp41 result += nC2(l) * nC2(r);COMMENT
LOWC++/painting-a-grid-with-three-different-colors.cpp141 const auto& adj = find_adj(m, basis, dp); // alternative of backtracking, Time: O(3^m), Space: O(3^m)COMMENT
LOWC++/number-of-burgers-with-no-waste-of-ingredients.cpp1// Time: O(1)COMMENT
LOWC++/maximum-number-of-accepted-invitations.cpp1// Time: O(m * n * sqrt(m + n))COMMENT
LOWC++/stone-game-ix.cpp21 // iff abs(count[1]-count[2]) >= 3, then alice takes the most one at first, the remains are deterministic for boCOMMENT
LOWC++/stream-of-characters2.cpp1// Time: ctor: O(n + p^2), n is the total size of patternsCOMMENT
LOWC++/integer-break.cpp1// Time: O(logn), pow is O(logn).COMMENT
LOWC++/integer-break.cpp21 //COMMENT
LOWPython/cat-and-mouse-ii.py181 # if not degree[ni, nj, nt]:COMMENT
LOWPython/sum-of-all-odd-length-subarrays.py21 # as the graph depicted above,COMMENT
LOWPython/maximum-number-of-ones.py21 # 4. fill one into matrix by tile part of which count is in descending orderCOMMENT
LOWPython/airplane-seat-assignment-probability.py1# Time: O(1)COMMENT
LOWPython/maximum-of-absolute-value-expression.py1# Time: O(n)COMMENT
LOWPython/stone-game-ix.py21 # ^COMMENT
LOWPython/rectangle-area.py1# Time: O(1)COMMENT
LOWPython/lowest-common-ancestor-of-a-binary-tree.py1# Time: O(n)COMMENT
LOWPython/clumsy-factorial.py1# Time: O(1)COMMENT
LOWPython/permutations.py41COMMENT
LOW…n/minimum-garden-perimeter-to-collect-enough-apples.py41class Solution2(object):COMMENT
LOW…n/minimum-garden-perimeter-to-collect-enough-apples.py81# Space: O(1)COMMENT
LOWPython/painting-a-grid-with-three-different-colors.py141 if m > n:COMMENT
LOWPython/subsequences-with-a-unique-middle-mode-i.py41 # bb/a/acCOMMENT
LOWPython/stream-of-characters2.py1# Time: ctor: O(n + p^2), n is the total size of patternsCOMMENT
LOWPython/stream-of-characters2.py81# obj = StreamChecker(words)COMMENT
23 more matches not shown…
Hyper-Verbose Identifiers67 hits · 67 pts
SeverityFileLineSnippetContext
LOWPython/online-majority-element-in-subarray.py72 def boyer_moore_majority_vote(nums, left, right):CODE
LOWPython/online-majority-element-in-subarray.py235 def __boyer_moore_majority_vote(self, nums, left, right):CODE
LOWPython/maximum-prime-difference.py5def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/number-of-ways-to-buy-pens-and-pencils.py23 def arithmetic_progression_sum(a, d, l):CODE
LOWPython/design-excel-sum-formula.py63 def __calc_and_update_dependency(self, r, c, strs):CODE
LOWPython/index-pairs-of-a-string.py38 def __create_ac_suffix_and_output_links(self, root): # Time: O(n), Space: O(t)CODE
LOWPython/divisible-and-non-divisible-sums-difference.py12 def arithmetic_progression_sum(a, d, l):CODE
LOWPython/most-frequent-prime.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/apply-operations-to-maximize-score.py16 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/apply-operations-to-maximize-score.py31 def count_of_distinct_prime_factors(x):CODE
LOWPython/count-prime-gap-balanced-subarrays.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/maximize-fixed-points-after-deletions.py14 def longest_increasing_subsequence(arr):CODE
LOWPython/count-the-number-of-square-free-subsets.py14 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/count-the-number-of-square-free-subsets.py66 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOW…n/minimum-number-of-valid-strings-to-form-target-ii.py71 def __create_ac_suffix_and_output_links(self, root): # Time: O(n), Space: O(t)CODE
LOWPython/html-entity-parser.py40 def __create_ac_suffix_and_output_links(self, root): # Time: O(n), Space: O(t)CODE
LOWPython/minimum-index-of-a-valid-split.py11 def boyer_moore_majority_vote():CODE
LOW…um-division-operations-to-make-array-non-decreasing.py6def linear_sieve_of_eratosthenes(n):CODE
LOWPython/sum-of-primes-between-number-and-its-reverse.py6def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOW…on/minimum-number-of-valid-strings-to-form-target-i.py71 def __create_ac_suffix_and_output_links(self, root): # Time: O(n), Space: O(t)CODE
LOWPython/maximize-count-of-distinct-primes-after-split.py8def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/number-of-ways-to-separate-numbers.py11 def find_longest_common_prefix(num):CODE
LOWPython/number-of-ways-to-separate-numbers.py19 def is_less_or_equal_to_with_same_length(num, lcp, i, j, l):CODE
LOW…n/minimum-operations-to-make-the-array-k-increasing.py14 def longest_non_decreasing_subsequence(arr):CODE
LOW…hon/find-the-count-of-numbers-which-are-not-special.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/majority-element.py13 def boyer_moore_majority_vote():CODE
LOWPython/count-valid-paths-in-a-tree.py12 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/count-valid-paths-in-a-tree.py77 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/count-valid-paths-in-a-tree.py159 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/minimum-runes-to-add-to-cast-spell.py6def strongly_connected_components(adj): # Time: O(|V| + |E|) = O(N + 2N) = O(N), Space: O(|V|) = O(N)CODE
LOW…hon/count-ways-to-choose-coprime-integers-from-rows.py15 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/distinct-prime-factors-of-product-of-array.py6def linear_sieve_of_eratosthenes(n):CODE
LOWPython/gcd-sort-of-an-array.py41 def modified_sieve_of_eratosthenes(n, lookup, uf): # Time: O(n * log(logn)), Space: O(n)CODE
LOWPython/count-primes.py35 def linear_sieve_of_eratosthenes(n):CODE
LOWPython/minimum-swaps-to-avoid-forbidden-values.py12 def boyer_moore_majority_vote(arr):CODE
LOWPython/stream-of-characters2.py45 def __create_ac_suffix_and_output_links(self, root): # Time: O(n + p^2), Space: O(t + p^2)CODE
LOWPython/minimum-number-of-days-to-disconnect-island.py6def iter_get_articulation_points(graph, v): # modifiedCODE
LOWPython/length-of-the-longest-increasing-path.py15 def longest_increasing_subsequence(arr):CODE
LOWPython/prime-in-diagonal.py6def linear_sieve_of_eratosthenes(n):CODE
LOWPython/preimage-size-of-factorial-zeroes-function.py10 def count_of_factorial_primes(n, p):CODE
LOWPython/digit-operations-to-make-two-integers-equal.py15 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/prime-subtraction-operation.py8def linear_sieve_of_eratosthenes(n):CODE
LOW…gest-subarray-with-at-most-k-distinct-prime-factors.py6def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/maximum-subarray-with-equal-products.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/stream-of-characters.py45 def __create_ac_suffix_and_output_links(self, root): # Time: O(n), Space: O(t)CODE
LOW…perations-to-transform-array-into-alternating-prime.py6def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/greatest-common-divisor-traversal.py6def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOW…an-original-string-exists-given-two-encoded-strings.py27 def optimized_possible_numbers(s):CODE
LOW…/find-the-minimum-possible-sum-of-a-beautiful-array.py8 def arithmetic_progression_sum(a, d, n):CODE
LOWPython/check-if-any-element-has-prime-frequency.py9def linear_sieve_of_eratosthenes(n):CODE
LOW…imum-number-of-increasing-subsequence-to-be-removed.py14 def longest_non_increasing_subsequence(arr):CODE
LOW…oduct-of-the-length-of-two-palindromic-subsequences.py10 def palindromic_subsequence_length(s, mask):CODE
LOWPython/prime-pairs-with-target-sum.py11 def linear_sieve_of_eratosthenes(n):CODE
LOWPython/sum-of-perfect-square-ancestors.py8def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/count-the-number-of-ideal-arrays.py24 def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/split-array-by-prime-indices.py6def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/closest-prime-numbers-in-range.py37def linear_sieve_of_eratosthenes(n):CODE
LOWPython/maximize-cyclic-partition-score.py12 def best_time_to_buy_and_sell_stock_v(base):CODE
LOW…/minimum-jumps-to-reach-end-via-prime-teleportation.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
LOWPython/divisible-game.py9def linear_sieve_of_eratosthenes(n): # Time: O(n), Space: O(n)CODE
7 more matches not shown…
Unused Imports17 hits · 17 pts
SeverityFileLineSnippetContext
LOWPython/smallest-rectangle-enclosing-black-pixels.py4CODE
LOWPython/number-of-distinct-roll-sequences.py4CODE
LOWPython/minimum-cost-to-split-an-array.py4CODE
LOWPython/verbal-arithmetic-puzzle.py4CODE
LOW…al-array-state-after-k-multiplication-operations-ii.py4CODE
LOW…al-array-state-after-k-multiplication-operations-ii.py47CODE
LOWPython/match-substring-after-replacement.py4CODE
LOWPython/match-substring-after-replacement.py32CODE
LOWPython/course-schedule-iii.py4CODE
LOWPython/distinct-subsequences-ii.py4CODE
LOWPython/frequencies-of-shortest-supersequences.py4CODE
LOWPython/median-of-a-row-wise-sorted-matrix.py4CODE
LOW…nal-array-state-after-k-multiplication-operations-i.py4CODE
LOW…nal-array-state-after-k-multiplication-operations-i.py46CODE
LOW…number-of-nodes-in-the-sub-tree-with-the-same-label.py49CODE
LOW…on/design-an-expression-tree-with-evaluate-function.py4CODE
LOWPython/multiply-two-polynomials.py5CODE
AI Structural Patterns9 hits · 9 pts
SeverityFileLineSnippetContext
LOW…hon/number-of-ways-to-reorder-array-to-get-same-bst.py61CODE
LOWPython/maximum-difference-between-node-and-ancestor.py50CODE
LOWPython/minimum-cost-to-make-arrays-identical.py23CODE
LOWPython/maximum-total-value.py41CODE
LOW…thmetic-sequence-after-changing-at-most-one-element.py31CODE
LOWPython/count-the-number-of-infection-sequences.py31CODE
LOWPython/maximum-coins-from-k-consecutive-bags.py27CODE
LOWPython/number-of-1-bits.py64CODE
LOWPython/subsequence-with-the-minimum-score.py25CODE
Decorative Section Separators3 hits · 9 pts
SeverityFileLineSnippetContext
MEDIUMPython/sum-of-all-odd-length-subarrays.py14 # ----------------------------COMMENT
MEDIUMPython/maximum-number-of-ones.py32 # ---------------------------COMMENT
MEDIUMPython/maximum-number-of-ones.py38 # ---------------------------COMMENT
Overly Generic Function Names2 hits · 2 pts
SeverityFileLineSnippetContext
LOWPython/convert-sorted-array-to-binary-search-tree.py55 def helper(self, start, end):CODE
LOW…uct-binary-tree-from-preorder-and-inorder-traversal.py42 def helper(start, end):CODE
AI Slop Vocabulary1 hit · 1 pts
SeverityFileLineSnippetContext
LOW…r-that-sum-of-the-prices-is-less-than-or-equal-to-k.py131 return binary_search_right(1, max(k<<2, 1<<x), lambda v: count(v) <= k) # right bound is verified by checking aCODE