1.5

Adjusted Signal

1.5

Raw Pattern Score

100%

Time Factor

2026-10-31

Last Push

5.3K

Stars

C++

Language

197.8K

Lines of Code

1.6K

Files

153

Pattern Hits

2026-10-31

Scan Date

0.00

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 7.3/100 · LOW

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

Hallucinated Dependency & Supply Chain Risk 0.0/100 · LOW

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

Agent Over-Engineering Ratio 0.0/100 · LOW

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

PR Review Velocity Impact 4.1/100 · LOW

Which changes need focused human review? 153 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 0MEDIUM 7LOW 146

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 153 distinct pattern matches across 5 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.

Verbosity Indicators68 hits · 134 pts

Severity	File	Line	Snippet	Context
LOW	Bit_Magic/Maximum XOR for Each Query.cpp	52	// Step 1: Calculate the total XOR of all elements in nums	COMMENT
LOW⚡	strings/Word Subsets.cpp	68	// Step 1: Calculate the maximum frequency requirement for words2	COMMENT
LOW⚡	strings/Word Subsets.cpp	78	// Step 2: Check each word in words1	COMMENT
LOW	strings/Simulation/Decode the Slanted Ciphertext.cpp	70	// Step 3: Remove trailing spaces	COMMENT
LOW⚡	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	49	// Step 1: Create a boolean array to mark broken letters	COMMENT
LOW⚡	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	58	// Step 2: Iterate through text character by character	COMMENT
LOW	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	72	// Step 3: Check last word (no space after last word)	COMMENT
LOW	Backtracking/N-Queens.cpp	75	top row to bottom row, so we need to check if we put a queen	CODE
LOW	Backtracking/N-Queens.cpp	226	// the top row to the bottom row, so we need to check if we put a queen	COMMENT
LOW	Graph/BFS_DFS/Making A Large Island.cpp	246	// Step 1: Connect all existing 1s using DSU	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	263	// Step 2: Find the largest island without modification	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	270	// Step 3: Try flipping each 0 to 1	COMMENT
LOW	Graph/BFS_DFS/Making A Large Island.cpp	528	// Step 1: Connect all existing 1s using DSU	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	544	// Step 2: Find the largest island without modification	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	551	// Step 3: Try flipping each 0 to 1	COMMENT
LOW	HashMap/Minimum Index of a Valid Split.cpp	142	// Step 1: Find majority element using Boyer-Moore Voting Algorithm	COMMENT
LOW⚡	HashMap/Minimum Index of a Valid Split.cpp	154	// Step 2: Count how many times majority element occurs	COMMENT
LOW⚡	HashMap/Minimum Index of a Valid Split.cpp	162	// Step 3: Try splitting at every index to check conditions	COMMENT
LOW	…echnique/XOR After Range Multiplication Queries II.cpp	124	// Step 1: Process large K directly	COMMENT
LOW	…echnique/XOR After Range Multiplication Queries II.cpp	140	// Step 2: Process small K using diff array	COMMENT
LOW	…erence Array Technique/Zero Array Transformation I.cpp	58	// Step 1: Make difference array using queries	COMMENT
LOW⚡	…erence Array Technique/Zero Array Transformation I.cpp	71	// Step 2: Compute cumulative effect on each index	COMMENT
LOW⚡	…erence Array Technique/Zero Array Transformation I.cpp	79	// Step 3: Check if each value can reach 0	COMMENT
LOW	…rence Array Technique/Increment Submatrices by One.cpp	57	// Step 1: Process queries (Difference Array Technique)	COMMENT
LOW	…rence Array Technique/Increment Submatrices by One.cpp	72	// Step 2: Row-wise prefix sums	COMMENT
LOW	…ays/Difference Array Technique/Shifting Letters II.cpp	19	// Step 1: Populate the difference array	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	36	// Step 2: Compute the prefix sum to get the net shifts for each character	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	41	// Step 3: Apply the shifts to the string	COMMENT
LOW	…ays/Difference Array Technique/Shifting Letters II.cpp	72	// Step 1: Populate the difference array	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	91	// Step 2: Compute the prefix sum to get the net shifts for each character	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	96	// Step 3: Apply the shifts to the string	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	29	// Step 1: Apply updates using the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	41	// Step 2: Compute the final array from the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	64	// Step 1: Apply updates using the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	76	// Step 2: Compute the final array from the difference array	COMMENT
LOW	…s/Binary Search/Most Beautiful Item for Each Query.cpp	92	// Step 1: Sort the items based on price in ascending order	COMMENT
LOW⚡	…code Easy/Minimum Number of Moves to Seat Everyone.cpp	75	// Step 1: Sort both the seats and students arrays	COMMENT
LOW⚡	…code Easy/Minimum Number of Moves to Seat Everyone.cpp	82	// Step 2: Calculate the total number of moves	COMMENT
LOW	Greedy/Lexicographically Smallest Generated String.cpp	110	// Step 1: Process 'T'	COMMENT
LOW⚡	Greedy/Lexicographically Smallest Generated String.cpp	124	// Step 2: Fill remaining with 'a'	COMMENT
LOW⚡	Greedy/Lexicographically Smallest Generated String.cpp	132	// Step 3: Process 'F'	COMMENT
LOW	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	68	// Step 1: Compute freeArray (gaps between events)	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	81	// Step 2: Precompute max free to the right	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	85	// Step 3: Precompute max free to the left	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	91	// Step 4: Iterate for each possible movement/shift	COMMENT
LOW⚡	DP/Minimum Total Distance Traveled.cpp	92	// Step 1: Sort robot and factory arrays	COMMENT
LOW⚡	DP/Minimum Total Distance Traveled.cpp	98	// Step 2: Expand factory positions to avoid tracking of limit and easy recursion	COMMENT
LOW	DP/Minimum Total Distance Traveled.cpp	114	// Step 3: Solve the problem	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	63	// Step 1: Count frequency of each unique power value	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	69	// Step 2: \\Collect and sort unique values	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	162	// Step 1: Frequency map	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	167	// Step 2: Sort unique values	COMMENT
LOW⚡	DP/DP on Strings/Find the String with LCP.cpp	195	// Step 1: try to match with previous	COMMENT
LOW⚡	DP/DP on Strings/Find the String with LCP.cpp	203	// Step 2: assign smallest valid character	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	66	// Step 1: Store items	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	71	// Step 2: Sort by profit/weight ratio in descending order	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	80	// Step 3: Pick items greedily	COMMENT
LOW	… Technique/Maximum Sum Obtained of Any Permutation.cpp	62	// Step 1: Difference array marking (line sweep events)	COMMENT
LOW⚡	… Technique/Maximum Sum Obtained of Any Permutation.cpp	73	// Step 2: Prefix sum to get frequency of each index	COMMENT
LOW⚡	… Technique/Maximum Sum Obtained of Any Permutation.cpp	78	// Step 3: Sort nums and frequencies descending	COMMENT
8 more matches not shown…

