1.0

Adjusted Signal

1.0

Raw Pattern Score

100%

Time Factor

2026-10-30

Last Push

36.7K

Stars

Java

Language

3.1M

Lines of Code

34.9K

Files

1.8K

Pattern Hits

2026-10-31

Scan Date

0.01

HC Hit Rate

Risk Review · Payload v1

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

Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.

Cognitive Ownership Risk 2.4/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.2/100 · LOW

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

Agent Over-Engineering Ratio 3.1/100 · LOW

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

PR Review Velocity Impact 5.4/100 · LOW

Which changes need focused human review? 1826 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 327MEDIUM 6LOW 1493

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 1826 distinct pattern matches across 14 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 Repetition307 hits · 1535 pts

Severity	File	Line	Snippet	Context
HIGH	…2.Search in a Sorted Array of Unknown Size/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…702.Search in a Sorted Array of Unknown Size/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	….Search in a Sorted Array of Unknown Size/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…9/1533.Find the Index of the Large Integer/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…599/1533.Find the Index of the Large Integer/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…/1533.Find the Index of the Large Integer/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…0-1799/1778.Shortest Path in a Hidden Grid/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…700-1799/1778.Shortest Path in a Hidden Grid/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…-1799/1778.Shortest Path in a Hidden Grid/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…99/1810.Minimum Path Cost in a Hidden Grid/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…1899/1810.Minimum Path Cost in a Hidden Grid/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…9/1810.Minimum Path Cost in a Hidden Grid/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…0-1299/1274.Number of Ships in a Rectangle/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…200-1299/1274.Number of Ships in a Rectangle/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…-1299/1274.Number of Ships in a Rectangle/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	solution/1200-1299/1236.Web Crawler/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	solution/1200-1299/1236.Web Crawler/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	solution/1200-1299/1236.Web Crawler/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…Maximum Font to Fit a Sentence in a Screen/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…8.Maximum Font to Fit a Sentence in a Screen/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…aximum Font to Fit a Sentence in a Screen/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…tion/1000-1099/1095.Find in Mountain Array/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…lution/1000-1099/1095.Find in Mountain Array/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…ion/1000-1099/1095.Find in Mountain Array/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…/1538.Guess the Majority in a Hidden Array/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…99/1538.Guess the Majority in a Hidden Array/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…1538.Guess the Majority in a Hidden Array/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…9/1428.Leftmost Column with at Least a One/Solution.py	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…499/1428.Leftmost Column with at Least a One/README.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	…/1428.Leftmost Column with at Least a One/README_EN.md	0	# this is binarymatrix's api interface. # you should not implement it, or speculate about its implementation #	STRING
HIGH	solution/0700-0799/0759.Employee Free Time/Solution.py	0	# definition for an interval. class interval: def __init__(self, start: int = none, end: int = none): self.start = start	STRING
HIGH	solution/0700-0799/0759.Employee Free Time/README.md	0	# definition for an interval. class interval: def __init__(self, start: int = none, end: int = none): self.start = start	STRING
HIGH	solution/0700-0799/0759.Employee Free Time/README_EN.md	0	# definition for an interval. class interval: def __init__(self, start: int = none, end: int = none): self.start = start	STRING
HIGH	….Insert into a Sorted Circular Linked List/Solution.py	0	# definition for a node. class node: def __init__(self, val=none, next=none): self.val = val self.next = next	STRING
HIGH	…08.Insert into a Sorted Circular Linked List/README.md	0	# definition for a node. class node: def __init__(self, val=none, next=none): self.val = val self.next = next	STRING
HIGH	…Insert into a Sorted Circular Linked List/README_EN.md	0	# definition for a node. class node: def __init__(self, val=none, next=none): self.val = val self.next = next	STRING
HIGH	lcof2/剑指 Offer II 029. 排序的循环链表/Solution.py	0	# definition for a node. class node: def __init__(self, val=none, next=none): self.val = val self.next = next	STRING
HIGH	lcof2/剑指 Offer II 029. 排序的循环链表/README.md	0	# definition for a node. class node: def __init__(self, val=none, next=none): self.val = val self.next = next	STRING
HIGH	solution/0200-0299/0286.Walls and Gates/Solution.py	0	do not return anything, modify rooms in-place instead.	STRING
HIGH	solution/0200-0299/0286.Walls and Gates/README.md	0	do not return anything, modify rooms in-place instead.	STRING
HIGH	solution/0200-0299/0286.Walls and Gates/README_EN.md	0	do not return anything, modify rooms in-place instead.	STRING
HIGH	solution/0200-0299/0280.Wiggle Sort/Solution.py	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0200-0299/0280.Wiggle Sort/README.md	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0200-0299/0280.Wiggle Sort/README_EN.md	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0300-0399/0324.Wiggle Sort II/Solution.py	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0300-0399/0324.Wiggle Sort II/README.md	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0300-0399/0324.Wiggle Sort II/README_EN.md	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0300-0399/0324.Wiggle Sort II/Solution2.py	0	do not return anything, modify nums in-place instead.	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# initializes an iterator object to the beginning of a list. # :type nums: list[int] #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# initializes an iterator object to the beginning of a list. # :type nums: list[int] #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	# initializes an iterator object to the beginning of a list. # :type nums: list[int] #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# returns true if the iteration has more elements. # :rtype: bool #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# returns true if the iteration has more elements. # :rtype: bool #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	# returns true if the iteration has more elements. # :rtype: bool #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# returns the next element in the iteration. # :rtype: int #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# returns the next element in the iteration. # :rtype: int #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	# returns the next element in the iteration. # :rtype: int #	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	initialize your data structure here. :type iterator: iterator	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	initialize your data structure here. :type iterator: iterator	STRING
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	initialize your data structure here. :type iterator: iterator	STRING
247 more matches not shown…

