doocs/leetcode

Pattern Findings

1724 matches across 11 categories. Click a row to expand file-level details.

Cross-File Repetition360 hits · 1800 pts

Severity	File	Line	Snippet
HIGH	…2.Search in a Sorted Array of Unknown Size/Solution.py	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…702.Search in a Sorted Array of Unknown Size/README.md	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
HIGH	….Search in a Sorted Array of Unknown Size/README_EN.md	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…9/1533.Find the Index of the Large Integer/Solution.py	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…599/1533.Find the Index of the Large Integer/README.md	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…/1533.Find the Index of the Large Integer/README_EN.md	0	# this is arrayreader's api interface. # you should not implement it, or speculate about its implementation #
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
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
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
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
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
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
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
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
HIGH	…0-1799/1778.Shortest Path in a Hidden Grid/Solution.py	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…700-1799/1778.Shortest Path in a Hidden Grid/README.md	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…-1799/1778.Shortest Path in a Hidden Grid/README_EN.md	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…99/1810.Minimum Path Cost in a Hidden Grid/Solution.py	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…1899/1810.Minimum Path Cost in a Hidden Grid/README.md	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	…9/1810.Minimum Path Cost in a Hidden Grid/README_EN.md	0	# this is gridmaster's api interface. # you should not implement it, or speculate about its implementation #
HIGH	solution/0200-0299/0286.Walls and Gates/Solution.py	0	do not return anything, modify rooms in-place instead.
HIGH	solution/0200-0299/0286.Walls and Gates/README.md	0	do not return anything, modify rooms in-place instead.
HIGH	solution/0200-0299/0286.Walls and Gates/README_EN.md	0	do not return anything, modify rooms in-place instead.
HIGH	solution/0200-0299/0280.Wiggle Sort/Solution.py	0	do not return anything, modify nums in-place instead.
HIGH	solution/0200-0299/0280.Wiggle Sort/README.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0200-0299/0280.Wiggle Sort/README_EN.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/Solution.py	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/README.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/README.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/README_EN.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/README_EN.md	0	do not return anything, modify nums in-place instead.
HIGH	solution/0300-0399/0324.Wiggle Sort II/Solution2.py	0	do not return anything, modify nums in-place instead.
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# initializes an iterator object to the beginning of a list. # :type nums: list[int] #
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# initializes an iterator object to the beginning of a list. # :type nums: list[int] #
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] #
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# returns true if the iteration has more elements. # :rtype: bool #
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# returns true if the iteration has more elements. # :rtype: bool #
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	# returns true if the iteration has more elements. # :rtype: bool #
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	# returns the next element in the iteration. # :rtype: int #
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	# returns the next element in the iteration. # :rtype: int #
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	# returns the next element in the iteration. # :rtype: int #
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	initialize your data structure here. :type iterator: iterator
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	initialize your data structure here. :type iterator: iterator
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	initialize your data structure here. :type iterator: iterator
HIGH	solution/0200-0299/0284.Peeking Iterator/Solution.py	0	returns the next element in the iteration without advancing the iterator. :rtype: int
HIGH	solution/0200-0299/0284.Peeking Iterator/README.md	0	returns the next element in the iteration without advancing the iterator. :rtype: int
HIGH	solution/0200-0299/0284.Peeking Iterator/README_EN.md	0	returns the next element in the iteration without advancing the iterator. :rtype: int
HIGH	…200-0299/0237.Delete Node in a Linked List/Solution.py	0	:type node: listnode :rtype: void do not return anything, modify node in-place instead.
HIGH	…/0200-0299/0237.Delete Node in a Linked List/README.md	0	:type node: listnode :rtype: void do not return anything, modify node in-place instead.
HIGH	…00-0299/0237.Delete Node in a Linked List/README_EN.md	0	:type node: listnode :rtype: void do not return anything, modify node in-place instead.
HIGH	…0297.Serialize and Deserialize Binary Tree/Solution.py	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	…9/0297.Serialize and Deserialize Binary Tree/README.md	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	…297.Serialize and Deserialize Binary Tree/README_EN.md	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	lcof/面试题37. 序列化二叉树/Solution.py	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	lcof/面试题37. 序列化二叉树/README.md	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	lcof2/剑指 Offer II 048. 序列化与反序列化二叉树/Solution.py	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	lcof2/剑指 Offer II 048. 序列化与反序列化二叉树/README.md	0	encodes a tree to a single string. :type root: treenode :rtype: str
HIGH	…0297.Serialize and Deserialize Binary Tree/Solution.py	0	decodes your encoded data to tree. :type data: str :rtype: treenode
HIGH	…9/0297.Serialize and Deserialize Binary Tree/README.md	0	decodes your encoded data to tree. :type data: str :rtype: treenode
HIGH	…297.Serialize and Deserialize Binary Tree/README_EN.md	0	decodes your encoded data to tree. :type data: str :rtype: treenode
300 more matches not shown…