Structural Annotation Overuse67 hits · 133 pts

Severity	File	Line	Snippet	Context
LOW	Bit_Magic/Maximum XOR for Each Query.cpp	52	// Step 1: Calculate the total XOR of all elements in nums	COMMENT
LOW⚡	strings/Word Subsets.cpp	68	// Step 1: Calculate the maximum frequency requirement for words2	COMMENT
LOW⚡	strings/Word Subsets.cpp	78	// Step 2: Check each word in words1	COMMENT
LOW	strings/Simulation/Decode the Slanted Ciphertext.cpp	70	// Step 3: Remove trailing spaces	COMMENT
LOW⚡	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	49	// Step 1: Create a boolean array to mark broken letters	COMMENT
LOW⚡	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	58	// Step 2: Iterate through text character by character	COMMENT
LOW	…s/Easy Tagged/Maximum Number of Words You Can Type.cpp	72	// Step 3: Check last word (no space after last word)	COMMENT
LOW	Graph/BFS_DFS/Making A Large Island.cpp	246	// Step 1: Connect all existing 1s using DSU	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	263	// Step 2: Find the largest island without modification	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	270	// Step 3: Try flipping each 0 to 1	COMMENT
LOW	Graph/BFS_DFS/Making A Large Island.cpp	528	// Step 1: Connect all existing 1s using DSU	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	544	// Step 2: Find the largest island without modification	COMMENT
LOW⚡	Graph/BFS_DFS/Making A Large Island.cpp	551	// Step 3: Try flipping each 0 to 1	COMMENT
LOW	HashMap/Minimum Index of a Valid Split.cpp	142	// Step 1: Find majority element using Boyer-Moore Voting Algorithm	COMMENT
LOW⚡	HashMap/Minimum Index of a Valid Split.cpp	154	// Step 2: Count how many times majority element occurs	COMMENT
LOW⚡	HashMap/Minimum Index of a Valid Split.cpp	162	// Step 3: Try splitting at every index to check conditions	COMMENT
LOW	…echnique/XOR After Range Multiplication Queries II.cpp	124	// Step 1: Process large K directly	COMMENT
LOW	…echnique/XOR After Range Multiplication Queries II.cpp	140	// Step 2: Process small K using diff array	COMMENT
LOW	…erence Array Technique/Zero Array Transformation I.cpp	58	// Step 1: Make difference array using queries	COMMENT
LOW⚡	…erence Array Technique/Zero Array Transformation I.cpp	71	// Step 2: Compute cumulative effect on each index	COMMENT
LOW⚡	…erence Array Technique/Zero Array Transformation I.cpp	79	// Step 3: Check if each value can reach 0	COMMENT
LOW	…rence Array Technique/Increment Submatrices by One.cpp	57	// Step 1: Process queries (Difference Array Technique)	COMMENT
LOW	…rence Array Technique/Increment Submatrices by One.cpp	72	// Step 2: Row-wise prefix sums	COMMENT
LOW	…ays/Difference Array Technique/Shifting Letters II.cpp	19	// Step 1: Populate the difference array	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	36	// Step 2: Compute the prefix sum to get the net shifts for each character	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	41	// Step 3: Apply the shifts to the string	COMMENT
LOW	…ays/Difference Array Technique/Shifting Letters II.cpp	72	// Step 1: Populate the difference array	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	91	// Step 2: Compute the prefix sum to get the net shifts for each character	COMMENT
LOW⚡	…ays/Difference Array Technique/Shifting Letters II.cpp	96	// Step 3: Apply the shifts to the string	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	29	// Step 1: Apply updates using the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	41	// Step 2: Compute the final array from the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	64	// Step 1: Apply updates using the difference array	COMMENT
LOW	Arrays/Difference Array Technique/Range Addition.cpp	76	// Step 2: Compute the final array from the difference array	COMMENT
LOW	…ortest Subarray to be Removed to Make Array Sorted.cpp	54	// Step 1 - Find the jth pointer from the right side	COMMENT
LOW	…ortest Subarray to be Removed to Make Array Sorted.cpp	66	// Step 2 - Start finding the correct i and j, and calculate the number of elements to delete	COMMENT
LOW	…s/Binary Search/Most Beautiful Item for Each Query.cpp	92	// Step 1: Sort the items based on price in ascending order	COMMENT
LOW⚡	…code Easy/Minimum Number of Moves to Seat Everyone.cpp	75	// Step 1: Sort both the seats and students arrays	COMMENT
LOW⚡	…code Easy/Minimum Number of Moves to Seat Everyone.cpp	82	// Step 2: Calculate the total number of moves	COMMENT
LOW	Greedy/Lexicographically Smallest Generated String.cpp	110	// Step 1: Process 'T'	COMMENT
LOW⚡	Greedy/Lexicographically Smallest Generated String.cpp	124	// Step 2: Fill remaining with 'a'	COMMENT
LOW⚡	Greedy/Lexicographically Smallest Generated String.cpp	132	// Step 3: Process 'F'	COMMENT
LOW	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	68	// Step 1: Compute freeArray (gaps between events)	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	81	// Step 2: Precompute max free to the right	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	85	// Step 3: Precompute max free to the left	COMMENT
LOW⚡	Greedy/Reschedule Meetings for Maximum Free Time II.cpp	91	// Step 4: Iterate for each possible movement/shift	COMMENT
LOW⚡	DP/Minimum Total Distance Traveled.cpp	92	// Step 1: Sort robot and factory arrays	COMMENT
LOW⚡	DP/Minimum Total Distance Traveled.cpp	98	// Step 2: Expand factory positions to avoid tracking of limit and easy recursion	COMMENT
LOW	DP/Minimum Total Distance Traveled.cpp	114	// Step 3: Solve the problem	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	63	// Step 1: Count frequency of each unique power value	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	162	// Step 1: Frequency map	COMMENT
LOW⚡	DP/1-D DP/Maximum Total Damage With Spell Casting.cpp	167	// Step 2: Sort unique values	COMMENT
LOW⚡	DP/DP on Strings/Find the String with LCP.cpp	195	// Step 1: try to match with previous	COMMENT
LOW⚡	DP/DP on Strings/Find the String with LCP.cpp	203	// Step 2: assign smallest valid character	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	66	// Step 1: Store items	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	71	// Step 2: Sort by profit/weight ratio in descending order	COMMENT
LOW⚡	DP/Knapsack Series/Fractional Knapsack.cpp	80	// Step 3: Pick items greedily	COMMENT
LOW	… Technique/Maximum Sum Obtained of Any Permutation.cpp	62	// Step 1: Difference array marking (line sweep events)	COMMENT
LOW⚡	… Technique/Maximum Sum Obtained of Any Permutation.cpp	73	// Step 2: Prefix sum to get frequency of each index	COMMENT
LOW⚡	… Technique/Maximum Sum Obtained of Any Permutation.cpp	78	// Step 3: Sort nums and frequencies descending	COMMENT
LOW⚡	Linked List/Split Linked List in Parts.cpp	53	// Step 1: Find the length of the list	COMMENT
7 more matches not shown…

