AI Slop Code RIsk Monitor

krahets/hello-algo

《Hello 算法》:动画图解、一键运行的数据结构与算法教程。支持简中、繁中、English、日本語,提供 Python, Java, C++, C, C#, JS, Go, Swift, Rust, Ruby, Kotlin, TS, Dart 等代码实现

6.9 Moderate pattern signal View on GitHub

Maintenance and Governance Review

This report summarizes scanner evidence for krahets/hello-algo, a Java project with 130,515 GitHub stars. SynthScan examined 536,719 lines of code across 7039 source files, recording 963 pattern matches distributed across 13 syntactic categories. The legacy adjusted pattern signal is 6.9 (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.

6.9
Adjusted Signal
6.9
Raw Pattern Score
100%
Time Factor
2026-10-10
Last Push
130.5K
Stars
Java
Language
536.7K
Lines of Code
7.0K
Files
963
Pattern Hits
2026-10-12
Scan Date
0.09
HC Hit Rate

Risk Review · v3

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

Cognitive Ownership Risk 2.6/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 10.9/100 · LOW

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

Agent Over-Engineering Ratio 19.2/100 · LOW

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

PR Review Velocity Impact 31.5/100 · MEDIUM

Which changes need focused human review? 963 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 612MEDIUM 21LOW 330

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 963 distinct pattern matches across 13 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 Repetition430 hits · 2150 pts
SeverityFileLineSnippetContext
HIGHzh-hant/codes/python/chapter_searching/binary_search.py0file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_searching/binary_search.py0file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_searching/binary_search.py0file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_searching/binary_search.py0file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_searching/binary_search.py0file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGH…es/python/chapter_searching/binary_search_insertion.py0file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGH…es/python/chapter_searching/binary_search_insertion.py0file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGH…es/python/chapter_searching/binary_search_insertion.py0file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGH…es/python/chapter_searching/binary_search_insertion.py0file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGH…es/python/chapter_searching/binary_search_insertion.py0file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGH…-hant/codes/python/chapter_searching/hashing_search.py0file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_searching/hashing_search.py0file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_searching/hashing_search.py0file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_searching/hashing_search.py0file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_searching/hashing_search.py0file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGH…t/codes/python/chapter_searching/binary_search_edge.py0file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGHja/codes/python/chapter_searching/binary_search_edge.py0file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGHru/codes/python/chapter_searching/binary_search_edge.py0file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGHcodes/python/chapter_searching/binary_search_edge.py0file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGHen/codes/python/chapter_searching/binary_search_edge.py0file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com)STRING
HIGHzh-hant/codes/python/chapter_searching/linear_search.py0file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_searching/linear_search.py0file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_searching/linear_search.py0file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_searching/linear_search.py0file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_searching/linear_search.py0file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com)STRING
HIGHzh-hant/codes/python/chapter_searching/two_sum.py0file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com)STRING
HIGHja/codes/python/chapter_searching/two_sum.py0file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com)STRING
HIGHru/codes/python/chapter_searching/two_sum.py0file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com)STRING
HIGHcodes/python/chapter_searching/two_sum.py0file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com)STRING
HIGHen/codes/python/chapter_searching/two_sum.py0file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/bucket_sort.py0file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com)STRING
HIGHja/codes/python/chapter_sorting/bucket_sort.py0file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com)STRING
HIGHru/codes/python/chapter_sorting/bucket_sort.py0file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com)STRING
HIGHcodes/python/chapter_sorting/bucket_sort.py0file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com)STRING
HIGHen/codes/python/chapter_sorting/bucket_sort.py0file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/quick_sort.py0file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_sorting/quick_sort.py0file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_sorting/quick_sort.py0file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_sorting/quick_sort.py0file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_sorting/quick_sort.py0file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/merge_sort.py0file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com)STRING
HIGHja/codes/python/chapter_sorting/merge_sort.py0file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com)STRING
HIGHru/codes/python/chapter_sorting/merge_sort.py0file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com)STRING
HIGHcodes/python/chapter_sorting/merge_sort.py0file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com)STRING
HIGHen/codes/python/chapter_sorting/merge_sort.py0file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/insertion_sort.py0file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_sorting/insertion_sort.py0file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_sorting/insertion_sort.py0file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_sorting/insertion_sort.py0file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_sorting/insertion_sort.py0file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/bubble_sort.py0file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHja/codes/python/chapter_sorting/bubble_sort.py0file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHru/codes/python/chapter_sorting/bubble_sort.py0file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHcodes/python/chapter_sorting/bubble_sort.py0file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHen/codes/python/chapter_sorting/bubble_sort.py0file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com)STRING
HIGHzh-hant/codes/python/chapter_sorting/selection_sort.py0file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com)STRING
HIGHja/codes/python/chapter_sorting/selection_sort.py0file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com)STRING
HIGHru/codes/python/chapter_sorting/selection_sort.py0file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com)STRING
HIGHcodes/python/chapter_sorting/selection_sort.py0file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com)STRING
HIGHen/codes/python/chapter_sorting/selection_sort.py0file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com)STRING
370 more matches not shown…
Cross-Language Confusion120 hits · 850 pts
SeverityFileLineSnippetContext
HIGHzh-hant/codes/python/chapter_heap/my_heap.py122 max_heap.push(val)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_stack.py50 stack.push(1)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_stack.py51 stack.push(3)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_stack.py52 stack.push(2)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_stack.py53 stack.push(5)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_stack.py54 stack.push(4)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py67 stack.push(1)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py68 stack.push(3)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py69 stack.push(2)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py70 stack.push(5)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py71 stack.push(4)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_queue.py70 queue.push(1)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_queue.py71 queue.push(3)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_queue.py72 queue.push(2)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_queue.py73 queue.push(5)CODE
HIGH⚡…nt/codes/python/chapter_stack_and_queue/array_queue.py74 queue.push(4)CODE
HIGH…nt/codes/python/chapter_stack_and_queue/array_queue.py96 queue.push(i)CODE
HIGH…des/python/chapter_stack_and_queue/linkedlist_deque.py57 self.push(num, True)CODE
HIGH…des/python/chapter_stack_and_queue/linkedlist_deque.py61 self.push(num, False)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py75 queue.push(1)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py76 queue.push(3)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py77 queue.push(2)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py78 queue.push(5)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py79 queue.push(4)CODE
HIGHja/codes/python/chapter_heap/my_heap.py122 max_heap.push(val)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_stack.py50 stack.push(1)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_stack.py51 stack.push(3)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_stack.py52 stack.push(2)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_stack.py53 stack.push(5)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_stack.py54 stack.push(4)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py67 stack.push(1)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py68 stack.push(3)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py69 stack.push(2)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py70 stack.push(5)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py71 stack.push(4)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_queue.py70 queue.push(1)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_queue.py71 queue.push(3)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_queue.py72 queue.push(2)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_queue.py73 queue.push(5)CODE
HIGH⚡ja/codes/python/chapter_stack_and_queue/array_queue.py74 queue.push(4)CODE
HIGHja/codes/python/chapter_stack_and_queue/array_queue.py96 queue.push(i)CODE
HIGH…des/python/chapter_stack_and_queue/linkedlist_deque.py57 self.push(num, True)CODE
HIGH…des/python/chapter_stack_and_queue/linkedlist_deque.py61 self.push(num, False)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py75 queue.push(1)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py76 queue.push(3)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py77 queue.push(2)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py78 queue.push(5)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_queue.py79 queue.push(4)CODE
HIGHru/codes/python/chapter_heap/my_heap.py122 max_heap.push(val)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_stack.py50 stack.push(1)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_stack.py51 stack.push(3)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_stack.py52 stack.push(2)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_stack.py53 stack.push(5)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_stack.py54 stack.push(4)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py67 stack.push(1)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py68 stack.push(3)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py69 stack.push(2)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py70 stack.push(5)CODE
HIGH⚡…des/python/chapter_stack_and_queue/linkedlist_stack.py71 stack.push(4)CODE
HIGH⚡ru/codes/python/chapter_stack_and_queue/array_queue.py70 queue.push(1)CODE
60 more matches not shown…
Cross-Language Confusion (JS/TS)60 hits · 300 pts
SeverityFileLineSnippetContext
HIGH…typescript/chapter_stack_and_queue/linkedlist_deque.ts129 print(): void {CODE
HIGH…des/typescript/chapter_graph/graph_adjacency_matrix.ts89 print(): void {CODE
HIGH…codes/typescript/chapter_graph/graph_adjacency_list.ts83 print(): void {CODE
HIGH…/codes/typescript/chapter_hashing/hash_map_chaining.ts110 print(): void {CODE
HIGH…typescript/chapter_hashing/hash_map_open_addressing.ts144 print(): void {CODE
HIGHzh-hant/codes/javascript/chapter_heap/my_heap.js115 print() {CODE
HIGH…javascript/chapter_stack_and_queue/linkedlist_deque.js129 print() {CODE
HIGH…codes/javascript/chapter_graph/graph_adjacency_list.js83 print() {CODE
HIGH…des/javascript/chapter_graph/graph_adjacency_matrix.js89 print() {CODE
HIGH…/codes/javascript/chapter_hashing/hash_map_chaining.js108 print() {CODE
HIGH…ant/codes/javascript/chapter_hashing/array_hash_map.js83 print() {CODE
HIGH…javascript/chapter_hashing/hash_map_open_addressing.js141 print() {CODE
HIGH…typescript/chapter_stack_and_queue/linkedlist_deque.ts129 print(): void {CODE
HIGH…des/typescript/chapter_graph/graph_adjacency_matrix.ts89 print(): void {CODE
HIGH…codes/typescript/chapter_graph/graph_adjacency_list.ts83 print(): void {CODE
HIGH…/codes/typescript/chapter_hashing/hash_map_chaining.ts110 print(): void {CODE
HIGH…typescript/chapter_hashing/hash_map_open_addressing.ts144 print(): void {CODE
HIGHja/codes/javascript/chapter_heap/my_heap.js115 print() {CODE
HIGH…javascript/chapter_stack_and_queue/linkedlist_deque.js129 print() {CODE
HIGH…codes/javascript/chapter_graph/graph_adjacency_list.js83 print() {CODE
HIGH…des/javascript/chapter_graph/graph_adjacency_matrix.js89 print() {CODE
HIGH…/codes/javascript/chapter_hashing/hash_map_chaining.js108 print() {CODE
HIGHja/codes/javascript/chapter_hashing/array_hash_map.js83 print() {CODE
HIGH…javascript/chapter_hashing/hash_map_open_addressing.js141 print() {CODE
HIGH…typescript/chapter_stack_and_queue/linkedlist_deque.ts129 print(): void {CODE
HIGH…des/typescript/chapter_graph/graph_adjacency_matrix.ts89 print(): void {CODE
HIGH…codes/typescript/chapter_graph/graph_adjacency_list.ts83 print(): void {CODE
HIGH…/codes/typescript/chapter_hashing/hash_map_chaining.ts110 print(): void {CODE
HIGH…typescript/chapter_hashing/hash_map_open_addressing.ts144 print(): void {CODE
HIGHru/codes/javascript/chapter_heap/my_heap.js115 print() {CODE
HIGH…javascript/chapter_stack_and_queue/linkedlist_deque.js129 print() {CODE
HIGH…codes/javascript/chapter_graph/graph_adjacency_list.js83 print() {CODE
HIGH…des/javascript/chapter_graph/graph_adjacency_matrix.js89 print() {CODE
HIGH…/codes/javascript/chapter_hashing/hash_map_chaining.js108 print() {CODE
HIGHru/codes/javascript/chapter_hashing/array_hash_map.js83 print() {CODE
HIGH…javascript/chapter_hashing/hash_map_open_addressing.js141 print() {CODE
HIGH…typescript/chapter_stack_and_queue/linkedlist_deque.ts129 print(): void {CODE
HIGH…des/typescript/chapter_graph/graph_adjacency_matrix.ts89 print(): void {CODE
HIGHcodes/typescript/chapter_graph/graph_adjacency_list.ts83 print(): void {CODE
HIGHcodes/typescript/chapter_hashing/hash_map_chaining.ts110 print(): void {CODE
HIGH…typescript/chapter_hashing/hash_map_open_addressing.ts144 print(): void {CODE
HIGHcodes/javascript/chapter_heap/my_heap.js115 print() {CODE
HIGH…javascript/chapter_stack_and_queue/linkedlist_deque.js129 print() {CODE
HIGHcodes/javascript/chapter_graph/graph_adjacency_list.js83 print() {CODE
HIGH…des/javascript/chapter_graph/graph_adjacency_matrix.js89 print() {CODE
HIGHcodes/javascript/chapter_hashing/hash_map_chaining.js108 print() {CODE
HIGHcodes/javascript/chapter_hashing/array_hash_map.js83 print() {CODE
HIGH…javascript/chapter_hashing/hash_map_open_addressing.js141 print() {CODE
HIGH…typescript/chapter_stack_and_queue/linkedlist_deque.ts129 print(): void {CODE
HIGH…des/typescript/chapter_graph/graph_adjacency_matrix.ts89 print(): void {CODE
HIGH…codes/typescript/chapter_graph/graph_adjacency_list.ts83 print(): void {CODE
HIGH…/codes/typescript/chapter_hashing/hash_map_chaining.ts110 print(): void {CODE
HIGH…typescript/chapter_hashing/hash_map_open_addressing.ts144 print(): void {CODE
HIGHen/codes/javascript/chapter_heap/my_heap.js115 print() {CODE
HIGH…javascript/chapter_stack_and_queue/linkedlist_deque.js129 print() {CODE
HIGH…codes/javascript/chapter_graph/graph_adjacency_list.js83 print() {CODE
HIGH…des/javascript/chapter_graph/graph_adjacency_matrix.js89 print() {CODE
HIGH…/codes/javascript/chapter_hashing/hash_map_chaining.js108 print() {CODE
HIGHen/codes/javascript/chapter_hashing/array_hash_map.js83 print() {CODE
HIGH…javascript/chapter_hashing/hash_map_open_addressing.js141 print() {CODE
Hyper-Verbose Identifiers100 hits · 100 pts
SeverityFileLineSnippetContext
LOW…es/python/chapter_searching/binary_search_insertion.py8def binary_search_insertion_simple(nums: list[int], target: int) -> int:CODE
LOW…-hant/codes/python/chapter_searching/hashing_search.py21def hashing_search_linkedlist(CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.py8def climbing_stairs_constraint_dp(n: int) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py8def min_cost_climbing_stairs_dp(cost: list[int]) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py23def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int:CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.py23def climbing_stairs_backtrack(n: int) -> int:CODE
LOW…thon/chapter_dynamic_programming/unbounded_knapsack.py25def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int:CODE
LOW…ypescript/chapter_searching/binary_search_insertion.ts8function binarySearchInsertionSimple(CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.ts26function minCostClimbingStairsDPComp(cost: Array<number>): number {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.ts8function climbingStairsConstraintDP(n: number): number {CODE
LOW…avascript/chapter_searching/binary_search_insertion.js8function binarySearchInsertionSimple(nums, target) {CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.js26function minCostClimbingStairsDPComp(cost) {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.js8function climbingStairsConstraintDP(n) {CODE
LOWzh-hant/codes/ruby/chapter_searching/hashing_search.rb17def hashing_search_linkedlist(hmap, target)CODE
LOW…odes/ruby/chapter_searching/binary_search_insertion.rb8def binary_search_insertion_simple(nums, target)CODE
LOW…ruby/chapter_dynamic_programming/unbounded_knapsack.rb28def unbounded_knapsack_dp_comp(wgt, val, cap)CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.rb23def climbing_stairs_backtrack(n)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb8def min_cost_climbing_stairs_dp(cost)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb21def min_cost_climbing_stairs_dp_comp(cost)CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.rb8def climbing_stairs_constraint_dp(n)CODE
LOW…es/python/chapter_searching/binary_search_insertion.py8def binary_search_insertion_simple(nums: list[int], target: int) -> int:CODE
LOWja/codes/python/chapter_searching/hashing_search.py21def hashing_search_linkedlist(CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.py8def climbing_stairs_constraint_dp(n: int) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py8def min_cost_climbing_stairs_dp(cost: list[int]) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py23def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int:CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.py23def climbing_stairs_backtrack(n: int) -> int:CODE
LOW…thon/chapter_dynamic_programming/unbounded_knapsack.py25def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int:CODE
LOW…ypescript/chapter_searching/binary_search_insertion.ts8function binarySearchInsertionSimple(CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.ts26function minCostClimbingStairsDPComp(cost: Array<number>): number {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.ts8function climbingStairsConstraintDP(n: number): number {CODE
LOW…avascript/chapter_searching/binary_search_insertion.js8function binarySearchInsertionSimple(nums, target) {CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.js26function minCostClimbingStairsDPComp(cost) {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.js8function climbingStairsConstraintDP(n) {CODE
LOWja/codes/ruby/chapter_searching/hashing_search.rb17def hashing_search_linkedlist(hmap, target)CODE
LOW…odes/ruby/chapter_searching/binary_search_insertion.rb8def binary_search_insertion_simple(nums, target)CODE
LOW…ruby/chapter_dynamic_programming/unbounded_knapsack.rb28def unbounded_knapsack_dp_comp(wgt, val, cap)CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.rb23def climbing_stairs_backtrack(n)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb8def min_cost_climbing_stairs_dp(cost)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb21def min_cost_climbing_stairs_dp_comp(cost)CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.rb8def climbing_stairs_constraint_dp(n)CODE
LOW…es/python/chapter_searching/binary_search_insertion.py8def binary_search_insertion_simple(nums: list[int], target: int) -> int:CODE
LOWru/codes/python/chapter_searching/hashing_search.py21def hashing_search_linkedlist(CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.py8def climbing_stairs_constraint_dp(n: int) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py8def min_cost_climbing_stairs_dp(cost: list[int]) -> int:CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.py23def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int:CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.py23def climbing_stairs_backtrack(n: int) -> int:CODE
LOW…thon/chapter_dynamic_programming/unbounded_knapsack.py25def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int:CODE
LOW…ypescript/chapter_searching/binary_search_insertion.ts8function binarySearchInsertionSimple(CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.ts26function minCostClimbingStairsDPComp(cost: Array<number>): number {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.ts8function climbingStairsConstraintDP(n: number): number {CODE
LOW…avascript/chapter_searching/binary_search_insertion.js8function binarySearchInsertionSimple(nums, target) {CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.js26function minCostClimbingStairsDPComp(cost) {CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.js8function climbingStairsConstraintDP(n) {CODE
LOWru/codes/ruby/chapter_searching/hashing_search.rb17def hashing_search_linkedlist(hmap, target)CODE
LOW…odes/ruby/chapter_searching/binary_search_insertion.rb8def binary_search_insertion_simple(nums, target)CODE
LOW…ruby/chapter_dynamic_programming/unbounded_knapsack.rb28def unbounded_knapsack_dp_comp(wgt, val, cap)CODE
LOW…apter_dynamic_programming/climbing_stairs_backtrack.rb23def climbing_stairs_backtrack(n)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb8def min_cost_climbing_stairs_dp(cost)CODE
LOW…ter_dynamic_programming/min_cost_climbing_stairs_dp.rb21def min_cost_climbing_stairs_dp_comp(cost)CODE
LOW…r_dynamic_programming/climbing_stairs_constraint_dp.rb8def climbing_stairs_constraint_dp(n)CODE
40 more matches not shown…
Over-Commented Block91 hits · 91 pts
SeverityFileLineSnippetContext
LOWzh-hant/codes/go/pkg/tree_node.go21 Right: nil,COMMENT
LOWzh-hant/codes/python/modules/tree_node.py21 # 二元樹的陣列表示:COMMENT
LOWzh-hant/codes/rust/include/tree_node.rs41COMMENT
LOWzh-hant/codes/rust/src/include/tree_node.rs41COMMENT
LOWzh-hant/codes/java/utils/TreeNode.java21 }COMMENT
LOWzh-hant/codes/kotlin/utils/TreeNode.kt21 // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWzh-hant/codes/cpp/utils/tree_node.hpp21 TreeNode() = default;COMMENT
LOWzh-hant/codes/cpp/utils/common.hpp1/**COMMENT
LOWzh-hant/codes/cpp/utils/common.hpp21#include <vector>COMMENT
LOWzh-hant/codes/swift/utils/TreeNode.swift21 // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/COMMENT
LOWzh-hant/codes/c/utils/tree_node.h41// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWzh-hant/codes/c/utils/uthash.h21SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.COMMENT
LOWzh-hant/codes/c/utils/uthash.h41#endifCOMMENT
LOWzh-hant/codes/c/utils/uthash.h61#endifCOMMENT
LOWzh-hant/codes/c/utils/uthash.h81#define uthash_free(ptr,sz) free(ptr) /* free fcn */COMMENT
LOWzh-hant/codes/c/utils/uthash.h101#ifndef uthash_expand_fyiCOMMENT
LOWzh-hant/codes/c/utils/uthash.h121COMMENT
LOWzh-hant/codes/c/utils/common.h1/**COMMENT
LOWzh-hant/codes/c/utils/common.h21#include "vertex.h"COMMENT
LOWja/codes/go/pkg/tree_node.go21 Right: nil,COMMENT
LOWja/codes/python/modules/tree_node.py21 # 二分木の配列表現:COMMENT
LOWja/codes/rust/src/include/tree_node.rs41COMMENT
LOWja/codes/java/utils/TreeNode.java21 }COMMENT
LOWja/codes/kotlin/utils/TreeNode.kt21 // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWja/codes/cpp/utils/tree_node.hpp21 TreeNode() = default;COMMENT
LOWja/codes/cpp/utils/common.hpp1/**COMMENT
LOWja/codes/cpp/utils/common.hpp21#include <vector>COMMENT
LOWja/codes/swift/utils/TreeNode.swift21 // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/COMMENT
LOWja/codes/c/utils/tree_node.h41// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWja/codes/c/utils/uthash.h21SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.COMMENT
LOWja/codes/c/utils/uthash.h41#endifCOMMENT
LOWja/codes/c/utils/uthash.h61#endifCOMMENT
LOWja/codes/c/utils/uthash.h81#define uthash_free(ptr,sz) free(ptr) /* free fcn */COMMENT
LOWja/codes/c/utils/uthash.h101#ifndef uthash_expand_fyiCOMMENT
LOWja/codes/c/utils/uthash.h121COMMENT
LOWja/codes/c/utils/common.h1/**COMMENT
LOWja/codes/c/utils/common.h21#include "vertex.h"COMMENT
LOWru/codes/go/pkg/tree_node.go21 Right: nil,COMMENT
LOWru/codes/python/modules/tree_node.py21 # Массивное представление двоичного дерева:COMMENT
LOWru/codes/rust/src/include/tree_node.rs41COMMENT
LOWru/codes/java/utils/TreeNode.java21 }COMMENT
LOWru/codes/kotlin/utils/TreeNode.kt21 // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWru/codes/cpp/utils/tree_node.hpp21 TreeNode() = default;COMMENT
LOWru/codes/cpp/utils/common.hpp1/**COMMENT
LOWru/codes/cpp/utils/common.hpp21#include <vector>COMMENT
LOWru/codes/swift/utils/TreeNode.swift21 // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/COMMENT
LOWru/codes/c/utils/tree_node.h41// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
LOWru/codes/c/utils/uthash.h21SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.COMMENT
LOWru/codes/c/utils/uthash.h41#endifCOMMENT
LOWru/codes/c/utils/uthash.h61#endifCOMMENT
LOWru/codes/c/utils/uthash.h81#define uthash_free(ptr,sz) free(ptr) /* free fcn */COMMENT
LOWru/codes/c/utils/uthash.h101#ifndef uthash_expand_fyiCOMMENT
LOWru/codes/c/utils/uthash.h121COMMENT
LOWru/codes/c/utils/common.h1/**COMMENT
LOWru/codes/c/utils/common.h21#include "vertex.h"COMMENT
LOWcodes/go/pkg/tree_node.go21 Right: nil,COMMENT
LOWcodes/python/modules/tree_node.py21 # 二叉树的数组表示:COMMENT
LOWcodes/rust/src/include/tree_node.rs41COMMENT
LOWcodes/java/utils/TreeNode.java21 }COMMENT
LOWcodes/kotlin/utils/TreeNode.kt21 // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]COMMENT
31 more matches not shown…
Unused Imports90 hits · 90 pts
SeverityFileLineSnippetContext
LOWzh-hant/codes/python/chapter_tree/array_binary_tree.py11CODE
LOWzh-hant/codes/python/modules/tree_node.py7CODE
LOWzh-hant/codes/python/modules/__init__.py3CODE
LOWzh-hant/codes/python/modules/__init__.py6CODE
LOWzh-hant/codes/python/modules/__init__.py6CODE
LOWzh-hant/codes/python/modules/__init__.py6CODE
LOWzh-hant/codes/python/modules/__init__.py11CODE
LOWzh-hant/codes/python/modules/__init__.py11CODE
LOWzh-hant/codes/python/modules/__init__.py11CODE
LOWzh-hant/codes/python/modules/__init__.py12CODE
LOWzh-hant/codes/python/modules/__init__.py12CODE
LOWzh-hant/codes/python/modules/__init__.py12CODE
LOWzh-hant/codes/python/modules/__init__.py13CODE
LOWzh-hant/codes/python/modules/__init__.py13CODE
LOWzh-hant/codes/python/modules/__init__.py13CODE
LOWzh-hant/codes/python/modules/__init__.py13CODE
LOWzh-hant/codes/python/modules/__init__.py13CODE
LOW…t/codes/python/chapter_graph/graph_adjacency_matrix.py11CODE
LOWja/codes/python/chapter_tree/array_binary_tree.py11CODE
LOWja/codes/python/modules/tree_node.py7CODE
LOWja/codes/python/modules/__init__.py3CODE
LOWja/codes/python/modules/__init__.py6CODE
LOWja/codes/python/modules/__init__.py6CODE
LOWja/codes/python/modules/__init__.py6CODE
LOWja/codes/python/modules/__init__.py11CODE
LOWja/codes/python/modules/__init__.py11CODE
LOWja/codes/python/modules/__init__.py11CODE
LOWja/codes/python/modules/__init__.py12CODE
LOWja/codes/python/modules/__init__.py12CODE
LOWja/codes/python/modules/__init__.py12CODE
LOWja/codes/python/modules/__init__.py13CODE
LOWja/codes/python/modules/__init__.py13CODE
LOWja/codes/python/modules/__init__.py13CODE
LOWja/codes/python/modules/__init__.py13CODE
LOWja/codes/python/modules/__init__.py13CODE
LOWja/codes/python/chapter_graph/graph_adjacency_matrix.py11CODE
LOWru/codes/python/chapter_tree/array_binary_tree.py11CODE
LOWru/codes/python/modules/tree_node.py7CODE
LOWru/codes/python/modules/__init__.py3CODE
LOWru/codes/python/modules/__init__.py6CODE
LOWru/codes/python/modules/__init__.py6CODE
LOWru/codes/python/modules/__init__.py6CODE
LOWru/codes/python/modules/__init__.py11CODE
LOWru/codes/python/modules/__init__.py11CODE
LOWru/codes/python/modules/__init__.py11CODE
LOWru/codes/python/modules/__init__.py12CODE
LOWru/codes/python/modules/__init__.py12CODE
LOWru/codes/python/modules/__init__.py12CODE
LOWru/codes/python/modules/__init__.py13CODE
LOWru/codes/python/modules/__init__.py13CODE
LOWru/codes/python/modules/__init__.py13CODE
LOWru/codes/python/modules/__init__.py13CODE
LOWru/codes/python/modules/__init__.py13CODE
LOWru/codes/python/chapter_graph/graph_adjacency_matrix.py11CODE
LOWcodes/python/chapter_tree/array_binary_tree.py11CODE
LOWcodes/python/modules/tree_node.py7CODE
LOWcodes/python/modules/__init__.py3CODE
LOWcodes/python/modules/__init__.py6CODE
LOWcodes/python/modules/__init__.py6CODE
LOWcodes/python/modules/__init__.py6CODE
30 more matches not shown…
Redundant / Tautological Comments37 hits · 54 pts
SeverityFileLineSnippetContext
LOWen/codes/python/chapter_sorting/insertion_sort.py18 nums[j + 1] = base # Assign base to the correct positionCODE
LOWen/codes/python/chapter_heap/my_heap.py135 # Check if heap is emptyCOMMENT
LOWen/codes/python/chapter_heap/heap.py62 # Check if heap is emptyCOMMENT
LOWen/codes/python/chapter_array_and_linkedlist/array.py37 # Assign num to the element at index indexCOMMENT
LOWen/codes/python/chapter_stack_and_queue/array_stack.py70 # Check if it is emptyCOMMENT
LOWen/codes/python/chapter_stack_and_queue/queue.py37 # Check if the queue is emptyCOMMENT
LOWen/codes/python/chapter_stack_and_queue/deque.py40 # Check if the double-ended queue is emptyCOMMENT
LOW…des/python/chapter_stack_and_queue/linkedlist_stack.py87 # Check if it is emptyCOMMENT
LOWen/codes/python/chapter_stack_and_queue/array_deque.py127 # Check if the double-ended queue is emptyCOMMENT
LOWen/codes/python/chapter_stack_and_queue/stack.py34 # Check if it is emptyCOMMENT
LOWen/codes/python/chapter_stack_and_queue/array_queue.py90 # Check if the queue is emptyCOMMENT
LOW…des/python/chapter_stack_and_queue/linkedlist_deque.py152 # Check if the double-ended queue is emptyCOMMENT
LOW…des/python/chapter_stack_and_queue/linkedlist_queue.py95 # Check if the queue is emptyCOMMENT
LOW…hapter_backtracking/preorder_traversal_iii_template.py43 # Check if it is a solutionCOMMENT
LOWen/codes/ruby/chapter_sorting/insertion_sort.rb19 nums[j + 1] = base # Assign base to the correct positionCODE
LOWen/codes/ruby/chapter_heap/my_heap.rb48 ### Check if heap is empty ###COMMENT
LOWen/codes/ruby/chapter_heap/my_heap.rb125 # Check if heap is emptyCOMMENT
LOWen/codes/ruby/chapter_heap/my_heap.rb144 # Check if heap is emptyCOMMENT
LOWen/codes/ruby/chapter_array_and_linkedlist/array.rb40 # Assign num to the element at index indexCOMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb21 ### Check if queue is empty ###COMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb98 # Check if the queue is emptyCOMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb31 ### Check if deque is empty ###COMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb166 # Check if the double-ended queue is emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_queue.rb24 ### Check if queue is empty ###COMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_queue.rb97 # Check if the queue is emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/stack.rb34 # Check if emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_deque.rb24 ### Check if deque is empty ###COMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_deque.rb142 # Check if the double-ended queue is emptyCOMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb18 ### Check if stack is empty ###COMMENT
LOW…codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb84 # Check if emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/deque.rb39 # Check if the double-ended queue is emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/queue.rb35 # Check if the queue is emptyCOMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_stack.rb19 ### Check if stack is empty ###COMMENT
LOWen/codes/ruby/chapter_stack_and_queue/array_stack.rb75 # Check if emptyCOMMENT
LOW…hapter_backtracking/preorder_traversal_iii_template.rb10### Check if current state is solution ###COMMENT
LOW…hapter_backtracking/preorder_traversal_iii_template.rb20### Check if choice is valid in current state ###COMMENT
LOW…hapter_backtracking/preorder_traversal_iii_template.rb37 # Check if it is a solutionCOMMENT
Excessive Try-Catch Wrapping15 hits · 30 pts
SeverityFileLineSnippetContext
MEDIUMzh-hant/codes/dart/build.dart16 print('Error: $e');CODE
MEDIUMzh-hant/codes/dart/build.dart28 print('Error: $e');CODE
MEDIUMzh-hant/codes/dart/build.dart38 print('Error: $errorCount');CODE
MEDIUMja/codes/dart/build.dart16 print('Error: $e');CODE
MEDIUMja/codes/dart/build.dart28 print('Error: $e');CODE
MEDIUMja/codes/dart/build.dart38 print('Error: $errorCount');CODE
MEDIUMru/codes/dart/build.dart16 print('Error: $e');CODE
MEDIUMru/codes/dart/build.dart28 print('Error: $e');CODE
MEDIUMru/codes/dart/build.dart38 print('Error: $errorCount');CODE
MEDIUMcodes/dart/build.dart16 print('Error: $e');CODE
MEDIUMcodes/dart/build.dart28 print('Error: $e');CODE
MEDIUMcodes/dart/build.dart38 print('Error: $errorCount');CODE
MEDIUMen/codes/dart/build.dart16 print('Error: $e');CODE
MEDIUMen/codes/dart/build.dart28 print('Error: $e');CODE
MEDIUMen/codes/dart/build.dart38 print('Error: $errorCount');CODE
AI Response Leakage2 hits · 15 pts
SeverityFileLineSnippetContext
HIGHen/docs/chapter_heap/heap.md48 # In this example, flag = 1 corresponds to a min heap, flag = -1 corresponds to a max heapCOMMENT
HIGHen/codes/python/chapter_heap/heap.py38 # In this example, flag = 1 corresponds to min heap, flag = -1 corresponds to max heapCOMMENT
Self-Referential Comments6 hits · 14 pts
SeverityFileLineSnippetContext
MEDIUMen/codes/python/chapter_sorting/merge_sort.py11 # Create a temporary array tmp to store the merged resultsCOMMENT
MEDIUM…s/python/chapter_computational_complexity/iteration.py20 i = 1 # Initialize condition variableCODE
MEDIUM…s/python/chapter_computational_complexity/iteration.py31 i = 1 # Initialize condition variableCODE
MEDIUMen/codes/python/chapter_array_and_linkedlist/my_list.py76 # Create a new array with length _extend_ratio times the original array, and copy the original array to the new COMMENT
MEDIUM…des/ruby/chapter_computational_complexity/iteration.rb22 i = 1 # Initialize condition variableCODE
MEDIUM…des/ruby/chapter_computational_complexity/iteration.rb36 i = 1 # Initialize condition variableCODE
AI Structural Patterns5 hits · 5 pts
SeverityFileLineSnippetContext
LOW…s/python/chapter_computational_complexity/recursion.py53CODE
LOW…s/python/chapter_computational_complexity/recursion.py53CODE
LOW…s/python/chapter_computational_complexity/recursion.py53CODE
LOW…s/python/chapter_computational_complexity/recursion.py53CODE
LOW…s/python/chapter_computational_complexity/recursion.py53CODE
Deep Nesting5 hits · 5 pts
SeverityFileLineSnippetContext
LOWzh-hant/codes/python/chapter_tree/avl_tree.py121CODE
LOWja/codes/python/chapter_tree/avl_tree.py121CODE
LOWru/codes/python/chapter_tree/avl_tree.py121CODE
LOWcodes/python/chapter_tree/avl_tree.py121CODE
LOWen/codes/python/chapter_tree/avl_tree.py121CODE
Structural Annotation Overuse2 hits · 3 pts
SeverityFileLineSnippetContext
LOW…cs/chapter_computational_complexity/time_complexity.md712### Step 1: Count the Number of OperationsCOMMENT
LOW…cs/chapter_computational_complexity/time_complexity.md973### Step 2: Determine the Asymptotic Upper BoundCOMMENT