Over-Commented Block497 hits · 497 pts

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

Deep Nesting416 hits · 416 pts

Severity	File	Line
LOW	run_format.py	225
LOW	run_format.py	277
LOW	lcs/LCS 03. 主题空间/Solution.py	2
LOW	lcci/05.04.Closed Number/Solution.py	2
LOW	lcci/08.14.Boolean Evaluation/Solution.py	2
LOW	lcci/08.14.Boolean Evaluation/Solution.py	4
LOW	lcci/17.24.Max Submatrix/Solution.py	2
LOW	lcci/10.03.Search Rotate Array/Solution.py	2
LOW	lcci/17.23.Max Black Square/Solution.py	2
LOW	solution/util.py	271
LOW	solution/main.py	394
LOW	…4.Split the Array to Make Coprime Products/Solution.py	2
LOW	…00-2599/2585.Number of Ways to Earn Points/Solution.py	2
LOW	…ution/2500-2599/2512.Reward Top K Students/Solution.py	2
LOW	…Distinct Prime Factors of Product of Array/Solution.py	2
LOW	…on/2500-2599/2573.Find the String with LCP/Solution.py	2
LOW	…577.Minimum Time to Visit a Cell In a Grid/Solution.py	2
LOW	…1.Make Number of Distinct Characters Equal/Solution.py	2
LOW	…Maximum Number of Points From Grid Queries/Solution.py	2
LOW	…/3568.Minimum Moves to Clean the Classroom/Solution.py	2
LOW	… Profit from Trading Stocks with Discounts/Solution.py	2
LOW	… Profit from Trading Stocks with Discounts/Solution.py	15
LOW	…500-3599/3552.Grid Teleportation Traversal/Solution.py	2
LOW	…m Absolute Difference in Sliding Submatrix/Solution.py	2
LOW	…3500-3599/3574.Maximize Subarray GCD Score/Solution.py	2
LOW	…3500-3599/3548.Equal Sum Grid Partition II/Solution.py	2
LOW	…3500-3599/3548.Equal Sum Grid Partition II/Solution.py	3
LOW	…/3500-3599/3565.Sequential Grid Path Cover/Solution.py	2
LOW	solution/0700-0799/0723.Candy Crush/Solution.py	2
LOW	solution/0700-0799/0773.Sliding Puzzle/Solution.py	2
LOW	solution/0700-0799/0773.Sliding Puzzle/Solution2.py	2
LOW	solution/0700-0799/0735.Asteroid Collision/Solution.py	2
LOW	solution/0700-0799/0752.Open the Lock/Solution.py	2
LOW	…0.Count Different Palindromic Subsequences/Solution.py	2
LOW	…0700-0799/0750.Number Of Corner Rectangles/Solution.py	2
LOW	solution/0700-0799/0755.Pour Water/Solution.py	2
LOW	…00-0799/0742.Closest Leaf in a Binary Tree/Solution.py	8
LOW	solution/0700-0799/0741.Cherry Pickup/Solution.py	2
LOW	solution/0700-0799/0749.Contain Virus/Solution.py	2
LOW	solution/0700-0799/0749.Contain Virus/Solution.py	3
LOW	solution/0700-0799/0722.Remove Comments/Solution.py	2
LOW	…1799/1796.Second Largest Digit in a String/Solution.py	2
LOW	solution/1700-1799/1776.Car Fleet II/Solution.py	2
LOW	…lution/1700-1799/1774.Closest Dessert Cost/Solution.py	2
LOW	solution/1700-1799/1728.Cat and Mouse II/Solution.py	2
LOW	solution/1700-1799/1728.Cat and Mouse II/Solution.py	33
LOW	…799/1793.Maximum Score of a Good Subarray/Solution2.py	2
LOW	…f Equal Substrings With Minimum Difference/Solution.py	2
LOW	…0-1799/1778.Shortest Path in a Hidden Grid/Solution.py	18
LOW	…/1719.Number Of Ways To Reconstruct A Tree/Solution.py	2
LOW	…717.Maximum Score From Removing Substrings/Solution.py	2
LOW	…n/1700-1799/1730.Shortest Path to Get Food/Solution.py	2
LOW	…imum Degree of a Connected Trio in a Graph/Solution.py	6
LOW	…799/1799.Maximize Score After N Operations/Solution.py	2
LOW	…lution/1700-1799/1765.Map of Highest Peak/Solution2.py	2
LOW	…ximize Palindrome Length From Subsequences/Solution.py	2
LOW	solution/0200-0299/0269.Alien Dictionary/Solution.py	2
LOW	…/0200-0299/0245.Shortest Word Distance III/Solution.py	2
LOW	solution/0200-0299/0286.Walls and Gates/Solution.py	2
LOW	…299/0241.Different Ways to Add Parentheses/Solution.py	2
356 more matches not shown…