Slop Phrases6 hits · 15 pts

Severity	File	Line	Snippet	Context
LOW	…ter/Longest_Substring_Without_Repeating_Characters.cpp	70	mp[ch] = j; //Don't forget to update new index of ch	CODE
MEDIUM	Arrays/2-D Array/Magic Squares In Grid.cpp	77	//Approach-2 (Using Maths and Observation) - LET ME KNOW IF YOU NEED THIS VIDEO AS WELL	COMMENT
MEDIUM	Arrays/2-D Array/Magic Squares In Grid.cpp	146	//Approach-2 (Using Maths and Observation) - LET ME KNOW IF YOU NEED THIS VIDEO AS WELL	COMMENT
MEDIUM	DP/Maximum Total Reward Using Operations I.cpp	3	MY YOUTUBE VIDEO ON THIS Qn : Let me know if you need it. I will be happy to create one for this problem	CODE
MEDIUM	DP/Minimum ASCII Delete Sum for Two Strings.cpp	55	//Let me know if you need a separate video on Bottom Up	COMMENT
MEDIUM	DP/Minimum ASCII Delete Sum for Two Strings.cpp	110	//Let me know if you need a separate video on Bottom Up	COMMENT

Over-Commented Block10 hits · 10 pts

Severity	File	Line	Snippet	Context
LOW	Design/Implement Router.cpp	81	}	COMMENT
LOW	Design/Design Movie Rental System.cpp	101	// T.C. :	COMMENT
LOW	…n Array Into Two Arrays to Minimize Sum Difference.cpp	41		COMMENT
LOW	…roblems/Design Graph With Shortest Path Calculator.cpp	141	//Approach-2 (Using Floyd Warshal Algorithm because it helps to find multi Source Shortest Path)	COMMENT
LOW	Arrays/Find All Groups of Farmland.cpp	301	//T.C : O(m*n)	COMMENT
LOW	DP/All Possible Full Binary Trees.cpp	61	//Approach-2 (Bottom Up)	COMMENT
LOW	…ts/Find the Maximum Length of Valid Subsequence II.cpp	21	//vector<int> dp1(n, 1); //mod1	COMMENT
LOW	…nts/Find the Maximum Length of Valid Subsequence I.cpp	61	// dp0 {} //mod0	COMMENT
LOW	DP/Game Strategy/Stone Game VIII.cpp	81	/******************************************************************* JAVA ******************************************	COMMENT
LOW	…d List/Merge 2 sorted linked list in reverse order.cpp	61	//T.C : O(m+n)	COMMENT

Modern AI Meta-Vocabulary2 hits · 6 pts

Severity	File	Line	Snippet	Context
MEDIUM	iPad PDF Notes/AI Advanced Playlist PDFs/README.md	159	### Video 13: Give Your AI Agent a Knowledge Base \| RAG Part 1: Embeddings & Cosine Similarity \| Advanced AI Playlist \|	COMMENT
MEDIUM	iPad PDF Notes/AI Advanced Playlist PDFs/README.md	170	### Video 14: Make Your AI Agent Search Documents \| RAG Part 2: Embedding & Searching \| Advanced AI Playlist \| codestory	COMMENT

MAZHARMIK/Interview_DS_Algo

Open-Source Code Quality, Security and Technical Debt Review