《Hello 算法》:动画图解、一键运行的数据结构与算法教程。支持简中、繁中、English、日本語,提供 Python, Java, C++, C, C#, JS, Go, Swift, Rust, Ruby, Kotlin, TS, Dart 等代码实现
This report presents the forensic synthetic code analysis of krahets/hello-algo, a Java project with 128,476 GitHub stars. SynthScan v2.0 examined 523,674 lines of code across 6828 source files, recording 953 pattern matches distributed across 13 syntactic categories. The overall adjusted score of 7.0 places this repository in the Low AI signal band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 953 distinct pattern matches across 13 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. 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 diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | zh-hant/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | …-hant/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | …t/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | ja/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | ru/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | en/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) | STRING |
| HIGH | ja/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) | STRING |
| HIGH | ru/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) | STRING |
| HIGH | codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) | STRING |
| HIGH | en/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) | STRING |
| HIGH | zh-hant/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) | STRING |
| HIGH | ja/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) | STRING |
| HIGH | ru/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) | STRING |
| HIGH | codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) | STRING |
| HIGH | en/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) | STRING |
| 360 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | zh-hant/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 71 | queue.push(3) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 72 | queue.push(2) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 73 | queue.push(5) | CODE |
| HIGH⚡ | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 74 | queue.push(4) | CODE |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 96 | queue.push(i) | CODE |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 57 | self.push(num, True) | CODE |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 61 | self.push(num, False) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 75 | queue.push(1) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 76 | queue.push(3) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 77 | queue.push(2) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 78 | queue.push(5) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 79 | queue.push(4) | CODE |
| HIGH | ja/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_queue.py | 71 | queue.push(3) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_queue.py | 72 | queue.push(2) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_queue.py | 73 | queue.push(5) | CODE |
| HIGH⚡ | ja/codes/python/chapter_stack_and_queue/array_queue.py | 74 | queue.push(4) | CODE |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 96 | queue.push(i) | CODE |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 57 | self.push(num, True) | CODE |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 61 | self.push(num, False) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 75 | queue.push(1) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 76 | queue.push(3) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 77 | queue.push(2) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 78 | queue.push(5) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 79 | queue.push(4) | CODE |
| HIGH | ru/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) | CODE |
| HIGH⚡ | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) | CODE |
| HIGH⚡ | ru/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) | CODE |
| 60 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { | CODE |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { | CODE |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { | CODE |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { | CODE |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { | CODE |
| HIGH | zh-hant/codes/javascript/chapter_heap/my_heap.js | 115 | print() { | CODE |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { | CODE |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { | CODE |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { | CODE |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { | CODE |
| HIGH | …ant/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { | CODE |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { | CODE |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { | CODE |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { | CODE |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { | CODE |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { | CODE |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { | CODE |
| HIGH | ja/codes/javascript/chapter_heap/my_heap.js | 115 | print() { | CODE |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { | CODE |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { | CODE |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { | CODE |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { | CODE |
| HIGH | ja/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { | CODE |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { | CODE |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { | CODE |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { | CODE |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { | CODE |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { | CODE |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { | CODE |
| HIGH | ru/codes/javascript/chapter_heap/my_heap.js | 115 | print() { | CODE |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { | CODE |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { | CODE |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { | CODE |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { | CODE |
| HIGH | ru/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { | CODE |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { | CODE |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { | CODE |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { | CODE |
| HIGH | codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { | CODE |
| HIGH | codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { | CODE |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { | CODE |
| HIGH | codes/javascript/chapter_heap/my_heap.js | 115 | print() { | CODE |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { | CODE |
| HIGH | codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { | CODE |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { | CODE |
| HIGH | codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { | CODE |
| HIGH | codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { | CODE |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { | CODE |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { | CODE |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { | CODE |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { | CODE |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { | CODE |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { | CODE |
| HIGH | en/codes/javascript/chapter_heap/my_heap.js | 115 | print() { | CODE |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { | CODE |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { | CODE |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { | CODE |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { | CODE |
| HIGH | en/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { | CODE |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: | CODE |
| LOW | …-hant/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: | CODE |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: | CODE |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { | CODE |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { | CODE |
| LOW | zh-hant/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) | CODE |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) | CODE |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) | CODE |
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: | CODE |
| LOW | ja/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: | CODE |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: | CODE |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { | CODE |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { | CODE |
| LOW | ja/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) | CODE |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) | CODE |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) | CODE |
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: | CODE |
| LOW | ru/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: | CODE |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: | CODE |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { | CODE |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { | CODE |
| LOW | ru/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) | CODE |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) | CODE |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) | CODE |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) | CODE |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) | CODE |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) | CODE |
| 40 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | zh-hant/codes/go/pkg/tree_node.go | 21 | Right: nil, | COMMENT |
| LOW | zh-hant/codes/python/modules/tree_node.py | 21 | # 二元樹的陣列表示: | COMMENT |
| LOW | zh-hant/codes/rust/include/tree_node.rs | 41 | COMMENT | |
| LOW | zh-hant/codes/rust/src/include/tree_node.rs | 41 | COMMENT | |
| LOW | zh-hant/codes/java/utils/TreeNode.java | 21 | } | COMMENT |
| LOW | zh-hant/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | zh-hant/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; | COMMENT |
| LOW | zh-hant/codes/cpp/utils/common.hpp | 1 | /** | COMMENT |
| LOW | zh-hant/codes/cpp/utils/common.hpp | 21 | #include <vector> | COMMENT |
| LOW | zh-hant/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ | COMMENT |
| LOW | zh-hant/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 41 | #endif | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 61 | #endif | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi | COMMENT |
| LOW | zh-hant/codes/c/utils/uthash.h | 121 | COMMENT | |
| LOW | zh-hant/codes/c/utils/common.h | 1 | /** | COMMENT |
| LOW | zh-hant/codes/c/utils/common.h | 21 | #include "vertex.h" | COMMENT |
| LOW | ja/codes/go/pkg/tree_node.go | 21 | Right: nil, | COMMENT |
| LOW | ja/codes/python/modules/tree_node.py | 21 | # 二分木の配列表現: | COMMENT |
| LOW | ja/codes/rust/src/include/tree_node.rs | 41 | COMMENT | |
| LOW | ja/codes/java/utils/TreeNode.java | 21 | } | COMMENT |
| LOW | ja/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | ja/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; | COMMENT |
| LOW | ja/codes/cpp/utils/common.hpp | 1 | /** | COMMENT |
| LOW | ja/codes/cpp/utils/common.hpp | 21 | #include <vector> | COMMENT |
| LOW | ja/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ | COMMENT |
| LOW | ja/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 41 | #endif | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 61 | #endif | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi | COMMENT |
| LOW | ja/codes/c/utils/uthash.h | 121 | COMMENT | |
| LOW | ja/codes/c/utils/common.h | 1 | /** | COMMENT |
| LOW | ja/codes/c/utils/common.h | 21 | #include "vertex.h" | COMMENT |
| LOW | ru/codes/go/pkg/tree_node.go | 21 | Right: nil, | COMMENT |
| LOW | ru/codes/python/modules/tree_node.py | 21 | # Массивное представление двоичного дерева: | COMMENT |
| LOW | ru/codes/rust/src/include/tree_node.rs | 41 | COMMENT | |
| LOW | ru/codes/java/utils/TreeNode.java | 21 | } | COMMENT |
| LOW | ru/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | ru/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; | COMMENT |
| LOW | ru/codes/cpp/utils/common.hpp | 1 | /** | COMMENT |
| LOW | ru/codes/cpp/utils/common.hpp | 21 | #include <vector> | COMMENT |
| LOW | ru/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ | COMMENT |
| LOW | ru/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 41 | #endif | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 61 | #endif | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi | COMMENT |
| LOW | ru/codes/c/utils/uthash.h | 121 | COMMENT | |
| LOW | ru/codes/c/utils/common.h | 1 | /** | COMMENT |
| LOW | ru/codes/c/utils/common.h | 21 | #include "vertex.h" | COMMENT |
| LOW | codes/go/pkg/tree_node.go | 21 | Right: nil, | COMMENT |
| LOW | codes/python/modules/tree_node.py | 21 | # 二叉树的数组表示: | COMMENT |
| LOW | codes/rust/src/include/tree_node.rs | 41 | COMMENT | |
| LOW | codes/java/utils/TreeNode.java | 21 | } | COMMENT |
| LOW | codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] | COMMENT |
| 31 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | zh-hant/codes/python/chapter_tree/array_binary_tree.py | 11 | CODE | |
| LOW | zh-hant/codes/python/modules/tree_node.py | 7 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 3 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | …t/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | CODE | |
| LOW | ja/codes/python/chapter_tree/array_binary_tree.py | 11 | CODE | |
| LOW | ja/codes/python/modules/tree_node.py | 7 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 3 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ja/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ja/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | CODE | |
| LOW | ru/codes/python/chapter_tree/array_binary_tree.py | 11 | CODE | |
| LOW | ru/codes/python/modules/tree_node.py | 7 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 3 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 6 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 11 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 12 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ru/codes/python/modules/__init__.py | 13 | CODE | |
| LOW | ru/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | CODE | |
| LOW | codes/python/chapter_tree/array_binary_tree.py | 11 | CODE | |
| LOW | codes/python/modules/tree_node.py | 7 | CODE | |
| LOW | codes/python/modules/__init__.py | 3 | CODE | |
| LOW | codes/python/modules/__init__.py | 6 | CODE | |
| LOW | codes/python/modules/__init__.py | 6 | CODE | |
| LOW | codes/python/modules/__init__.py | 6 | CODE | |
| 30 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | en/codes/python/chapter_sorting/insertion_sort.py | 18 | nums[j + 1] = base # Assign base to the correct position | CODE |
| LOW | en/codes/python/chapter_heap/my_heap.py | 135 | # Check if heap is empty | COMMENT |
| LOW | en/codes/python/chapter_heap/heap.py | 62 | # Check if heap is empty | COMMENT |
| LOW | en/codes/python/chapter_array_and_linkedlist/array.py | 37 | # Assign num to the element at index index | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/array_stack.py | 70 | # Check if it is empty | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/queue.py | 37 | # Check if the queue is empty | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/deque.py | 40 | # Check if the double-ended queue is empty | COMMENT |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 87 | # Check if it is empty | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/array_deque.py | 127 | # Check if the double-ended queue is empty | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/stack.py | 34 | # Check if it is empty | COMMENT |
| LOW | en/codes/python/chapter_stack_and_queue/array_queue.py | 90 | # Check if the queue is empty | COMMENT |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 149 | # Check if the double-ended queue is empty | COMMENT |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 95 | # Check if the queue is empty | COMMENT |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.py | 43 | # Check if it is a solution | COMMENT |
| LOW | en/codes/ruby/chapter_sorting/insertion_sort.rb | 19 | nums[j + 1] = base # Assign base to the correct position | CODE |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 48 | ### Check if heap is empty ### | COMMENT |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 125 | # Check if heap is empty | COMMENT |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 144 | # Check if heap is empty | COMMENT |
| LOW | en/codes/ruby/chapter_array_and_linkedlist/array.rb | 40 | # Assign num to the element at index index | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb | 21 | ### Check if queue is empty ### | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb | 98 | # Check if the queue is empty | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb | 31 | ### Check if deque is empty ### | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb | 165 | # Check if the double-ended queue is empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_queue.rb | 24 | ### Check if queue is empty ### | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_queue.rb | 97 | # Check if the queue is empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/stack.rb | 34 | # Check if empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_deque.rb | 24 | ### Check if deque is empty ### | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_deque.rb | 142 | # Check if the double-ended queue is empty | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb | 18 | ### Check if stack is empty ### | COMMENT |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb | 84 | # Check if empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/deque.rb | 39 | # Check if the double-ended queue is empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/queue.rb | 35 | # Check if the queue is empty | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_stack.rb | 19 | ### Check if stack is empty ### | COMMENT |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_stack.rb | 75 | # Check if empty | COMMENT |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 10 | ### Check if current state is solution ### | COMMENT |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 20 | ### Check if choice is valid in current state ### | COMMENT |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 37 | # Check if it is a solution | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | zh-hant/codes/dart/build.dart | 16 | print('Error: $e'); | CODE |
| MEDIUM | zh-hant/codes/dart/build.dart | 28 | print('Error: $e'); | CODE |
| MEDIUM | zh-hant/codes/dart/build.dart | 38 | print('Error: $errorCount'); | CODE |
| MEDIUM | ja/codes/dart/build.dart | 16 | print('Error: $e'); | CODE |
| MEDIUM | ja/codes/dart/build.dart | 28 | print('Error: $e'); | CODE |
| MEDIUM | ja/codes/dart/build.dart | 38 | print('Error: $errorCount'); | CODE |
| MEDIUM | ru/codes/dart/build.dart | 16 | print('Error: $e'); | CODE |
| MEDIUM | ru/codes/dart/build.dart | 28 | print('Error: $e'); | CODE |
| MEDIUM | ru/codes/dart/build.dart | 38 | print('Error: $errorCount'); | CODE |
| MEDIUM | codes/dart/build.dart | 16 | print('Error: $e'); | CODE |
| MEDIUM | codes/dart/build.dart | 28 | print('Error: $e'); | CODE |
| MEDIUM | codes/dart/build.dart | 38 | print('Error: $errorCount'); | CODE |
| MEDIUM | en/codes/dart/build.dart | 16 | print('Error: $e'); | CODE |
| MEDIUM | en/codes/dart/build.dart | 28 | print('Error: $e'); | CODE |
| MEDIUM | en/codes/dart/build.dart | 38 | print('Error: $errorCount'); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | en/docs/chapter_heap/heap.md | 48 | # In this example, flag = 1 corresponds to a min heap, flag = -1 corresponds to a max heap | COMMENT |
| HIGH | en/codes/python/chapter_heap/heap.py | 38 | # In this example, flag = 1 corresponds to min heap, flag = -1 corresponds to max heap | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | en/codes/python/chapter_sorting/merge_sort.py | 11 | # Create a temporary array tmp to store the merged results | COMMENT |
| MEDIUM | …s/python/chapter_computational_complexity/iteration.py | 20 | i = 1 # Initialize condition variable | CODE |
| MEDIUM | …s/python/chapter_computational_complexity/iteration.py | 31 | i = 1 # Initialize condition variable | CODE |
| MEDIUM | en/codes/python/chapter_array_and_linkedlist/my_list.py | 76 | # 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.rb | 22 | i = 1 # Initialize condition variable | CODE |
| MEDIUM | …des/ruby/chapter_computational_complexity/iteration.rb | 36 | i = 1 # Initialize condition variable | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …s/python/chapter_computational_complexity/recursion.py | 53 | CODE | |
| LOW | …s/python/chapter_computational_complexity/recursion.py | 53 | CODE | |
| LOW | …s/python/chapter_computational_complexity/recursion.py | 53 | CODE | |
| LOW | …s/python/chapter_computational_complexity/recursion.py | 53 | CODE | |
| LOW | …s/python/chapter_computational_complexity/recursion.py | 53 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | zh-hant/codes/python/chapter_tree/avl_tree.py | 121 | CODE | |
| LOW | ja/codes/python/chapter_tree/avl_tree.py | 121 | CODE | |
| LOW | ru/codes/python/chapter_tree/avl_tree.py | 121 | CODE | |
| LOW | codes/python/chapter_tree/avl_tree.py | 121 | CODE | |
| LOW | en/codes/python/chapter_tree/avl_tree.py | 121 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …cs/chapter_computational_complexity/time_complexity.md | 712 | ### Step 1: Count the Number of Operations | COMMENT |
| LOW | …cs/chapter_computational_complexity/time_complexity.md | 973 | ### Step 2: Determine the Asymptotic Upper Bound | COMMENT |