Over-Commented Block512 hits · 512 pts

Severity	File	Line	Snippet	Context
LOW	lcci/04.05.Legal Binary Search Tree/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.05.Legal Binary Search Tree/README.md	221	// pub struct TreeNode {	COMMENT
LOW	lcci/04.05.Legal Binary Search Tree/README_EN.md	261	// pub left: Option<Rc<RefCell<TreeNode>>>,	COMMENT
LOW	lcci/04.12.Paths with Sum/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.12.Paths with Sum/README.md	241	#### Rust	COMMENT
LOW	lcci/04.12.Paths with Sum/README_EN.md	261	// pub left: Option<Rc<RefCell<TreeNode>>>,	COMMENT
LOW	lcci/04.02.Minimum Height Tree/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.02.Minimum Height Tree/README.md	181	```	COMMENT
LOW	lcci/04.02.Minimum Height Tree/README_EN.md	201	return new TreeNode(nums[mid], dfs(l, mid - 1), dfs(mid + 1, r));	COMMENT
LOW	lcci/02.02.Kth Node From End of List/Solution.rs	1	// Definition for singly-linked list.	COMMENT
LOW	lcci/02.02.Kth Node From End of List/README.md	181	#### Rust	COMMENT
LOW	lcci/02.02.Kth Node From End of List/README_EN.md	181	}	COMMENT
LOW	lcci/03.05.Sort of Stacks/Solution.py	21	def isEmpty(self) -> bool:	COMMENT
LOW	lcci/16.25.LRU Cache/Solution.py	61	# Your LRUCache object will be instantiated and called as such:	COMMENT
LOW	lcci/04.03.List of Depth/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.03.List of Depth/Solution.rs	21	// pub struct ListNode {	COMMENT
LOW	lcci/04.03.List of Depth/Solution.py	1	# Definition for a binary tree node.	COMMENT
LOW	lcci/04.03.List of Depth/README.md	61	#### Python3	COMMENT
LOW	lcci/04.03.List of Depth/README.md	281	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.03.List of Depth/README.md	301	// pub struct ListNode {	COMMENT
LOW	lcci/04.03.List of Depth/README_EN.md	301	//	COMMENT
LOW	lcci/03.06.Animal Shelter/Solution.py	21		COMMENT
LOW	lcci/04.10.Check SubTree/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	lcci/04.10.Check SubTree/README_EN.md	261	// #[derive(Debug, PartialEq, Eq)]	COMMENT
LOW	lcci/03.02.Min Stack/Solution.py	21	return self.mins[-1]	COMMENT
LOW	lcci/02.01.Remove Duplicate Node/Solution.rs	1	// Definition for singly-linked list.	COMMENT
LOW	lcci/02.01.Remove Duplicate Node/README_EN.md	221	// pub val: i32,	COMMENT
LOW	solution/3500-3599/3508.Implement Router/Solution.py	41	# obj = Router(memoryLimit)	COMMENT
LOW	solution/0700-0799/0707.Design Linked List/Solution.py	41	# Your MyLinkedList object will be instantiated and called as such:	COMMENT
LOW	…99/0783.Minimum Distance Between BST Nodes/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	…0799/0783.Minimum Distance Between BST Nodes/README.md	241	};	COMMENT
LOW	…9/0783.Minimum Distance Between BST Nodes/README_EN.md	241	// Definition for a binary tree node.	COMMENT
LOW	solution/0700-0799/0716.Max Stack/Solution.py	61		COMMENT
LOW	solution/0700-0799/0715.Range Module/Solution.py	81	# obj.addRange(left,right)	COMMENT
LOW	…00-1799/1797.Design Authentication Manager/Solution.py	21	# obj.renew(tokenId,currentTime)	COMMENT
LOW	…0-1799/1778.Shortest Path in a Hidden Grid/Solution.py	1	# """	COMMENT
LOW	solution/0200-0299/0226.Invert Binary Tree/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	solution/0200-0299/0226.Invert Binary Tree/README.md	221	// }	COMMENT
LOW	solution/0200-0299/0226.Invert Binary Tree/README_EN.md	201	root.right = l;	COMMENT
LOW	…0200-0299/0203.Remove Linked List Elements/Solution.rs	1	// Definition for singly-linked list.	COMMENT
LOW	…200-0299/0203.Remove Linked List Elements/README_EN.md	181	cur = cur.next;	COMMENT
LOW	solution/0200-0299/0206.Reverse Linked List/Solution.rs	1	// Definition for singly-linked list.	COMMENT
LOW	solution/0200-0299/0206.Reverse Linked List/README.md	221	// pub next: Option<Box<ListNode>>	COMMENT
LOW	…lution/0200-0299/0206.Reverse Linked List/Solution2.rs	1	// Definition for singly-linked list.	COMMENT
LOW	…lution/0200-0299/0206.Reverse Linked List/README_EN.md	201	cur.next = pre;	COMMENT
LOW	…lution/0200-0299/0206.Reverse Linked List/README_EN.md	441	}	COMMENT
LOW	solution/0200-0299/0251.Flatten 2D Vector/Solution.py	21		COMMENT
LOW	…36.Lowest Common Ancestor of a Binary Tree/Solution.rs	1	// Definition for a binary tree node.	COMMENT
LOW	…0236.Lowest Common Ancestor of a Binary Tree/README.md	221	return left && right ? root : left \|\| right;	COMMENT
LOW	…6.Lowest Common Ancestor of a Binary Tree/README_EN.md	221	}	COMMENT
LOW	solution/0200-0299/0284.Peeking Iterator/Solution.py	1	# Below is the interface for Iterator, which is already defined for you.	COMMENT
LOW	solution/0200-0299/0284.Peeking Iterator/Solution.py	61	# Your PeekingIterator object will be instantiated and called as such:	COMMENT
LOW	solution/0200-0299/0284.Peeking Iterator/README.md	81	>	COMMENT
LOW	solution/0200-0299/0284.Peeking Iterator/README_EN.md	81	<!-- thinking:end -->	COMMENT
LOW	…n/0200-0299/0271.Encode and Decode Strings/Solution.py	21	# Your Codec object will be instantiated and called as such:	COMMENT
LOW	…n/0200-0299/0244.Shortest Word Distance II/Solution.py	21	# obj = WordDistance(wordsDict)	COMMENT
LOW	…200-0299/0225.Implement Stack using Queues/Solution.py	21		COMMENT
LOW	…97.Serialize and Deserialize Binary Tree/Solution.java	61	// Codec codec = new Codec();	COMMENT
LOW	…0297.Serialize and Deserialize Binary Tree/Solution.cs	61	// Codec codec = new Codec();	COMMENT
LOW	…297.Serialize and Deserialize Binary Tree/Solution.cpp	61		COMMENT
452 more matches not shown…

Deep Nesting489 hits · 489 pts

Severity	File	Line	Context
LOW	run_format.py	226	CODE
LOW	run_format.py	249	CODE
LOW	run_format.py	292	CODE
LOW	run_format.py	355	CODE
LOW	lcs/LCS 03. 主题空间/Solution.py	2	CODE
LOW	lcci/05.04.Closed Number/Solution.py	2	CODE
LOW	lcci/08.14.Boolean Evaluation/Solution.py	2	CODE
LOW	lcci/08.14.Boolean Evaluation/Solution.py	4	CODE
LOW	lcci/17.24.Max Submatrix/Solution.py	2	CODE
LOW	lcci/10.03.Search Rotate Array/Solution.py	2	CODE
LOW	lcci/17.23.Max Black Square/Solution.py	2	CODE
LOW	lcci/16.14.Best Line/Solution.py	2	CODE
LOW	solution/util.py	225	CODE
LOW	solution/util.py	470	CODE
LOW	solution/rating.py	118	CODE
LOW	solution/main.py	393	CODE
LOW	solution/main.py	522	CODE
LOW	solution/main.py	566	CODE
LOW	…4.Split the Array to Make Coprime Products/Solution.py	2	CODE
LOW	…00-2599/2585.Number of Ways to Earn Points/Solution.py	2	CODE
LOW	…ution/2500-2599/2512.Reward Top K Students/Solution.py	2	CODE
LOW	…Distinct Prime Factors of Product of Array/Solution.py	2	CODE
LOW	…on/2500-2599/2573.Find the String with LCP/Solution.py	2	CODE
LOW	…577.Minimum Time to Visit a Cell In a Grid/Solution.py	2	CODE
LOW	…1.Make Number of Distinct Characters Equal/Solution.py	2	CODE
LOW	…nce Between Maximum and Minimum Price Sum/Solution2.py	2	CODE
LOW	…-2599/2547.Minimum Cost to Split an Array/Solution2.py	2	CODE
LOW	…Maximum Number of Points From Grid Queries/Solution.py	2	CODE
LOW	…/3568.Minimum Moves to Clean the Classroom/Solution.py	2	CODE
LOW	… Profit from Trading Stocks with Discounts/Solution.py	2	CODE
LOW	… Profit from Trading Stocks with Discounts/Solution.py	15	CODE
LOW	…/3500-3599/3590.Kth Smallest Path XOR Sum/Solution2.py	52	CODE
LOW	…500-3599/3552.Grid Teleportation Traversal/Solution.py	2	CODE
LOW	…m Absolute Difference in Sliding Submatrix/Solution.py	2	CODE
LOW	…599/3585.Find Weighted Median Node in Tree/Solution.py	2	CODE
LOW	…3500-3599/3574.Maximize Subarray GCD Score/Solution.py	2	CODE
LOW	…3500-3599/3548.Equal Sum Grid Partition II/Solution.py	2	CODE
LOW	…3500-3599/3548.Equal Sum Grid Partition II/Solution.py	3	CODE
LOW	…/3500-3599/3565.Sequential Grid Path Cover/Solution.py	2	CODE
LOW	solution/0700-0799/0723.Candy Crush/Solution.py	2	CODE
LOW	solution/0700-0799/0726.Number of Atoms/Solution.py	2	CODE
LOW	solution/0700-0799/0773.Sliding Puzzle/Solution.py	2	CODE
LOW	solution/0700-0799/0773.Sliding Puzzle/Solution2.py	2	CODE
LOW	solution/0700-0799/0735.Asteroid Collision/Solution.py	2	CODE
LOW	solution/0700-0799/0752.Open the Lock/Solution.py	2	CODE
LOW	…0.Count Different Palindromic Subsequences/Solution.py	2	CODE
LOW	…0700-0799/0750.Number Of Corner Rectangles/Solution.py	2	CODE
LOW	solution/0700-0799/0755.Pour Water/Solution.py	2	CODE
LOW	…00-0799/0742.Closest Leaf in a Binary Tree/Solution.py	8	CODE
LOW	solution/0700-0799/0741.Cherry Pickup/Solution.py	2	CODE
LOW	solution/0700-0799/0749.Contain Virus/Solution.py	2	CODE
LOW	solution/0700-0799/0749.Contain Virus/Solution.py	3	CODE
LOW	solution/0700-0799/0722.Remove Comments/Solution.py	2	CODE
LOW	…1799/1796.Second Largest Digit in a String/Solution.py	2	CODE
LOW	solution/1700-1799/1776.Car Fleet II/Solution.py	2	CODE
LOW	…lution/1700-1799/1774.Closest Dessert Cost/Solution.py	2	CODE
LOW	solution/1700-1799/1728.Cat and Mouse II/Solution.py	2	CODE
LOW	solution/1700-1799/1728.Cat and Mouse II/Solution.py	33	CODE
LOW	…799/1793.Maximum Score of a Good Subarray/Solution2.py	2	CODE
LOW	…f Equal Substrings With Minimum Difference/Solution.py	2	CODE
429 more matches not shown…

Hyper-Verbose Identifiers431 hits · 431 pts

Severity	File	Line	Snippet	Context
LOW	solution/util.py	470	def generate_category_summary(result, category=""):	CODE
LOW	…500-3599/3586.Find COVID Recovery Patients/Solution.py	4	def find_covid_recovery_patients(	CODE
LOW	…/3500-3599/3586.Find COVID Recovery Patients/README.md	216	def find_covid_recovery_patients(	CODE
LOW	…00-3599/3586.Find COVID Recovery Patients/README_EN.md	215	def find_covid_recovery_patients(	CODE
LOW	…99/3554.Find Category Recommendation Pairs/Solution.py	4	def find_category_recommendation_pairs(	CODE
LOW	…3599/3554.Find Category Recommendation Pairs/README.md	226	def find_category_recommendation_pairs(	CODE
LOW	…9/3554.Find Category Recommendation Pairs/README_EN.md	225	def find_category_recommendation_pairs(	CODE
LOW	…3580.Find Consistently Improving Employees/Solution.py	4	def find_consistently_improving_employees(	CODE
LOW	…9/3580.Find Consistently Improving Employees/README.md	219	def find_consistently_improving_employees(	CODE
LOW	…580.Find Consistently Improving Employees/README_EN.md	218	def find_consistently_improving_employees(	CODE
LOW	…9/3570.Find Books with No Available Copies/Solution.py	4	def find_books_with_no_available_copies(	CODE
LOW	…599/3570.Find Books with No Available Copies/README.md	200	def find_books_with_no_available_copies(	CODE
LOW	…/3570.Find Books with No Available Copies/README_EN.md	199	def find_books_with_no_available_copies(	CODE
LOW	…/0700-0799/0713.Subarray Product Less Than K/README.md	157	function numSubarrayProductLessThanK(nums: number[], k: number): number {	CODE
LOW	…00-0799/0713.Subarray Product Less Than K/README_EN.md	157	function numSubarrayProductLessThanK(nums: number[], k: number): number {	CODE
LOW	…700-0799/0713.Subarray Product Less Than K/Solution.ts	1	function numSubarrayProductLessThanK(nums: number[], k: number): number {	CODE
LOW	solution/0200-0299/0293.Flip Game/README.md	147	function generatePossibleNextMoves(currentState: string): string[] {	CODE
LOW	solution/0200-0299/0293.Flip Game/README_EN.md	145	function generatePossibleNextMoves(currentState: string): string[] {	CODE
LOW	solution/0200-0299/0293.Flip Game/Solution.ts	1	function generatePossibleNextMoves(currentState: string): string[] {	CODE
LOW	…lution/0200-0299/0220.Contains Duplicate III/README.md	179	function containsNearbyAlmostDuplicate(	CODE
LOW	…ion/0200-0299/0220.Contains Duplicate III/README_EN.md	177	function containsNearbyAlmostDuplicate(	CODE
LOW	…tion/0200-0299/0220.Contains Duplicate III/Solution.ts	1	function containsNearbyAlmostDuplicate(	CODE
LOW	…1999/1987.Number of Unique Good Subsequences/README.md	189	function numberOfUniqueGoodSubsequences(binary: string): number {	CODE
LOW	…9/1987.Number of Unique Good Subsequences/README_EN.md	190	function numberOfUniqueGoodSubsequences(binary: string): number {	CODE
LOW	…99/1987.Number of Unique Good Subsequences/Solution.ts	1	function numberOfUniqueGoodSubsequences(binary: string): number {	CODE
LOW	…ngest Valid Obstacle Course at Each Position/README.md	317	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {	CODE
LOW	…st Valid Obstacle Course at Each Position/README_EN.md	315	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {	CODE
LOW	…est Valid Obstacle Course at Each Position/Solution.ts	27	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {	CODE
LOW	…930.Unique Length-3 Palindromic Subsequences/README.md	185	function countPalindromicSubsequence(s: string): number {	CODE
LOW	….Unique Length-3 Palindromic Subsequences/README_EN.md	183	function countPalindromicSubsequence(s: string): number {	CODE
LOW	…0.Unique Length-3 Palindromic Subsequences/Solution.ts	1	function countPalindromicSubsequence(s: string): number {	CODE
LOW	…/1900-1999/1980.Find Unique Binary String/Solution2.ts	1	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…ion/1900-1999/1980.Find Unique Binary String/README.md	166	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…ion/1900-1999/1980.Find Unique Binary String/README.md	303	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…/1900-1999/1980.Find Unique Binary String/README_EN.md	165	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…/1900-1999/1980.Find Unique Binary String/README_EN.md	302	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…n/1900-1999/1980.Find Unique Binary String/Solution.ts	1	function findDifferentBinaryString(nums: string[]): string {	CODE
LOW	…alue of Variable After Performing Operations/README.md	160	function finalValueAfterOperations(operations: string[]): number {	CODE
LOW	…e of Variable After Performing Operations/README_EN.md	158	function finalValueAfterOperations(operations: string[]): number {	CODE
LOW	…ue of Variable After Performing Operations/Solution.ts	1	function finalValueAfterOperations(operations: string[]): number {	CODE
LOW	…imum Number of Nodes Between Critical Points/README.md	260	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {	CODE
LOW	…m Number of Nodes Between Critical Points/README_EN.md	242	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {	CODE
LOW	…um Number of Nodes Between Critical Points/Solution.ts	13	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {	CODE
LOW	…31.Count Subarrays With More Ones Than Zeros/README.md	304	function subarraysWithMoreZerosThanOnes(nums: number[]): number {	CODE
LOW	…Count Subarrays With More Ones Than Zeros/README_EN.md	305	function subarraysWithMoreZerosThanOnes(nums: number[]): number {	CODE
LOW	….Count Subarrays With More Ones Than Zeros/Solution.ts	25	function subarraysWithMoreZerosThanOnes(nums: number[]): number {	CODE
LOW	…est Missing Genetic Value in Each Subtree/Solution2.ts	1	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…allest Missing Genetic Value in Each Subtree/README.md	311	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…allest Missing Genetic Value in Each Subtree/README.md	644	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…est Missing Genetic Value in Each Subtree/README_EN.md	308	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…est Missing Genetic Value in Each Subtree/README_EN.md	641	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…lest Missing Genetic Value in Each Subtree/Solution.ts	1	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {	CODE
LOW	…0-2099/2036.Maximum Alternating Subarray Sum/README.md	159	function maximumAlternatingSubarraySum(nums: number[]): number {	CODE
LOW	…099/2036.Maximum Alternating Subarray Sum/README_EN.md	161	function maximumAlternatingSubarraySum(nums: number[]): number {	CODE
LOW	…2099/2036.Maximum Alternating Subarray Sum/Solution.ts	1	function maximumAlternatingSubarraySum(nums: number[]): number {	CODE
LOW	…99/2014.Longest Subsequence Repeated k Times/README.md	294	function longestSubsequenceRepeatedK(s: string, k: number): string {	CODE
LOW	…2014.Longest Subsequence Repeated k Times/README_EN.md	290	function longestSubsequenceRepeatedK(s: string, k: number): string {	CODE
LOW	…/2014.Longest Subsequence Repeated k Times/Solution.ts	1	function longestSubsequenceRepeatedK(s: string, k: number): string {	CODE
LOW	…00-3099/3061.Calculate Trapping Rain Water/Solution.py	4	def calculate_trapped_rain_water(heights: pd.DataFrame) -> pd.DataFrame:	CODE
LOW	…3000-3099/3061.Calculate Trapping Rain Water/README.md	118	def calculate_trapped_rain_water(heights: pd.DataFrame) -> pd.DataFrame:	CODE
371 more matches not shown…

Cross-Language Confusion19 hits · 132 pts

Severity	File	Line	Snippet	Context
HIGH	lcci/03.04.Implement Queue using Stacks/Solution.py	28	# obj.push(x)	COMMENT
HIGH	lcci/03.05.Sort of Stacks/Solution.py	27	# obj.push(val)	COMMENT
HIGH	lcci/03.03.Stack of Plates/Solution.py	27	# obj.push(val)	COMMENT
HIGH	lcci/03.01.Three in One/Solution.py	29	# obj.push(stackNum,value)	COMMENT
HIGH	lcci/03.02.Min Stack/Solution.py	26	# obj.push(val)	COMMENT
HIGH	solution/0700-0799/0716.Max Stack/Solution.py	64	# obj.push(x)	COMMENT
HIGH	…200-0299/0232.Implement Queue using Stacks/Solution.py	28	# obj.push(x)	COMMENT
HIGH	…200-0299/0225.Implement Stack using Queues/Solution.py	24	# obj.push(x)	COMMENT
HIGH	solution/2100-2199/2166.Design Bitset/Solution.py	44	# param_7 = obj.toString()	COMMENT
HIGH	…ion/0800-0899/0895.Maximum Frequency Stack/Solution.py	20	# obj.push(val)	COMMENT
HIGH	…on/0800-0899/0895.Maximum Frequency Stack/Solution2.py	22	# obj.push(val)	COMMENT
HIGH	…81.Design a Stack With Increment Operation/Solution.py	30	# obj.push(x)	COMMENT
HIGH	…tion/1000-1099/1095.Find in Mountain Array/Solution.py	21	n = mountain_arr.length()	CODE
HIGH	…9/1533.Find the Index of the Large Integer/Solution.py	19	left, right = 0, reader.length() - 1	CODE
HIGH	…/1538.Guess the Majority in a Hidden Array/Solution.py	19	n = reader.length()	CODE
HIGH	solution/0100-0199/0155.Min Stack/Solution.py	23	# obj.push(val)	COMMENT
HIGH	solution/1100-1199/1172.Dinner Plate Stacks/Solution.py	36	# obj.push(val)	COMMENT
HIGH	lcp/main.py	13	{"data":{"problemsetQuestionList":{"__typename":"QuestionListNode","questions":[{"__typename":"QuestionLightNode","acRat	CODE
HIGH	lcof/面试题30. 包含min函数的栈/Solution.py	23	# obj.push(x)	COMMENT

Structural Annotation Overuse21 hits · 44 pts

Severity	File	Line	Snippet	Context
LOW	… Minimum Sums of at Most Size K Subarrays/README_EN.md	189	#### Step 1: Boundary Control	COMMENT
LOW	… Minimum Sums of at Most Size K Subarrays/README_EN.md	197	#### Step 2: Monotonicity	COMMENT
LOW	… Minimum Sums of at Most Size K Subarrays/README_EN.md	210	#### Step 3: Accumulation	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	7	# Step 1: Identify stores with at least 3 products	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	11	# Step 2: Find most expensive product for each valid store	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	21	# Step 3: Find cheapest product for each store	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	32	# Step 4: Merge the two datasets on store_id	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	37	# Step 5: Filter for cases where cheapest product has higher quantity than most expensive	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	40	# Step 6: Calculate imbalance ratio (cheapest quantity / most expensive quantity)	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	45	# Step 7: Merge with store information to get store names and locations	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	48	# Step 8: Select and rename columns for final output	COMMENT
LOW	…/3626.Find Stores with Inventory Imbalance/Solution.py	65	# Step 9: Sort by imbalance ratio (descending) then store name (ascending)	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	248	# Step 1: Identify stores with at least 3 products	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	252	# Step 2: Find most expensive product for each valid store	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	262	# Step 3: Find cheapest product for each store	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	273	# Step 4: Merge the two datasets on store_id	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	278	# Step 5: Filter for cases where cheapest product has higher quantity than most expensive	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	281	# Step 6: Calculate imbalance ratio (cheapest quantity / most expensive quantity)	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	286	# Step 7: Merge with store information to get store names and locations	COMMENT
LOW⚡	…3626.Find Stores with Inventory Imbalance/README_EN.md	289	# Step 8: Select and rename columns for final output	COMMENT
LOW	…3626.Find Stores with Inventory Imbalance/README_EN.md	306	# Step 9: Sort by imbalance ratio (descending) then store name (ascending)	COMMENT

Verbosity Indicators9 hits · 20 pts

Severity	File	Line	Snippet	Context
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	7	# Step 1: Identify stores with at least 3 products	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	11	# Step 2: Find most expensive product for each valid store	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	21	# Step 3: Find cheapest product for each store	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	32	# Step 4: Merge the two datasets on store_id	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	37	# Step 5: Filter for cases where cheapest product has higher quantity than most expensive	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	40	# Step 6: Calculate imbalance ratio (cheapest quantity / most expensive quantity)	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	45	# Step 7: Merge with store information to get store names and locations	COMMENT
LOW⚡	…/3626.Find Stores with Inventory Imbalance/Solution.py	48	# Step 8: Select and rename columns for final output	COMMENT
LOW	…/3626.Find Stores with Inventory Imbalance/Solution.py	65	# Step 9: Sort by imbalance ratio (descending) then store name (ascending)	COMMENT

AI Structural Patterns15 hits · 15 pts

Severity	File	Line	Context
LOW	…99/3554.Find Category Recommendation Pairs/Solution.py	28	CODE
LOW	…-3499/3497.Analyze Subscription Conversion/Solution.py	31	CODE
LOW	…n/3400-3499/3451.Find Invalid IP Addresses/Solution.py	24	CODE
LOW	solution/3100-3199/3124.Find Longest Calls/Solution.py	22	CODE
LOW	…ion/3200-3299/3262.Find Overlapping Shifts/Solution.py	19	CODE
LOW	…n/3200-3299/3220.Odd and Even Transactions/Solution.py	20	CODE
LOW	…70.Managers with at Least 5 Direct Reports/Solution.py	21	CODE
LOW	…1565.Unique Orders and Customers Per Month/Solution.py	16	CODE
LOW	…n/3700-3799/3716.Find Churn Risk Customers/Solution.py	57	CODE
LOW	…on/3700-3799/3764.Most Common Course Pairs/Solution.py	29	CODE
LOW	…300-3399/3328.Find Cities in Each State II/Solution.py	25	CODE
LOW	…0-3399/3384.Team Dominance by Pass Success/Solution.py	27	CODE
LOW	…899/3808.Find Emotionally Consistent Users/Solution.py	40	CODE
LOW	…lution/3600-3699/3657.Find Loyal Customers/Solution.py	26	CODE
LOW	…/3626.Find Stores with Inventory Imbalance/Solution.py	70	CODE

Self-Referential Comments4 hits · 12 pts

Severity	File	Line	Snippet	Context
MEDIUM	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	26	# Create a variable 'sign' to check whether we have to add it or subtract it.	COMMENT
MEDIUM	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	92	# Create a HashMap for the letter to digit mapping.	COMMENT
MEDIUM	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	95	# Create a list for the digit to letter mapping.	COMMENT
MEDIUM	…ution/0100-0199/0176.Second Highest Salary/Solution.py	17	# Create a DataFrame with the second highest salary	COMMENT

Excessive Try-Catch Wrapping9 hits · 9 pts

Severity	File	Line	Snippet	Context
LOW	solution/util.py	60	except Exception as e:	CODE
LOW	solution/util.py	562	except Exception as e:	CODE
LOW	solution/util.py	568	except Exception as e:	CODE
LOW	solution/rating.py	194	except Exception as e:	CODE
LOW	solution/main.py	57	except Exception as e:	CODE
LOW	solution/main.py	112	except Exception as e:	CODE
LOW	solution/main.py	167	except Exception as e:	CODE
LOW	solution/main.py	239	except Exception as e:	CODE
LOW	solution/main.py	359	except Exception as e:	CODE

Unused Imports6 hits · 6 pts

Severity	File	Line	Context
LOW	solution/rating.py	15	CODE
LOW	solution/main.py	13	CODE
LOW	… an Expression Tree With Evaluate Function/Solution.py	1	CODE
LOW	…/3700-3799/3705.Find Golden Hour Customers/Solution.py	2	CODE
LOW	scripts/preview.py	15	CODE
LOW	scripts/check_thinking.py	4	CODE

Decorative Section Separators2 hits · 6 pts

Severity	File	Line	Snippet	Context
MEDIUM	.github/workflows/prettier-write.yml	24	# ---------------------------------------------------------	COMMENT
MEDIUM	.github/workflows/prettier-write.yml	28	# ---------------------------------------------------------	COMMENT

Empty Error Handlers1 hit · 5 pts

Severity	File	Line	Snippet	Context
HIGH	solution/main.py	558	except OSError:	CODE

AI Slop Vocabulary1 hit · 2 pts

Severity	File	Line	Snippet	Context
LOW	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	79	# If nothing is correct then just return false.	COMMENT

doocs/leetcode

Open-Source Code Quality, Security and Technical Debt Review