Hyper-Verbose Identifiers400 hits · 400 pts

Severity	File	Line	Snippet
LOW	run_format.py	359	def format_rust_files_windows():
LOW	solution/util.py	271	def generate_category_summary(result, category=""):
LOW	solution/main.py	446	def format_rust_files_windows():
LOW	…500-3599/3586.Find COVID Recovery Patients/Solution.py	4	def find_covid_recovery_patients(
LOW	…/3500-3599/3586.Find COVID Recovery Patients/README.md	207	def find_covid_recovery_patients(
LOW	…00-3599/3586.Find COVID Recovery Patients/README_EN.md	206	def find_covid_recovery_patients(
LOW	…99/3554.Find Category Recommendation Pairs/Solution.py	4	def find_category_recommendation_pairs(
LOW	…3599/3554.Find Category Recommendation Pairs/README.md	217	def find_category_recommendation_pairs(
LOW	…9/3554.Find Category Recommendation Pairs/README_EN.md	216	def find_category_recommendation_pairs(
LOW	…3580.Find Consistently Improving Employees/Solution.py	4	def find_consistently_improving_employees(
LOW	…9/3580.Find Consistently Improving Employees/README.md	210	def find_consistently_improving_employees(
LOW	…580.Find Consistently Improving Employees/README_EN.md	209	def find_consistently_improving_employees(
LOW	…9/3570.Find Books with No Available Copies/Solution.py	4	def find_books_with_no_available_copies(
LOW	…599/3570.Find Books with No Available Copies/README.md	191	def find_books_with_no_available_copies(
LOW	…/3570.Find Books with No Available Copies/README_EN.md	190	def find_books_with_no_available_copies(
LOW	…/0700-0799/0713.Subarray Product Less Than K/README.md	144	function numSubarrayProductLessThanK(nums: number[], k: number): number {
LOW	…00-0799/0713.Subarray Product Less Than K/README_EN.md	144	function numSubarrayProductLessThanK(nums: number[], k: number): number {
LOW	…700-0799/0713.Subarray Product Less Than K/Solution.ts	1	function numSubarrayProductLessThanK(nums: number[], k: number): number {
LOW	solution/0200-0299/0293.Flip Game/README.md	140	function generatePossibleNextMoves(currentState: string): string[] {
LOW	solution/0200-0299/0293.Flip Game/README_EN.md	138	function generatePossibleNextMoves(currentState: string): string[] {
LOW	solution/0200-0299/0293.Flip Game/Solution.ts	1	function generatePossibleNextMoves(currentState: string): string[] {
LOW	…lution/0200-0299/0220.Contains Duplicate III/README.md	170	function containsNearbyAlmostDuplicate(
LOW	…ion/0200-0299/0220.Contains Duplicate III/README_EN.md	168	function containsNearbyAlmostDuplicate(
LOW	…tion/0200-0299/0220.Contains Duplicate III/Solution.ts	1	function containsNearbyAlmostDuplicate(
LOW	…1999/1987.Number of Unique Good Subsequences/README.md	178	function numberOfUniqueGoodSubsequences(binary: string): number {
LOW	…9/1987.Number of Unique Good Subsequences/README_EN.md	179	function numberOfUniqueGoodSubsequences(binary: string): number {
LOW	…99/1987.Number of Unique Good Subsequences/Solution.ts	1	function numberOfUniqueGoodSubsequences(binary: string): number {
LOW	…ngest Valid Obstacle Course at Each Position/README.md	305	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {
LOW	…st Valid Obstacle Course at Each Position/README_EN.md	303	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {
LOW	…est Valid Obstacle Course at Each Position/Solution.ts	27	function longestObstacleCourseAtEachPosition(obstacles: number[]): number[] {
LOW	…930.Unique Length-3 Palindromic Subsequences/README.md	174	function countPalindromicSubsequence(s: string): number {
LOW	….Unique Length-3 Palindromic Subsequences/README_EN.md	172	function countPalindromicSubsequence(s: string): number {
LOW	…0.Unique Length-3 Palindromic Subsequences/Solution.ts	1	function countPalindromicSubsequence(s: string): number {
LOW	…/1900-1999/1980.Find Unique Binary String/Solution2.ts	1	function findDifferentBinaryString(nums: string[]): string {
LOW	…ion/1900-1999/1980.Find Unique Binary String/README.md	157	function findDifferentBinaryString(nums: string[]): string {
LOW	…ion/1900-1999/1980.Find Unique Binary String/README.md	286	function findDifferentBinaryString(nums: string[]): string {
LOW	…/1900-1999/1980.Find Unique Binary String/README_EN.md	156	function findDifferentBinaryString(nums: string[]): string {
LOW	…/1900-1999/1980.Find Unique Binary String/README_EN.md	285	function findDifferentBinaryString(nums: string[]): string {
LOW	…n/1900-1999/1980.Find Unique Binary String/Solution.ts	1	function findDifferentBinaryString(nums: string[]): string {
LOW	…alue of Variable After Performing Operations/README.md	151	function finalValueAfterOperations(operations: string[]): number {
LOW	…e of Variable After Performing Operations/README_EN.md	149	function finalValueAfterOperations(operations: string[]): number {
LOW	…ue of Variable After Performing Operations/Solution.ts	1	function finalValueAfterOperations(operations: string[]): number {
LOW	…imum Number of Nodes Between Critical Points/README.md	251	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {
LOW	…m Number of Nodes Between Critical Points/README_EN.md	233	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {
LOW	…um Number of Nodes Between Critical Points/Solution.ts	13	function nodesBetweenCriticalPoints(head: ListNode \| null): number[] {
LOW	…31.Count Subarrays With More Ones Than Zeros/README.md	295	function subarraysWithMoreZerosThanOnes(nums: number[]): number {
LOW	…Count Subarrays With More Ones Than Zeros/README_EN.md	296	function subarraysWithMoreZerosThanOnes(nums: number[]): number {
LOW	….Count Subarrays With More Ones Than Zeros/Solution.ts	25	function subarraysWithMoreZerosThanOnes(nums: number[]): number {
LOW	…allest Missing Genetic Value in Each Subtree/README.md	300	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {
LOW	…est Missing Genetic Value in Each Subtree/README_EN.md	297	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {
LOW	…lest Missing Genetic Value in Each Subtree/Solution.ts	1	function smallestMissingValueSubtree(parents: number[], nums: number[]): number[] {
LOW	…0-2099/2036.Maximum Alternating Subarray Sum/README.md	148	function maximumAlternatingSubarraySum(nums: number[]): number {
LOW	…099/2036.Maximum Alternating Subarray Sum/README_EN.md	150	function maximumAlternatingSubarraySum(nums: number[]): number {
LOW	…2099/2036.Maximum Alternating Subarray Sum/Solution.ts	1	function maximumAlternatingSubarraySum(nums: number[]): number {
LOW	…99/2014.Longest Subsequence Repeated k Times/README.md	283	function longestSubsequenceRepeatedK(s: string, k: number): string {
LOW	…2014.Longest Subsequence Repeated k Times/README_EN.md	279	function longestSubsequenceRepeatedK(s: string, k: number): string {
LOW	…/2014.Longest Subsequence Repeated k Times/Solution.ts	1	function longestSubsequenceRepeatedK(s: string, k: number): string {
LOW	…00-3099/3061.Calculate Trapping Rain Water/Solution.py	4	def calculate_trapped_rain_water(heights: pd.DataFrame) -> pd.DataFrame:
LOW	…3000-3099/3061.Calculate Trapping Rain Water/README.md	107	def calculate_trapped_rain_water(heights: pd.DataFrame) -> pd.DataFrame:
LOW	…0-3099/3061.Calculate Trapping Rain Water/README_EN.md	106	def calculate_trapped_rain_water(heights: pd.DataFrame) -> pd.DataFrame:
340 more matches not shown…

Cross-Language Confusion19 hits · 132 pts

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

Verbosity Indicators9 hits · 20 pts

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

Excessive Try-Catch Wrapping12 hits · 16 pts

Severity	File	Line	Snippet
MEDIUM	run_format.py	355	print("Error formatting Rust files on Linux:")
MEDIUM	run_format.py	380	print("Error formatting Rust files on Windows:")
LOW	solution/util.py	34	except Exception as e:
LOW	solution/util.py	363	except Exception as e:
LOW	solution/util.py	369	except Exception as e:
LOW	solution/main.py	53	except Exception as e:
LOW	solution/main.py	108	except Exception as e:
LOW	solution/main.py	163	except Exception as e:
LOW	solution/main.py	235	except Exception as e:
LOW	solution/main.py	360	except Exception as e:
MEDIUM	solution/main.py	442	print("Error formatting Rust files on Linux:")
MEDIUM	solution/main.py	467	print("Error formatting Rust files on Windows:")

Self-Referential Comments4 hits · 12 pts

Severity	File	Line	Snippet
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.
MEDIUM	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	92	# Create a HashMap for the letter to digit mapping.
MEDIUM	…on/1300-1399/1307.Verbal Arithmetic Puzzle/Solution.py	95	# Create a list for the digit to letter mapping.
MEDIUM	…ution/0100-0199/0176.Second Highest Salary/Solution.py	17	# Create a DataFrame with the second highest salary

Decorative Section Separators2 hits · 6 pts

Severity	File	Line	Snippet
MEDIUM	.github/workflows/prettier.yml	13	# ---------------------------------------------------------
MEDIUM	.github/workflows/prettier.yml	17	# ---------------------------------------------------------

Unused Imports4 hits · 4 pts

Severity	File	Line
LOW	solution/main.py	9
LOW	… an Expression Tree With Evaluate Function/Solution.py	1
LOW	…/3700-3799/3705.Find Golden Hour Customers/Solution.py	2
LOW	…17.Find Students with Study Spiral Pattern/Solution.py	2

AI Slop Vocabulary1 hit · 2 pts

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

Score History

Severity Breakdown

Pattern Findings