TheAlgorithms/Python

Pattern Findings

The scanner identified 1489 distinct pattern matches across 22 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.

Docstring Block Structure187 hits · 935 pts

Severity	File	Line	Snippet	Context
HIGH	searches/interpolation_search.py	7	Searches for an item in a sorted collection by interpolation search algorithm. Args: sorted_collection	STRING
HIGH	searches/interpolation_search.py	79	Pure implementation of interpolation search algorithm in Python by recursion Be careful collection must be ascending	STRING
HIGH	data_structures/binary_tree/floor_and_ceiling.py	37	Find the floor and ceiling values for a given key in a Binary Search Tree (BST). Args: root: The root	STRING
HIGH	data_structures/linked_list/is_palindrome.py	13	Check if a linked list is a palindrome. Args: head: The head of the linked list. Returns:	STRING
HIGH	data_structures/linked_list/is_palindrome.py	69	Check if a linked list is a palindrome using a stack. Args: head (ListNode): The head of the linked li	STRING
HIGH	data_structures/linked_list/is_palindrome.py	125	Check if a linked list is a palindrome using a dictionary. Args: head (ListNode): The head of the link	STRING
HIGH	data_structures/linked_list/circular_linked_list.py	108	Delete and return the data of the node at the nth pos in Circular Linked List. Args: index	STRING
HIGH	data_structures/linked_list/swap_nodes.py	44	Add a new node with the given data to the beginning of the Linked List. Args: new_data (An	STRING
HIGH	data_structures/linked_list/swap_nodes.py	68	Swap the positions of two nodes in the Linked List based on their data values. Args: node_	STRING
HIGH	data_structures/arrays/pairwise_iteration.py	15	Generate pairs of elements from an iterable just like: https://docs.python.org/3/library/itertools.html#itertoo	STRING
HIGH	data_structures/arrays/pairwise_iteration.py	81	Generate pairs of elements from an iterable with a given step size. This function uses list comprehensions to	STRING
HIGH	data_structures/arrays/median_two_array.py	7	Find the median of two arrays. Args: nums1: The first array. nums2: The second array. Ret	STRING
HIGH	data_structures/arrays/kth_largest_element.py	9	Partitions list based on the pivot element. This function rearranges the elements in the input list 'elements'	STRING
HIGH	data_structures/arrays/kth_largest_element.py	45	Finds the kth largest element in a list. Should deliver similar results to: ```python def kth_largest_e	STRING
HIGH	data_structures/arrays/merge_sorted.py	2	Merge two sorted arrays into one sorted array. Args: nums1: The first sorted array. nums2: The	STRING
HIGH	data_structures/arrays/find_triplets_with_0_sum.py	5	Given a list of integers, return elements a, b, c such that a + b + c = 0. Args: nums: list of integers	STRING
HIGH	data_structures/arrays/find_triplets_with_0_sum.py	28	Function for finding the triplets with a given sum in the array using hashing. Given a list of integers, retur	STRING
HIGH	data_structures/arrays/find_triplets_with_0_sum.py	85	Finds all unique triplets in the array which gives the sum of zero using the two-pointer technique. Args:	STRING
HIGH	data_structures/arrays/rotate_array.py	2	Rotates a list to the right by steps positions. Parameters: arr (List[int]): The list of integers to rotat	STRING
HIGH	data_structures/arrays/rotate_array.py	33	Reverses a portion of the list in place from index start to end. Parameters: start (int): Star	STRING
HIGH	data_structures/arrays/equilibrium_index_in_array.py	21	Find the first equilibrium index of an array. Args: arr: The input array of integers. Returns:	STRING
HIGH	data_structures/arrays/index_2d_array_in_1d.py	63	Retrieves the value of the one-dimensional index from a two-dimensional array. Args: array: A 2D array	STRING
HIGH	data_structures/arrays/product_sum.py	26	Recursively calculates the product sum of an array. The product sum of an array is defined as the sum of its e	STRING
HIGH	data_structures/arrays/product_sum.py	70	Calculates the product sum of an array. Args: array (List[Union[int, List]]): The array of integers an	STRING
HIGH	data_structures/arrays/product_sum.py	98	It Calculates the product sum of an array using iterative approach. It's similar to BFS algorithm (Breadth firs	STRING
HIGH	data_structures/arrays/gas_station.py	10	Finds the starting station index to complete the circuit, or returns -1 if not possible. Args: gas_st	STRING
HIGH	data_structures/arrays/merge_intervals.py	2	Merge all overlapping intervals. Each interval is represented as a list of two integers [start, end]. The	STRING
HIGH	hashes/crc32.py	58	Calculate the CRC32 hash of byte data. Args: data: Byte data to calculate the hash for Returns:	STRING
HIGH	strings/booths_algorithm.py	12	Find the lexicographically minimal rotation of the input string. Args: string (str): Input	STRING
HIGH	strings/count_vowels_consonants.py	2	Count the number of vowels and consonants in a given string. This function ignores non-alphabetic char	STRING
HIGH	strings/strip.py	2	Remove leading and trailing characters (whitespace by default) from a string. Args: user_string (str):	STRING
HIGH	strings/largest_smallest_words.py	2	Find the smallest and largest words in a given input string based on their length. Args: input_string	STRING
HIGH	data_compression/coordinate_compression.py	83	Compress a single value. Args: original: The value to compress. Returns: The	STRING
HIGH	data_compression/coordinate_compression.py	107	Decompress a single integer. Args: num: The compressed integer to decompress. Returns	STRING
HIGH	computer_vision/vision_transformer.py	24	Split an image into non-overlapping patches. Args: image: Input image array of shape (height, width, c	STRING
HIGH	computer_vision/vision_transformer.py	81	Linearly project flattened patches to embedding dimension. Args: patches: Array of patches with shape	STRING
HIGH	computer_vision/vision_transformer.py	121	Add learnable positional encodings to patch embeddings. Args: embeddings: Embedded patches of shape (n	STRING
HIGH	computer_vision/vision_transformer.py	170	Compute scaled dot-product attention. Attention(Q, K, V) = softmax(QK^T / sqrt(d_k))V Args: query	STRING
HIGH	computer_vision/vision_transformer.py	218	Apply Layer Normalization. Args: embeddings: Input array of shape (seq_len, embedding_dim) eps	STRING
HIGH	computer_vision/vision_transformer.py	244	Apply position-wise feed-forward network. FFN(x) = max(0, xW1 + b1)W2 + b2 Args: embeddings: Inpu	STRING
HIGH	computer_vision/vision_transformer.py	292	Apply a single Transformer encoder block. The block consists of: 1. Multi-head self-attention with residua	STRING
HIGH	computer_vision/vision_transformer.py	348	Apply Vision Transformer for image classification. Architecture: 1. Split image into patches 2. Linear	STRING
HIGH	computer_vision/haralick_descriptors.py	29	Normalizes image in Numpy 2D array format, between ranges 0-cap, as to fit uint8 type. Args: image	STRING
HIGH	computer_vision/haralick_descriptors.py	54	Normalizes a 1D array, between ranges 0-cap. Args: array: List containing values to be normalized between c	STRING
HIGH	computer_vision/haralick_descriptors.py	108	Simple image transformation using one of two available filter functions: Erosion and Dilation. Args:	STRING
HIGH	scheduling/job_sequencing_with_deadline.py	2	Function to find the maximum profit by doing jobs in a given time frame Args: jobs [list]: A list of t	STRING
HIGH	conversions/binary_to_gray_code.py	13	Convert a binary number to its Gray Code equivalent. The algorithm works by XORing the binary number with itse	STRING
HIGH	conversions/binary_to_gray_code.py	62	Convert a Gray Code number to its binary equivalent. The algorithm works by repeatedly XORing the gray code wi	STRING
HIGH	conversions/binary_to_gray_code.py	118	Convert a decimal number to its Gray Code representation as a binary string. Args: decimal_number: A p	STRING
HIGH	conversions/binary_to_gray_code.py	157	Convert a Gray Code binary string to its decimal equivalent. Args: gray_string: A string of 0s and 1s	STRING
HIGH	conversions/hex_to_rgb.py	12	Converts a hexadecimal color code to RGB values. Args: hex_color (str): A hexadecimal color code, e.g.	STRING
HIGH	conversions/endianness.py	35	Swap the byte order of a 16-bit integer. Args: value: 16-bit integer (0 to 65,535) Returns:	STRING
HIGH	conversions/endianness.py	73	Swap the byte order of a 32-bit integer. Args: value: 32-bit integer (0 to 4,294,967,295) Returns	STRING
HIGH	conversions/endianness.py	119	Swap the byte order of a 64-bit integer. Args: value: 64-bit integer (0 to 18,446,744,073,709,551,615)	STRING
HIGH	conversions/endianness.py	166	Convert bytes to integer using little-endian byte order. Args: data: Byte sequence to convert (1-8 byt	STRING
HIGH	conversions/endianness.py	202	Convert bytes to integer using big-endian byte order. Args: data: Byte sequence to convert (1-8 bytes)	STRING
HIGH	conversions/endianness.py	238	Convert integer to bytes using little-endian byte order. Args: value: Integer to convert (non-negative	STRING
HIGH	conversions/endianness.py	279	Convert integer to bytes using big-endian byte order. Args: value: Integer to convert (non-negative)	STRING
HIGH	electronics/wheatstone_bridge.py	8	Calculate the unknown resistance (Rx) in a Wheatstone bridge circuit. Wheatstone Bridge is an electrical circu	STRING
HIGH	machine_learning/ordinary_least_squares_regression.py	20	Performs Ordinary Least Squares Regression (OLSR) on the given data. Args: x: The independent variable	STRING
127 more matches not shown…

Cross-File Repetition101 hits · 505 pts

Severity	File	Line	Snippet	Context
HIGH	data_structures/binary_tree/mirror_binary_tree.py	0	a node has a value variable and pointers to nodes to its left and right.	STRING
HIGH	data_structures/binary_tree/binary_tree_path_sum.py	0	a node has a value variable and pointers to nodes to its left and right.	STRING
HIGH	data_structures/binary_tree/binary_tree_node_sum.py	0	a node has a value variable and pointers to nodes to its left and right.	STRING
HIGH	data_structures/linked_list/__init__.py	0	add an item to the linkedlist at the specified position. default position is 0 (the head). args: item (any): the item to	STRING
HIGH	data_structures/linked_list/kth_element_from_end.py	0	add an item to the linkedlist at the specified position. default position is 0 (the head). args: item (any): the item to	STRING
HIGH	data_structures/linked_list/partition_linked_list.py	0	add an item to the linkedlist at the specified position. default position is 0 (the head). args: item (any): the item to	STRING
HIGH	data_structures/linked_list/__init__.py	0	>>> linked_list = linkedlist() >>> linked_list.add(23) >>> linked_list.add(14) >>> linked_list.add(9) >>> print(linked_l	STRING
HIGH	data_structures/linked_list/kth_element_from_end.py	0	>>> linked_list = linkedlist() >>> linked_list.add(23) >>> linked_list.add(14) >>> linked_list.add(9) >>> print(linked_l	STRING
HIGH	data_structures/linked_list/partition_linked_list.py	0	>>> linked_list = linkedlist() >>> linked_list.add(23) >>> linked_list.add(14) >>> linked_list.add(9) >>> print(linked_l	STRING
HIGH	data_structures/hashing/number_theory/prime_numbers.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_037/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_041/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_046/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_049/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_058/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. >>> i	STRING
HIGH	project_euler/problem_007/sol3.py	0	project euler problem 7: https://projecteuler.net/problem=7 10001st prime by listing the first six prime numbers: 2, 3,	STRING
HIGH	project_euler/problem_007/sol2.py	0	project euler problem 7: https://projecteuler.net/problem=7 10001st prime by listing the first six prime numbers: 2, 3,	STRING
HIGH	project_euler/problem_007/sol1.py	0	project euler problem 7: https://projecteuler.net/problem=7 10001st prime by listing the first six prime numbers: 2, 3,	STRING
HIGH	project_euler/problem_007/sol3.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_007/sol2.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_007/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_003/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_027/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_010/sol2.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_010/sol1.py	0	checks to see if a number is a prime in o(sqrt(n)). a number is prime if it has exactly two factors: 1 and itself. retur	STRING
HIGH	project_euler/problem_009/sol3.py	0	project euler problem 9: https://projecteuler.net/problem=9 special pythagorean triplet a pythagorean triplet is a set o	STRING
HIGH	project_euler/problem_009/sol2.py	0	project euler problem 9: https://projecteuler.net/problem=9 special pythagorean triplet a pythagorean triplet is a set o	STRING
HIGH	project_euler/problem_009/sol1.py	0	project euler problem 9: https://projecteuler.net/problem=9 special pythagorean triplet a pythagorean triplet is a set o	STRING
HIGH	project_euler/problem_009/sol4.py	0	project euler problem 9: https://projecteuler.net/problem=9 special pythagorean triplet a pythagorean triplet is a set o	STRING
HIGH	project_euler/problem_008/sol3.py	0	project euler problem 8: https://projecteuler.net/problem=8 largest product in a series the four adjacent digits in the	STRING
HIGH	project_euler/problem_008/sol2.py	0	project euler problem 8: https://projecteuler.net/problem=8 largest product in a series the four adjacent digits in the	STRING
HIGH	project_euler/problem_008/sol1.py	0	project euler problem 8: https://projecteuler.net/problem=8 largest product in a series the four adjacent digits in the	STRING
HIGH	project_euler/problem_234/sol1.py	0	sieve of erotosthenes function to return all the prime numbers up to a number 'limit' https://en.wikipedia.org/wiki/siev	STRING
HIGH	project_euler/problem_051/sol1.py	0	sieve of erotosthenes function to return all the prime numbers up to a number 'limit' https://en.wikipedia.org/wiki/siev	STRING
HIGH	project_euler/problem_050/sol1.py	0	sieve of erotosthenes function to return all the prime numbers up to a number 'limit' https://en.wikipedia.org/wiki/siev	STRING
HIGH	project_euler/problem_006/sol3.py	0	project euler problem 6: https://projecteuler.net/problem=6 sum square difference the sum of the squares of the first te	STRING
HIGH	project_euler/problem_006/sol2.py	0	project euler problem 6: https://projecteuler.net/problem=6 sum square difference the sum of the squares of the first te	STRING
HIGH	project_euler/problem_006/sol1.py	0	project euler problem 6: https://projecteuler.net/problem=6 sum square difference the sum of the squares of the first te	STRING
HIGH	project_euler/problem_006/sol4.py	0	project euler problem 6: https://projecteuler.net/problem=6 sum square difference the sum of the squares of the first te	STRING
HIGH	project_euler/problem_006/sol3.py	0	returns the difference between the sum of the squares of the first n natural numbers and the square of the sum. >>> solu	STRING
HIGH	project_euler/problem_006/sol2.py	0	returns the difference between the sum of the squares of the first n natural numbers and the square of the sum. >>> solu	STRING
HIGH	project_euler/problem_006/sol1.py	0	returns the difference between the sum of the squares of the first n natural numbers and the square of the sum. >>> solu	STRING
HIGH	project_euler/problem_006/sol4.py	0	returns the difference between the sum of the squares of the first n natural numbers and the square of the sum. >>> solu	STRING
HIGH	project_euler/problem_001/sol7.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol3.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol2.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol6.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol1.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol5.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol4.py	0	project euler problem 1: https://projecteuler.net/problem=1 multiples of 3 and 5 if we list all the natural numbers belo	STRING
HIGH	project_euler/problem_001/sol7.py	0	returns the sum of all the multiples of 3 or 5 below n. >>> solution(3) 0 >>> solution(4) 3 >>> solution(10) 23 >>> solu	STRING
HIGH	project_euler/problem_001/sol2.py	0	returns the sum of all the multiples of 3 or 5 below n. >>> solution(3) 0 >>> solution(4) 3 >>> solution(10) 23 >>> solu	STRING
HIGH	project_euler/problem_001/sol6.py	0	returns the sum of all the multiples of 3 or 5 below n. >>> solution(3) 0 >>> solution(4) 3 >>> solution(10) 23 >>> solu	STRING
HIGH	project_euler/problem_001/sol4.py	0	returns the sum of all the multiples of 3 or 5 below n. >>> solution(3) 0 >>> solution(4) 3 >>> solution(10) 23 >>> solu	STRING
HIGH	project_euler/problem_001/sol1.py	0	returns the sum of all the multiples of 3 or 5 below n. >>> solution(3) 0 >>> solution(4) 3 >>> solution(10) 23 >>> solu	STRING
HIGH	project_euler/problem_111/sol1.py	0	calculates the list of primes up to and including `max_num`. >>> generate_primes(6) [2, 3, 5]	STRING
HIGH	project_euler/problem_124/sol1.py	0	calculates the list of primes up to and including `max_num`. >>> generate_primes(6) [2, 3, 5]	STRING
HIGH	project_euler/problem_095/sol1.py	0	calculates the list of primes up to and including `max_num`. >>> generate_primes(6) [2, 3, 5]	STRING
HIGH	project_euler/problem_025/sol3.py	0	the fibonacci sequence is defined by the recurrence relation: fn = fn-1 + fn-2, where f1 = 1 and f2 = 1. hence the first	STRING
HIGH	project_euler/problem_025/sol2.py	0	the fibonacci sequence is defined by the recurrence relation: fn = fn-1 + fn-2, where f1 = 1 and f2 = 1. hence the first	STRING
41 more matches not shown…

Cross-Language Confusion112 hits · 453 pts

Severity	File	Line	Snippet	Context
HIGH	data_structures/stacks/dijkstras_two_stack_algorithm.py	61	operand_stack.push(int(i))	CODE
HIGH	data_structures/stacks/dijkstras_two_stack_algorithm.py	64	operator_stack.push(i)	CODE
HIGH	data_structures/stacks/dijkstras_two_stack_algorithm.py	75	operand_stack.push(total)	CODE
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	28	>>> stack.push(5)	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	29	>>> stack.push(9)	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	30	>>> stack.push('python')	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	35	>>> stack.push('algorithms')	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	62	>>> stack.push("c")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	63	>>> stack.push("b")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	64	>>> stack.push("a")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	75	>>> stack.push("c")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	76	>>> stack.push("b")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	77	>>> stack.push("a")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	88	>>> stack.push(1)	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	97	>>> stack.push("Python")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	98	>>> stack.push("Java")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	99	>>> stack.push("C")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	115	>>> stack.push("c")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	116	>>> stack.push("b")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	117	>>> stack.push("a")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	135	>>> stack.push("Java")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	136	>>> stack.push("C")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	137	>>> stack.push("Python")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	150	>>> stack.push("Java")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	151	>>> stack.push("C")	STRING
HIGH⚡	data_structures/stacks/stack_with_singly_linked_list.py	152	>>> stack.push("Python")	STRING
HIGH	data_structures/stacks/stack_with_doubly_linked_list.py	26	... stack.push(i)	STRING
HIGH⚡	data_structures/stacks/stack_with_doubly_linked_list.py	100	stack.push(4)	CODE
HIGH⚡	data_structures/stacks/stack_with_doubly_linked_list.py	103	stack.push(5)	CODE
HIGH⚡	data_structures/stacks/stack_with_doubly_linked_list.py	106	stack.push(6)	CODE
HIGH⚡	data_structures/stacks/stack_with_doubly_linked_list.py	109	stack.push(7)	CODE
HIGH	data_structures/stacks/balanced_parentheses.py	27	stack.push(bracket)	CODE
HIGH⚡	data_structures/stacks/stack.py	40	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	41	>>> S.push(20)	STRING
HIGH⚡	data_structures/stacks/stack.py	46	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	47	>>> S.push(20)	STRING
HIGH	data_structures/stacks/stack.py	62	>>> S.push(-5)	STRING
HIGH	data_structures/stacks/stack.py	63	>>> S.push(10)	STRING
HIGH	data_structures/stacks/stack.py	81	>>> S.push(-5)	STRING
HIGH	data_structures/stacks/stack.py	82	>>> S.push(10)	STRING
HIGH	data_structures/stacks/stack.py	104	>>> S.push(10)	STRING
HIGH	data_structures/stacks/stack.py	117	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	132	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	137	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	138	>>> S.push(20)	STRING
HIGH	data_structures/stacks/stack.py	149	>>> S.push(10)	STRING
HIGH	data_structures/stacks/stack.py	154	>>> S.push(10)	STRING
HIGH⚡	data_structures/stacks/stack.py	185	stack.push(i)	CODE
HIGH⚡	data_structures/stacks/stack.py	194	stack.push(100)	CODE
HIGH⚡	data_structures/stacks/stack.py	198	stack.push(200)	CODE
HIGH⚡	data_structures/stacks/infix_to_postfix_conversion.py	74	stack.push(char)	CODE
HIGH⚡	data_structures/stacks/infix_to_postfix_conversion.py	82	stack.push(char)	CODE
HIGH⚡	data_structures/stacks/infix_to_postfix_conversion.py	89	stack.push(char)	CODE
HIGH⚡	data_structures/stacks/infix_to_postfix_conversion.py	96	stack.push(char)	CODE
HIGH⚡	data_structures/stacks/stack_using_two_queues.py	13	>>> stack.push(1)	STRING
HIGH⚡	data_structures/stacks/stack_using_two_queues.py	14	>>> stack.push(2)	STRING
HIGH⚡	data_structures/stacks/stack_using_two_queues.py	15	>>> stack.push(3)	STRING
HIGH	data_structures/stacks/stack_using_two_queues.py	68	stack.push(element)	CODE
HIGH	data_structures/binary_tree/avl_tree.py	302	q.push(self.root)	STRING
HIGH⚡	data_structures/binary_tree/avl_tree.py	313	q.push(None)	STRING
52 more matches not shown…

Hyper-Verbose Identifiers320 hits · 324 pts

Severity	File	Line	Snippet	Context
LOW	searches/binary_search.py	267	def binary_search_with_duplicates(sorted_collection: list[int], item: int) -> list[int]:	CODE
LOW	searches/binary_search.py	342	def binary_search_by_recursion(	CODE
LOW	searches/exponential_search.py	19	def binary_search_by_recursion(	CODE
LOW	searches/interpolation_search.py	76	def interpolation_search_by_recursion(	CODE
LOW	data_structures/kd_tree/tests/test_kdtree.py	63	def test_nearest_neighbour_search() -> None:	CODE
LOW	data_structures/stacks/next_greater_element.py	7	def next_greatest_element_slow(arr: list[float]) -> list[float]:	CODE
LOW	data_structures/stacks/next_greater_element.py	40	def next_greatest_element_fast(arr: list[float]) -> list[float]:	CODE
LOW	data_structures/stacks/dijkstras_two_stack_algorithm.py	40	def dijkstras_two_stack_algorithm(equation: str) -> int:	CODE
LOW	data_structures/stacks/kth_next_greater_element.py	10	def find_kth_next_greater_element(	CODE
LOW	data_structures/binary_tree/binary_tree_traversals.py	119	def get_nodes_from_left_to_right(root: Node \| None, level: int) -> Generator[int]:	STRING
LOW	data_structures/binary_tree/binary_tree_traversals.py	141	def get_nodes_from_right_to_left(root: Node \| None, level: int) -> Generator[int]:	STRING
LOW	…ta_structures/binary_tree/diff_views_of_binary_tree.py	30	def binary_tree_right_side_view(root: TreeNode) -> list[int]:	STRING
LOW	…ta_structures/binary_tree/diff_views_of_binary_tree.py	70	def binary_tree_left_side_view(root: TreeNode) -> list[int]:	STRING
LOW	…ta_structures/binary_tree/diff_views_of_binary_tree.py	110	def binary_tree_top_side_view(root: TreeNode) -> list[int]:	STRING
LOW	…ta_structures/binary_tree/diff_views_of_binary_tree.py	159	def binary_tree_bottom_side_view(root: TreeNode) -> list[int]:	STRING
LOW	…structures/binary_tree/binary_search_tree_recursive.py	546	def binary_search_tree_example() -> None:	STRING
LOW	data_structures/linked_list/skip_list.py	269	def test_insert_overrides_existing_value() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	297	def test_searching_empty_list_returns_none() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	318	def test_deleting_item_from_empty_list_do_nothing() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	325	def test_deleted_items_are_not_founded_by_find_method() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	340	def test_delete_removes_only_given_key() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	373	def test_delete_doesnt_leave_dead_nodes() -> None:	CODE
LOW	data_structures/linked_list/skip_list.py	391	def test_iter_always_yields_sorted_values() -> None:	CODE
LOW	data_structures/linked_list/circular_linked_list.py	151	def test_circular_linked_list() -> None:	CODE
LOW	data_structures/hashing/tests/test_hash_map.py	77	def test_hash_map_is_the_same_as_dict(operations) -> None:	CODE
LOW	data_structures/hashing/tests/test_hash_map.py	90	def test_no_new_methods_was_added_to_api() -> None:	CODE
LOW	data_structures/arrays/pairwise_iteration.py	78	def pairwise_iteration_comprehension(	CODE
LOW	data_structures/arrays/median_two_array.py	6	def find_median_sorted_arrays(nums1: list[int], nums2: list[int]) -> float:	CODE
LOW	data_structures/queues/circular_queue_linked_list.py	142	def check_can_perform_operation(self) -> None:	CODE
LOW⚡	data_structures/suffix_tree/tests/test_suffix_tree.py	20	def test_search_existing_patterns(self) -> None:	CODE
LOW⚡	data_structures/suffix_tree/tests/test_suffix_tree.py	29	def test_search_non_existing_patterns(self) -> None:	CODE
LOW⚡	data_structures/suffix_tree/tests/test_suffix_tree.py	38	def test_search_empty_pattern(self) -> None:	CODE
LOW	strings/damerau_levenshtein_distance.py	11	def damerau_levenshtein_distance(first_string: str, second_string: str) -> int:	CODE
LOW	strings/palindrome.py	84	def is_palindrome_ignore_case_and_spaces(s: str) -> bool:	CODE
LOW	strings/can_string_be_rearranged_as_palindrome.py	11	def can_string_be_rearranged_as_palindrome_counter(	CODE
LOW	strings/can_string_be_rearranged_as_palindrome.py	29	def can_string_be_rearranged_as_palindrome(input_str: str = "") -> bool:	CODE
LOW	strings/suffix_automaton.py	117	def count_distinct_substrings(self) -> int:	CODE
LOW	strings/is_srilankan_phone_number.py	4	def is_sri_lankan_phone_number(phone: str) -> bool:	CODE
LOW	strings/alternative_string_arrange.py	1	def alternative_string_arrange(first_str: str, second_str: str) -> str:	CODE
LOW	strings/levenshtein_distance.py	54	def levenshtein_distance_optimized(first_word: str, second_word: str) -> int:	CODE
LOW	strings/levenshtein_distance.py	99	def benchmark_levenshtein_distance(func: Callable) -> None:	CODE
LOW	strings/count_vowels_consonants.py	1	def count_vowels_and_consonants(text: str) -> tuple[int, int]:	CODE
LOW	strings/boyer_moore_horspool.py	41	def boyer_moore_horspool_search(text: str, pattern: str) -> int:	CODE
LOW	strings/boyer_moore_horspool.py	86	def boyer_moore_horspool_search_all(text: str, pattern: str) -> list[int]:	CODE
LOW	strings/largest_smallest_words.py	1	def find_smallest_and_largest_words(input_string: str) -> tuple:	CODE
LOW	strings/credit_card_validator.py	55	def validate_credit_card_number(credit_card_number: str) -> bool:	CODE
LOW	bit_manipulation/find_previous_power_of_two.py	1	def find_previous_power_of_two(number: int) -> int:	CODE
LOW	bit_manipulation/single_bit_manipulation_operations.py	97	def clear_least_significant_set_bit(number: int) -> int:	CODE
LOW	bit_manipulation/is_even.py	37	def is_even_using_shift_operator(number: int) -> bool:	CODE
LOW	bit_manipulation/bitwise_addition_recursive.py	7	def bitwise_addition_recursive(number: int, other_number: int) -> int:	CODE
LOW	bit_manipulation/count_number_of_one_bits.py	4	def get_set_bits_count_using_brian_kernighans_algorithm(number: int) -> int:	CODE
LOW	bit_manipulation/count_number_of_one_bits.py	35	def get_set_bits_count_using_modulo_operator(number: int) -> int:	CODE
LOW	bit_manipulation/count_number_of_one_bits.py	67	def get_set_bits_count_using_lookup_table(number: int) -> int:	CODE
LOW	bit_manipulation/gray_code_sequence.py	48	def gray_code_sequence_string(bit_count: int) -> list[str]:	CODE
LOW	bit_manipulation/binary_count_trailing_zeros.py	4	def binary_count_trailing_zeros(a: int) -> int:	CODE
LOW	bit_manipulation/largest_pow_of_two_le_num.py	22	def largest_pow_of_two_le_num(number: int) -> int:	CODE
LOW	bit_manipulation/index_of_rightmost_set_bit.py	4	def get_index_of_rightmost_set_bit(number: int) -> int:	CODE
LOW	bit_manipulation/highest_set_bit.py	1	def get_highest_set_bit_position(number: int) -> int:	CODE
LOW	data_compression/peak_signal_to_noise_ratio.py	17	def peak_signal_to_noise_ratio(original: float, contrast: float) -> float:	CODE
LOW	project_euler/problem_203/sol1.py	34	def get_pascal_triangle_unique_coefficients(depth: int) -> set[int]:	CODE
260 more matches not shown…

Unused Imports285 hits · 284 pts

Severity	File	Line	Context
LOW	networking_flow/push_relabel.py	19	CODE
LOW	searches/simple_binary_search.py	11	CODE
LOW	searches/double_linear_search.py	1	CODE
LOW	searches/exponential_search.py	16	CODE
LOW	searches/ternary_search.py	10	CODE
LOW	searches/binary_tree_traversal.py	5	CODE
LOW	data_structures/kd_tree/kd_node.py	9	CODE
LOW	data_structures/stacks/next_greater_element.py	1	CODE
LOW	data_structures/stacks/stack_with_singly_linked_list.py	3	CODE
LOW	data_structures/stacks/stack_with_doubly_linked_list.py	4	CODE
LOW	data_structures/stacks/stack.py	1	CODE
LOW	data_structures/stacks/stack_tracking_min_max.py	1	CODE
LOW	data_structures/stacks/stack_using_two_queues.py	1	CODE
LOW	…ctures/binary_tree/flatten_binarytree_to_linkedlist.py	14	CODE
LOW	data_structures/binary_tree/wavelet_tree.py	11	CODE
LOW	data_structures/binary_tree/merge_two_binary_trees.py	9	CODE
LOW	data_structures/binary_tree/avl_tree.py	9	CODE
LOW	data_structures/binary_tree/treap.py	1	CODE
LOW	…a_structures/binary_tree/non_recursive_segment_tree.py	39	CODE
LOW	data_structures/binary_tree/persistent_segment_tree.py	1	CODE
LOW	data_structures/binary_tree/mirror_binary_tree.py	7	CODE
LOW	data_structures/binary_tree/splay_tree.py	14	CODE
LOW	data_structures/binary_tree/is_sum_tree.py	7	CODE
LOW	data_structures/binary_tree/binary_search_tree.py	92	CODE
LOW	data_structures/binary_tree/binary_tree_traversals.py	1	CODE
LOW	data_structures/binary_tree/red_black_tree.py	1	CODE
LOW	data_structures/binary_tree/floor_and_ceiling.py	13	CODE
LOW	data_structures/binary_tree/binary_tree_path_sum.py	10	CODE
LOW	data_structures/binary_tree/symmetric_tree.py	8	CODE
LOW	…ta_structures/binary_tree/diff_views_of_binary_tree.py	9	CODE
LOW	data_structures/binary_tree/distribute_coins.py	40	CODE
LOW	data_structures/binary_tree/basic_binary_tree.py	1	CODE
LOW	…structures/binary_tree/binary_tree_maximum_path_sum.py	1	CODE
LOW	data_structures/binary_tree/lowest_common_ancestor.py	4	CODE
LOW	data_structures/binary_tree/diameter_of_binary_tree.py	6	CODE
LOW	data_structures/binary_tree/lazy_segment_tree.py	1	CODE
LOW	…tures/binary_tree/serialize_deserialize_binary_tree.py	1	CODE
LOW	…structures/binary_tree/binary_search_tree_recursive.py	11	CODE
LOW	data_structures/binary_tree/maximum_sum_bst.py	1	CODE
LOW	data_structures/binary_tree/binary_tree_node_sum.py	11	CODE
LOW	data_structures/binary_tree/is_sorted.py	17	CODE
LOW	data_structures/linked_list/merge_two_lists.py	5	CODE
LOW	data_structures/linked_list/is_palindrome.py	1	CODE
LOW	data_structures/linked_list/__init__.py	9	CODE
LOW	…tructures/linked_list/middle_element_of_linked_list.py	1	CODE
LOW	data_structures/linked_list/rotate_to_the_right.py	1	CODE
LOW	data_structures/linked_list/kth_element_from_end.py	1	CODE
LOW	data_structures/linked_list/skip_list.py	6	CODE
LOW	data_structures/linked_list/circular_linked_list.py	1	CODE
LOW	data_structures/linked_list/swap_nodes.py	1	CODE
LOW	data_structures/linked_list/reverse_k_group.py	1	CODE
LOW	data_structures/linked_list/sorted_linked_list.py	1	CODE
LOW	data_structures/linked_list/doubly_linked_list.py	5	CODE
LOW	data_structures/linked_list/print_reverse.py	1	CODE
LOW	data_structures/linked_list/has_loop.py	1	CODE
LOW	…ctures/linked_list/remove_nth_node_from_end_of_list.py	3	CODE
LOW	data_structures/linked_list/partition_linked_list.py	1	CODE
LOW	data_structures/linked_list/singly_linked_list.py	1	CODE
LOW	data_structures/heap/heap.py	1	CODE
LOW	data_structures/heap/skew_heap.py	3	CODE
225 more matches not shown…

Deep Nesting166 hits · 162 pts

Severity	File	Line	Context
LOW	searches/simulated_annealing.py	9	CODE
LOW	searches/hill_climbing.py	93	CODE
LOW	searches/ternary_search.py	62	CODE
LOW	searches/ternary_search.py	117	CODE
LOW	searches/tabu_search.py	127	CODE
LOW	searches/tabu_search.py	188	CODE
LOW	searches/interpolation_search.py	6	CODE
LOW	searches/fibonacci_search.py	59	CODE
LOW	searches/median_of_medians.py	61	CODE
LOW	data_structures/stacks/next_greater_element.py	71	CODE
LOW	data_structures/stacks/dijkstras_two_stack_algorithm.py	40	CODE
LOW	data_structures/stacks/infix_to_prefix_conversion.py	18	CODE
LOW	data_structures/stacks/infix_to_postfix_conversion.py	45	CODE
LOW	data_structures/binary_tree/avl_tree.py	198	CODE
LOW	data_structures/binary_tree/avl_tree.py	297	CODE
LOW	data_structures/binary_tree/splay_tree.py	92	CODE
LOW	data_structures/binary_tree/binary_search_tree.py	170	CODE
LOW	data_structures/binary_tree/red_black_tree.py	112	CODE
LOW	data_structures/binary_tree/red_black_tree.py	150	CODE
LOW	data_structures/binary_tree/red_black_tree.py	367	CODE
LOW	data_structures/binary_tree/red_black_tree.py	384	CODE
LOW	data_structures/binary_tree/maximum_fenwick_tree.py	87	CODE
LOW	data_structures/linked_list/is_palindrome.py	124	CODE
LOW	data_structures/linked_list/skip_list.py	163	CODE
LOW	data_structures/linked_list/sorted_linked_list.py	80	CODE
LOW	data_structures/linked_list/sorted_linked_list.py	113	CODE
LOW	data_structures/linked_list/doubly_linked_list.py	66	CODE
LOW	data_structures/linked_list/doubly_linked_list.py	123	CODE
LOW	data_structures/trie/radix_tree.py	52	CODE
LOW	data_structures/trie/radix_tree.py	138	CODE
LOW	data_structures/arrays/find_triplets_with_0_sum.py	27	CODE
LOW	data_structures/arrays/find_triplets_with_0_sum.py	84	CODE
LOW	hashes/sha1.py	88	CODE
LOW	hashes/hamming_code.py	71	CODE
LOW	hashes/hamming_code.py	147	CODE
LOW	hashes/md5.py	297	CODE
LOW	strings/min_window_substring.py	1	CODE
LOW	strings/camel_case_to_snake_case.py	1	CODE
LOW	strings/wildcard_pattern_matching.py	10	CODE
LOW	strings/aho_corasick.py	67	CODE
LOW	bit_manipulation/fast_walsh_hadamard_transform.py	86	CODE
LOW	bit_manipulation/fast_walsh_hadamard_transform.py	146	CODE
LOW	project_euler/problem_009/sol1.py	20	CODE
LOW	project_euler/problem_054/sol1.py	141	CODE
LOW	project_euler/problem_054/sol1.py	280	CODE
LOW	project_euler/problem_039/sol1.py	17	CODE
LOW	project_euler/problem_111/sol1.py	49	CODE
LOW	project_euler/problem_180/sol1.py	88	CODE
LOW	project_euler/problem_142/sol1.py	29	CODE
LOW	project_euler/problem_551/sol1.py	20	CODE
LOW	project_euler/problem_049/sol1.py	95	CODE
LOW	project_euler/problem_092/sol1.py	19	CODE
LOW	project_euler/problem_004/sol1.py	16	CODE
LOW	project_euler/problem_027/sol1.py	62	CODE
LOW	project_euler/problem_087/sol1.py	18	CODE
LOW	project_euler/problem_017/sol1.py	19	CODE
LOW	project_euler/problem_026/sol1.py	27	CODE
LOW	project_euler/problem_019/sol1.py	24	CODE
LOW	scheduling/cpuschedulingalgorithms.py	359	CODE
LOW	scheduling/round_robin.py	12	CODE
106 more matches not shown…

Redundant / Tautological Comments99 hits · 151 pts

Severity	File	Line	Snippet	Context
LOW	data_structures/kd_tree/example/example_usage.py	38	# Print the results	COMMENT
LOW	data_structures/kd_tree/tests/test_kdtree.py	49	# Check if root node is not None	COMMENT
LOW	data_structures/kd_tree/tests/test_kdtree.py	52	# Check if root has correct dimensions	COMMENT
LOW	data_structures/linked_list/rotate_to_the_right.py	97	# Check if the list is empty or has only one element	COMMENT
LOW	data_structures/linked_list/from_sequence.py	53	# Loop through elements from position 1	COMMENT
LOW	data_structures/linked_list/singly_linked_list.py	444	# Check if it's empty or not	COMMENT
LOW	data_structures/arrays/find_triplets_with_0_sum.py	69	# Verify if the desired value exists in the set.	COMMENT
LOW	strings/min_window_substring.py	64	# Check if window is the smallest found so far	COMMENT
LOW	strings/min_window_substring.py	80	# Check if window is the smallest found so far	COMMENT
LOW	strings/can_string_be_rearranged_as_palindrome.py	7	# Check if characters of the given string can be rearranged to form a palindrome.	COMMENT
LOW	linear_programming/simplex.py	49	# Check if RHS is negative	COMMENT
LOW	computer_vision/intensity_based_segmentation.py	49	# Display the results	COMMENT
LOW	scheduling/shortest_job_first.py	71	# Increment time	COMMENT
LOW	genetic_algorithm/basic_string.py	122	# Verify if N_POPULATION is bigger than N_SELECTED	COMMENT
LOW	genetic_algorithm/basic_string.py	161	# Check if there is a matching evolution.	COMMENT
LOW	genetic_algorithm/basic_string.py	189	# Check if the population has already reached the maximum value and if so,	COMMENT
LOW	conversions/hex_to_rgb.py	60	# Check if the input is a valid hex color code	COMMENT
LOW	machine_learning/gradient_boosting_classifier.py	43	>>> # Check if the model is trained	STRING
LOW	machine_learning/gradient_boosting_classifier.py	73	>>> # Check if the predictions have the correct shape	STRING
LOW	machine_learning/gradient_boosting_classifier.py	99	>>> # Check if residuals have the correct shape	STRING
LOW	machine_learning/dimensionality_reduction.py	106	# Check if the features have been loaded	COMMENT
LOW	machine_learning/dimensionality_reduction.py	142	# Check if the dimension desired is less than the number of classes	COMMENT
LOW	machine_learning/dimensionality_reduction.py	145	# Check if features have been already loaded	COMMENT
LOW	machine_learning/dimensionality_reduction.py	277	# Check if we're close enough	COMMENT
LOW	machine_learning/sequential_minimum_optimization.py	161	# Check if alpha violates the KKT condition	COMMENT
LOW	backtracking/coloring.py	53	# Check if any adjacent vertex has already been colored with the same color	COMMENT
LOW	backtracking/coloring.py	114	# Check if it's valid to color the current vertex with 'color'	COMMENT
LOW	backtracking/rat_in_maze.py	123	# Check if source and destination coordinates are Invalid.	COMMENT
LOW	backtracking/n_queens.py	48	# Check if there is any queen in the same upper column,	COMMENT
LOW⚡	other/word_search.py	85	# Check if there is space for the word above the row	COMMENT
LOW⚡	other/word_search.py	91	# Check if there is space to the right of the word as well as above	COMMENT
LOW⚡	other/word_search.py	95	# Check if there are existing letters	COMMENT
LOW⚡	other/word_search.py	155	# Check if there is space for the word below the row	COMMENT
LOW⚡	other/word_search.py	161	# Check if there is space to the right of the word as well as below	COMMENT
LOW⚡	other/word_search.py	165	# Check if there are existing letters	COMMENT
LOW⚡	other/word_search.py	225	# Check if there is space for the word below the row	COMMENT
LOW⚡	other/word_search.py	231	# Check if there is space to the left of the word as well as below	COMMENT
LOW⚡	other/word_search.py	235	# Check if there are existing letters	COMMENT
LOW⚡	other/word_search.py	295	# Check if there is space for the word above the row	COMMENT
LOW⚡	other/word_search.py	301	# Check if there is space to the left of the word as well as above	COMMENT
LOW⚡	other/word_search.py	305	# Check if there are existing letters	COMMENT
LOW	other/word_search.py	53	# Check if there is space above the row to fit in the word	COMMENT
LOW	other/word_search.py	125	# Check if there is space to the right of the word	COMMENT
LOW	other/word_search.py	129	# Check if there are existing letters	COMMENT
LOW	other/word_search.py	193	# Check if there is space below the row to fit in the word	COMMENT
LOW	other/word_search.py	265	# Check if there is space to the left of the word	COMMENT
LOW	other/word_search.py	269	# Check if there are existing letters	COMMENT
LOW	dynamic_programming/largest_divisible_subset.py	37	# Iterate through the array	COMMENT
LOW	dynamic_programming/needleman_wunsch.py	151	# Check if diagonal step was optimal	COMMENT
LOW	dynamic_programming/needleman_wunsch.py	162	# Check if vertical step (gap in second sequence) was optimal	COMMENT
LOW	dynamic_programming/narcissistic_number.py	84	# Check if narcissistic	COMMENT
LOW	neural_network/two_hidden_layers_neural_network.py	289	# Set give_loss to True if you want to see loss in every iteration.	COMMENT
LOW	neural_network/sliding_window_attention.py	68	>>> (output.sum() != 0).item() # Check if output is non-zero	STRING
LOW	blockchain/simple_proof_of_work.py	41	# Check if the hash meets the difficulty requirement	COMMENT
LOW	ciphers/des_ecb.py	363	>>> len(key) # Check if the key length is correct	STRING
LOW	ciphers/base58.py	106	# Check if the encoded string contains non base64 characters	COMMENT
LOW	ciphers/base64_cipher.py	106	# Check if the encoded string contains non base64 characters	COMMENT
LOW	maths/line_intersection.py	144	# Check if the intersection point lies within the bounds of both line segments	COMMENT
LOW	maths/line_length.py	48	# Increment step	COMMENT
LOW	maths/ear_clipping_polygon_triangulation.py	32	# Check if the vertex is convex based on the polygon's orientation.	COMMENT
39 more matches not shown…

Self-Referential Comments42 hits · 116 pts

Severity	File	Line	Snippet	Context
MEDIUM	networking_flow/ford_fulkerson.py	86	# Create a copy of the graph to avoid modifying the original	COMMENT
MEDIUM	data_structures/stacks/stock_span_problem.py	34	# Create a stack and push index of fist element to it	COMMENT
MEDIUM	data_structures/stacks/postfix_to_infix_conversion.py	30	# Create a stack to store the operands and operators.	COMMENT
MEDIUM	data_structures/stacks/postfix_evaluation.py	191	# Create a loop so that the user can evaluate postfix expressions multiple times	COMMENT
MEDIUM	data_structures/linked_list/sorted_linked_list.py	25	"""This class represents a sorted linked list."""	STRING
MEDIUM	data_structures/linked_list/floyds_cycle_detection.py	107	# Create a cycle in the linked list	STRING
MEDIUM	data_structures/linked_list/floyds_cycle_detection.py	139	# Create a cycle in the linked list	COMMENT
MEDIUM	data_structures/arrays/dynamic_array.py	5	self.array = [None] * self.capacity # Create an array with initial capacity	CODE
MEDIUM	strings/damerau_levenshtein_distance.py	36	# Create a dynamic programming matrix to store the distances	COMMENT
MEDIUM	strings/word_occurrence.py	18	# Creating a dictionary containing count of each word	COMMENT
MEDIUM	data_compression/lz77.py	217	# Initialize compressor class	COMMENT
MEDIUM	project_euler/problem_054/sol1.py	186	# This function is not part of the problem, I did it just for fun	COMMENT
MEDIUM	computer_vision/vision_transformer.py	417	# Create a sample image (224x224x3 for ImageNet-style input)	COMMENT
MEDIUM	computer_vision/intensity_based_segmentation.py	3	# Importing necessary libraries	COMMENT
MEDIUM	computer_vision/horn_schunck.py	42	# Create a grid of all pixel coordinates and subtract the flow to get the	COMMENT
MEDIUM	scheduling/job_sequencing_with_deadline.py	24	# Create a list of size equal to the maximum deadline	COMMENT
MEDIUM	conversions/prefix_conversions_string.py	16	# Create a generic variable that can be 'Enum', or any subclass.	COMMENT
MEDIUM	file_transfer/send_file.py	5	sock = socket.socket() # Create a socket object	CODE
MEDIUM	knapsack/greedy_knapsack.py	46	# Creating a copy of the list and sorting profit/weight in ascending order	COMMENT
MEDIUM	dynamic_programming/longest_increasing_subsequence.py	19	def longest_subsequence(array: list[int]) -> list[int]: # This function is recursive	CODE
MEDIUM	dynamic_programming/egg_dropping.py	33	# Create a DP table to store the results of subproblems.	COMMENT
MEDIUM	neural_network/sliding_window_attention.py	75	# Define the window range	COMMENT
MEDIUM	…ital_image_processing/test_digital_image_processing.py	127	# Create a numpy array as the same height and width of read image	COMMENT
MEDIUM	…gital_image_processing/filters/local_binary_pattern.py	69	# Create a numpy array as the same height and width of read image	COMMENT
MEDIUM	blockchain/simple_proof_of_work.py	35	# Create a single string representing all block data	COMMENT
MEDIUM	ciphers/simple_keyword_cypher.py	27	# Create a list of the letters in the alphabet	COMMENT
MEDIUM	ciphers/fractionated_morse_cipher.py	75	# Create a reverse dictionary for Morse code	COMMENT
MEDIUM	maths/first_fundamental_form.py	48	# Define the mathematical symbols	COMMENT
MEDIUM	maths/first_fundamental_form.py	56	# Define the position vector r	COMMENT
MEDIUM	graphs/edmonds_blossom_algorithm.py	75	# Create an adjacency list for the graph	COMMENT
MEDIUM	geometry/triangle.py	8	# Define a Point on a 2D normalized orthogonal euclidean grid	COMMENT
MEDIUM	geometry/tests/test_graham_scan.py	222	# Create a circle of points	COMMENT
MEDIUM	cellular_automata/one_dimensional.py	11	# Define the first generation of cells	COMMENT
MEDIUM	cellular_automata/one_dimensional.py	38	# Define a new cell and add it to the new generation	COMMENT
MEDIUM	cellular_automata/one_dimensional.py	55	# Create the output image	COMMENT
MEDIUM	cellular_automata/nagel_schrekenberg.py	47	highway = [[-1] * number_of_cells] # Create a highway without any car	CODE
MEDIUM	physics/casimir_effect.py	42	# Define the Reduced Planck Constant ℏ (H bar), speed of light C, value of	COMMENT
MEDIUM	physics/newtons_law_of_gravitation.py	24	# Define the Gravitational Constant G and the function	COMMENT
MEDIUM	web_programming/current_weather.py	14	# Define the URL for the APIs with placeholders	COMMENT
MEDIUM	sorts/reversort.py	90	arr = collection[:] # Create a copy to avoid modifying the original	CODE
MEDIUM	sorts/reversort.py	135	arr = collection[:] # Create a copy to avoid modifying the original	CODE
MEDIUM	sorts/flash_sort.py	73	# Create a copy to avoid modifying the original array	COMMENT

Decorative Section Separators31 hits · 80 pts

Severity	File	Line	Snippet	Context
MEDIUM	hashes/hamming_code.py	234	# ---------------------------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	92	# ------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	138	# --------------------------------	COMMENT
MEDIUM	maths/primelib.py	176	# -----------------------------------------	COMMENT
MEDIUM	maths/primelib.py	232	# -----------------------------------------	COMMENT
MEDIUM	maths/primelib.py	274	# ----------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	316	# ----------------------	COMMENT
MEDIUM	maths/primelib.py	345	# ------------------------	COMMENT
MEDIUM	maths/primelib.py	374	# ------------------------	COMMENT
MEDIUM	maths/primelib.py	444	# ----------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	535	# ----------------------------------	COMMENT
MEDIUM	maths/primelib.py	584	# ---------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	648	# ----------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	685	# ----------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	725	# ------------------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	764	# -----------------------------------------------------------------	COMMENT
MEDIUM	maths/primelib.py	797	# -------------------------------------------------------------------	COMMENT
MEDIUM	geometry/ramer_douglas_peucker.py	138	# ---------------------------------------------------------------------------	COMMENT
MEDIUM	geometry/ramer_douglas_peucker.py	146	# ---------------------------------------------------------------------------	COMMENT
MEDIUM	sorts/smoothsort.py	177	# ------------------------------------------------------------------	COMMENT
MEDIUM	sorts/smoothsort.py	179	# ------------------------------------------------------------------	COMMENT
MEDIUM	sorts/smoothsort.py	192	# ------------------------------------------------------------------	COMMENT
MEDIUM	sorts/smoothsort.py	194	# ------------------------------------------------------------------	COMMENT
MEDIUM	quantum/quantum_entanglement.py.DISABLED.txt	21	# q_1: ─────┤ X ├─╫─┤M├	STRING
MEDIUM	quantum/quantum_entanglement.py.DISABLED.txt	23	# c: 2/═══════════╩══╩═	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	24	# ┌─────────────────┐ ┌───┐	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	25	#qr_0: ┤ U(π/2,π/2,π/2) ├───────■──┤ H ├─■─────────	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	26	# └──────┬───┬──────┘ ┌─┴─┐└───┘ │	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	27	#qr_1: ───────┤ H ├─────────■──┤ X ├──────┼───■─────	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	29	#qr_2: ───────────────────┤ X ├───────────■─┤ X ├┤M├	STRING
MEDIUM⚡	quantum/quantum_teleportation.py.DISABLED.txt	31	#cr: 1/═══════════════════════════════════════════╩═	STRING

Verbosity Indicators22 hits · 50 pts

Severity	File	Line	Snippet	Context
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	44	# Step 1: Mark rows and columns that need to be zeroed	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	53	# Step 2: Update the inner matrix cells	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	59	# Step 3: Handle the first row	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	64	# Step 4: Handle the first column	COMMENT
LOW⚡	computer_vision/vision_transformer.py	383	# Step 1: Create patches	COMMENT
LOW⚡	computer_vision/vision_transformer.py	386	# Step 2: Embed patches	COMMENT
LOW⚡	computer_vision/vision_transformer.py	389	# Step 3: Add positional encodings (includes CLS token)	COMMENT
LOW⚡	computer_vision/vision_transformer.py	392	# Step 4: Pass through Transformer encoder layers	COMMENT
LOW⚡	computer_vision/vision_transformer.py	396	# Step 5: Extract CLS token (first token)	COMMENT
LOW⚡	computer_vision/vision_transformer.py	399	# Step 6: Classification head (linear layer)	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	150	# Step 1: Convert Radar polar measurements to Local ENU Cartesian coordinates	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	160	# Step 2: Get absolute ECEF position of the Radar	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	163	# Step 3: Convert the Local ENU offsets to ECEF offsets	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	166	# Step 4: Add offsets to the Radar's ECEF coordinates to find Target ECEF	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	171	# Step 5: Convert Target ECEF back to Geodetic coordinates	COMMENT
LOW⚡	greedy_methods/activity_selection.py	44	# Step 1: Sort the activities by their end time	COMMENT
LOW⚡	greedy_methods/activity_selection.py	47	# Step 2: Select the first activity (the one that finishes the earliest)	COMMENT
LOW⚡	greedy_methods/activity_selection.py	51	# Step 3: Iterate through the sorted activities and select the ones	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	51	# Step 1: Divide the input into sqrt(n) blocks	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	55	# Step 2: Sort each block	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	59	# Step 3: Create a min-heap of the first elements of each block	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	63	# Step 4: Extract elements from the heap and refill from blocks	COMMENT

Structural Annotation Overuse22 hits · 48 pts

Severity	File	Line	Snippet	Context
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	44	# Step 1: Mark rows and columns that need to be zeroed	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	53	# Step 2: Update the inner matrix cells	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	59	# Step 3: Handle the first row	COMMENT
LOW⚡	data_structures/arrays/set_matrix_zeroes.py	64	# Step 4: Handle the first column	COMMENT
LOW⚡	computer_vision/vision_transformer.py	383	# Step 1: Create patches	COMMENT
LOW⚡	computer_vision/vision_transformer.py	386	# Step 2: Embed patches	COMMENT
LOW⚡	computer_vision/vision_transformer.py	389	# Step 3: Add positional encodings (includes CLS token)	COMMENT
LOW⚡	computer_vision/vision_transformer.py	392	# Step 4: Pass through Transformer encoder layers	COMMENT
LOW⚡	computer_vision/vision_transformer.py	396	# Step 5: Extract CLS token (first token)	COMMENT
LOW⚡	computer_vision/vision_transformer.py	399	# Step 6: Classification head (linear layer)	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	150	# Step 1: Convert Radar polar measurements to Local ENU Cartesian coordinates	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	160	# Step 2: Get absolute ECEF position of the Radar	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	163	# Step 3: Convert the Local ENU offsets to ECEF offsets	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	166	# Step 4: Add offsets to the Radar's ECEF coordinates to find Target ECEF	COMMENT
LOW⚡	geodesy/radar_target_calculation.py	171	# Step 5: Convert Target ECEF back to Geodetic coordinates	COMMENT
LOW⚡	greedy_methods/activity_selection.py	44	# Step 1: Sort the activities by their end time	COMMENT
LOW⚡	greedy_methods/activity_selection.py	47	# Step 2: Select the first activity (the one that finishes the earliest)	COMMENT
LOW⚡	greedy_methods/activity_selection.py	51	# Step 3: Iterate through the sorted activities and select the ones	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	51	# Step 1: Divide the input into sqrt(n) blocks	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	55	# Step 2: Sort each block	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	59	# Step 3: Create a min-heap of the first elements of each block	COMMENT
LOW⚡	sorts/kirkpatrick_reisch_sort.py	63	# Step 4: Extract elements from the heap and refill from blocks	COMMENT

Over-Commented Block35 hits · 35 pts

Severity	File	Line	Snippet	Context
LOW	bit_manipulation/xor_swap_two_integers.py	1	# Information on XOR swap: https://en.wikipedia.org/wiki/Bitwise_operation#XOR	COMMENT
LOW	project_euler/problem_054/sol1.py	161	'Tie'	COMMENT
LOW	project_euler/problem_054/sol1.py	281	# Kind Values for internal use:	COMMENT
LOW	project_euler/problem_191/sol1.py	61	# First, check if the combination is already in the cache, and	COMMENT
LOW	genetic_algorithm/basic_string.py	141	while True:	COMMENT
LOW	machine_learning/k_medoids.py	181	raise TypeError("Cluster assignments must be an ndarray")	COMMENT
LOW	backtracking/n_queens_math.py	101	# If row is equal to the size of the board it means there are a queen in each row in	COMMENT
LOW	fractals/mandelbrot.py	141	# uncomment for colored version, different section, zoomed in	COMMENT
LOW	dynamic_programming/optimal_binary_search_tree.py	1	#!/usr/bin/env python3	COMMENT
LOW	.devcontainer/devcontainer.json	1	{	COMMENT
LOW	digital_image_processing/index_calculation.py	41	Wavelength Range 520 nm to 560 nm	COMMENT
LOW	digital_image_processing/index_calculation.py	61	#"CIgreen" -- green, nir	COMMENT
LOW	ciphers/xor_cipher.py	241	from doctest import testmod	COMMENT
LOW	ciphers/xor_cipher.py	261	# print("encrypt successful")	COMMENT
LOW	scripts/close_pull_requests_with_require_type_hints.sh	1	#!/bin/bash	COMMENT
LOW	…/close_pull_requests_with_require_descriptive_names.sh	1	#!/bin/bash	COMMENT
LOW	scripts/close_pull_requests_with_require_tests.sh	1	#!/bin/bash	COMMENT
LOW	scripts/close_pull_requests_with_awaiting_changes.sh	1	#!/bin/bash	COMMENT
LOW	scripts/close_pull_requests_with_label.sh	1	#!/bin/bash	COMMENT
LOW	scripts/close_pull_requests_with_failing_tests.sh	1	#!/bin/bash	COMMENT
LOW	scripts/find_git_conflicts.sh	1	#!/bin/bash	COMMENT
LOW	.github/workflows/ty.yml	21	persist-credentials: false	COMMENT
LOW	.github/workflows/ty.yml	41	# ty see the synced dependencies, so the `[tool.ty.rules]` severities in	COMMENT
LOW	maths/pollard_rho.py	41	# Because of the relationship between ``f(f(x))`` and ``f(x)``, this	COMMENT
LOW	maths/pollard_rho.py	101	# The divisor is a nontrivial factor of ``num``!	COMMENT
LOW	maths/weddles_rule.py	141	# table, h = compute_table(func, a, b, acc)	COMMENT
LOW	maths/entropy.py	121	# "of message cottage windows do besides against uncivil. Delightful "	COMMENT
LOW	graphs/matching_min_vertex_cover.py	61	# graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}	COMMENT
LOW	graphs/dijkstra_algorithm.py	461		COMMENT
LOW	graphs/dijkstra_algorithm.py	481	# Node 8 has distance: 14	COMMENT
LOW	graphs/graph_list.py	101	# if only source vertex is present in adjacency list, add destination vertex	COMMENT
LOW	graphs/graph_list.py	121	self.adj_list[source_vertex] = [destination_vertex]	COMMENT
LOW	graphs/travelling_salesman_problem.py	201		COMMENT
LOW	graphs/graphs_floyd_warshall.py	101		COMMENT
LOW	graphs/graphs_floyd_warshall.py	121		COMMENT

Example Usage Blocks18 hits · 26 pts

Severity	File	Line	Snippet	Context
LOW	data_structures/arrays/reverse_array.py	68	# Example usage:	COMMENT
LOW	computer_vision/vision_transformer.py	413	# Example usage	COMMENT
LOW	machine_learning/ridge_regression.py	149	# Example usage	COMMENT
LOW	dynamic_programming/floyd_warshall.py	66	# Example usage	COMMENT
LOW	neural_network/optimizers/adam_optimizer.py	95	# Usage example	COMMENT
LOW	neural_network/optimizers/momentum_sgd.py	71	# Usage example	COMMENT
LOW	neural_network/optimizers/adagrad.py	71	# Usage example	COMMENT
LOW	neural_network/optimizers/nesterov_accelerated_sgd.py	75	# Usage example	COMMENT
LOW	neural_network/optimizers/muon_optimizer.py	100	# Usage example	COMMENT
LOW	blockchain/simple_proof_of_work.py	53	# Example usage:	COMMENT
LOW	ciphers/vernam_cipher.py	34	# Example usage	COMMENT
LOW	scripts/close_pull_requests_with_label.sh	6	# Usage:	COMMENT
LOW	scripts/find_git_conflicts.sh	13	# Usage:	COMMENT
LOW	maths/sieve_of_atkin.py	108	# Example usage	COMMENT
LOW	maths/spearman_rank_correlation_coefficient.py	97	# Example usage:	COMMENT
LOW	maths/ncr_combinations.py	71	# Example usage	COMMENT
LOW	geometry/graham_scan.py	230	# Example usage	COMMENT
LOW	geometry/jarvis_march.py	184	# Example usage	COMMENT

Empty Error Handlers5 hits · 25 pts

Severity	File	Line	Snippet	Context
HIGH	machine_learning/dimensionality_reduction.py	397	except ValueError:	CODE
HIGH	machine_learning/dimensionality_reduction.py	404	except ValueError:	CODE
HIGH	scripts/pr_file_map.py	116	except ValueError:	CODE
HIGH	cellular_automata/game_of_life.py	203	except KeyboardInterrupt:	CODE
HIGH	web_programming/emails_from_url.py	105	except ValueError:	CODE

Modern Structural Boilerplate23 hits · 24 pts

Severity	File	Line	Snippet	Context
LOW⚡	data_structures/binary_tree/avl_tree.py	62	def set_data(self, data: Any) -> None:	CODE
LOW⚡	data_structures/binary_tree/avl_tree.py	65	def set_left(self, node: MyNode \| None) -> None:	CODE
LOW⚡	data_structures/binary_tree/avl_tree.py	68	def set_right(self, node: MyNode \| None) -> None:	CODE
LOW⚡	data_structures/binary_tree/avl_tree.py	71	def set_height(self, height: int) -> None:	CODE
LOW	data_structures/binary_tree/segment_tree_other.py	176	def _update_tree(self, node, i, val) -> None:	CODE
LOW	data_structures/linked_list/doubly_linked_list_two.py	77	def set_head(self, node: Node) -> None:	CODE
LOW	data_structures/linked_list/doubly_linked_list_two.py	84	def set_tail(self, node: Node) -> None:	CODE
LOW	data_structures/hashing/hash_table.py	133	def _set_value(self, key, data) -> None:	CODE
LOW	data_structures/hashing/hash_table_with_linked_list.py	10	def _set_value(self, key, data) -> None:	CODE
LOW	data_structures/heap/heap_generic.py	79	def update_item(self, item: int, item_value: int) -> None:	CODE
LOW	data_structures/arrays/set_matrix_zeroes.py	29	def set_matrix_zeroes(matrix: list[list[int]]) -> None:	CODE
LOW	strings/aho_corasick.py	42	def set_fail_transitions(self) -> None:	CODE
LOW	machine_learning/frequent_pattern_growth.py	128	def update_tree(items: list, in_tree: TreeNode, header_table: dict, count: int) -> None:	CODE
LOW	fractals/vicsek.py	53	def set_color(rgb: str) -> None:	CODE
LOW	graphs/minimum_spanning_tree_prims.py	12	def set_position(self, vertex, pos) -> None:	CODE
LOW	graphs/boruvka.py	61	def set_component(self, u_node: int) -> None:	CODE
LOW	graphs/minimum_spanning_tree_prims2.py	120	def update_key(self, elem: T, weight: int) -> None:	CODE
LOW	graphs/edmonds_karp_multiple_source_and_sink.py	56	def set_maximum_flow_algorithm(self, algorithm) -> None:	CODE
LOW	cellular_automata/wa_tor.py	132	def set_planet(self, planet: list[list[Entity \| None]]) -> None:	CODE
LOW	physics/n_body_simulation.py	86	def update_position(self, delta_time: float) -> None:	CODE
LOW	physics/n_body_simulation.py	136	def update_system(self, delta_time: float) -> None:	CODE
LOW	matrix/similar_matrices.py	40	__all__ = ["are_similar_matrices"]	CODE
LOW	audio_filters/iir_filter.py	39	def set_coefficients(self, a_coeffs: list[float], b_coeffs: list[float]) -> None:	STRING

Excessive Try-Catch Wrapping8 hits · 10 pts

Severity	File	Line	Snippet	Context
LOW	data_structures/hashing/tests/test_hash_map.py	23	except Exception as e:	CODE
MEDIUM	data_structures/hashing/tests/test_hash_map.py	20	def _run_operation(obj, fun, *args):	CODE
LOW	hashes/enigma_machine.py	71	except Exception as error:	CODE
MEDIUM	machine_learning/decision_tree.py	41	print("Error: Input labels must be one dimensional")	CODE
LOW	maths/bearing.py	51	except Exception as exc:	CODE
MEDIUM	maths/perfect_number.py	301	print(f"Error: {e}")	CODE
LOW	maths/shoelace_area.py	56	except Exception as exc:	CODE
LOW	physics/newtons_second_law_of_motion.py	77	except Exception:	STRING

Hallucination Indicators1 hit · 10 pts

Severity	File	Line	Snippet	Context
CRITICAL	file_transfer/tests/test_send_file.py	26	file.return_value.__enter__.return_value.read.assert_called()	CODE

AI Response Leakage1 hit · 8 pts

Severity	File	Line	Snippet	Context
HIGH	ciphers/elgamal_key_generator.py	11	# I have written my code naively same as definition of primitive root	COMMENT

AI Slop Vocabulary4 hits · 6 pts

Severity	File	Line	Snippet	Context
MEDIUM	data_structures/stacks/stack.py	17	"""A stack is an abstract data type that serves as a collection of	STRING
LOW	data_structures/arrays/merge_sorted.py	48	# If one array is empty, simply return the other.	COMMENT
LOW	strings/text_justification.py	62	# just add the last word to the sentence	COMMENT
LOW	ciphers/mono_alphabetic_ciphers.py	26	# symbol is not in LETTERS, just add it	COMMENT

AI Structural Patterns4 hits · 4 pts

Severity	File	Line	Context
LOW	searches/simulated_annealing.py	9	CODE
LOW	project_euler/problem_020/sol1.py	50	CODE
LOW	computer_vision/vision_transformer.py	284	CODE
LOW	physics/grahams_law.py	39	CODE

Overly Generic Function Names2 hits · 2 pts

Severity	File	Line	Snippet	Context
LOW	searches/hill_climbing.py	35	>>> def test_function(x, y):	STRING
LOW	graphs/multi_heuristic_astar.py	81	def do_something(back_pointer, goal, start) -> None:	CODE

Fake / Example Data1 hit · 0 pts

Severity	File	Line	Snippet	Context
LOW	hashes/elf.py	5	>>> elf_hash('lorem ipsum')	STRING

Maintenance and Governance Review

Risk Review · v3

What These Metrics Mean

Pattern-Signal History

Severity Breakdown

Directory Score Breakdown

Pattern Findings