>>> Polygon().add_side(Side(5)) Polygon(sides=[Side(length=5, angle=Angle(degrees=90), next_side=None)])

Return every anagram of the given word from the dictionary. >>> anagram('test') ['sett', 'stet', 'test'] >>> anagram('this is a test

Returns value by comparing with entered `to_guess` number

An implementation of the Monte Carlo method to find area under a single variable non-negative real-valued continuous function, say

Assigns ranks to elements in the array. :param data: List of floats. :return: List of ints representing the ranks. Example: >>>

Use a stack to check if a string of parentheses is balanced. >>> balanced_parentheses("([]{})") True >>> balanced_parentheses("[()]{}{[()(

>>> bead_sort([6, 11, 12, 4, 1, 5]) [1, 4, 5, 6, 11, 12] >>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1]) [1, 2, 3, 4, 5, 6, 7, 8, 9]

Benchmark the Levenshtein distance function. :param str: The name of the function being benchmarked. :param func: The function to be benc

Locates the first element in a sorted array that is larger or equal to a given value. It has the same interface as https://docs.pyth

>>> bisection(-2, 5) 3.1611328125 >>> bisection(0, 6) 3.158203125 >>> bisection(2, 3) Traceback (most recent call last):

It recursively sorts a bitonic sequence in ascending order, if direction = 1, and in descending if direction = 0. The sequence to be sort

A breadth first search traversal with defaultdict ds to append the values of tree from top view

build max heap from an unsorted array >>> h = Heap() >>> h.build_max_heap([20,40,50,20,10]) >>> h [50, 40, 2

Calculates hypothesis value for a given example :param data_set: test data or train_data :param example_no: example whose hypothesis valu

Returns prime numbers below max_number. See: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes >>> calculate_prime_numbers(10) [2,

A Palindrome is a String that reads the same forward as it does backwards. Examples of Palindromes mom, dad, malayalam >>> can_string_be_

We can find Catalan number many ways but here we use Binomial Coefficient because it does the job in O(n) return the Catalan number of n

The function generates the chain of numbers until the next number is 1 or 89. For example, if starting number is 44, then the function genera

Calculate the binomial coefficient c(n,r) using the multiplicative formula. >>> choose(4,2) 6 >>> choose(5,3) 10 >>> choose(2

Returns integral of circle bottom arc y = 1 / 2 - sqrt(1 / 4 - (x - 1 / 2) ^ 2) >>> circle_bottom_arc_integral(0) 0.39269908169872414

returns the cofactor (signed minor) along (x, y)

>>> column_based_sort([(5, 1), (4, 2), (3, 0)], 1) [(3, 0), (5, 1), (4, 2)]

Reads source file, compresses it and writes the compressed result in destination file

Compress the given string text using LZ77 compression algorithm. Args: text: string to be compressed Returns:

Returns the list of truncated primes >>> compute_truncated_primes(11) [23, 37, 53, 73, 313, 317, 373, 797, 3137, 3797, 739397]

Converts small, non-negative integers with irregular constructions in English (i.e., numbers under 100) into words. >>> convert_small_nu

Pure implementation of counting sort algorithm in Python :param collection: some mutable ordered collection with heterogeneous comparable item

Create Frequent Pattern tree Args: data_set: A list of transactions, where each transaction is a list of items. min_sup: The

Pass two points to get the vector from them in the form (x, y, z). >>> create_vector((0, 0, 0), (1, 1, 1)) (1, 1, 1) >>> create_vect

>>> cycle_sort([4, 3, 2, 1]) [1, 2, 3, 4] >>> cycle_sort([-4, 20, 0, -50, 100, -1]) [-50, -4, -1, 0, 20, 100] >>> cycle_sort([-

Decrease the key value for a given tuple, assuming the new_d is at most old_d. Examples: >>> priority_queue_test = PriorityQ

decrypt ======= Decodes a given string of cipher-text and returns the decoded plain-text Parameters: ----------- * `inpu

Decrypt a given `ciphertext` (string) and `key` (string), returning the decrypted ciphertext. >>> decrypt("jsqqs avvwo", "coffee") '

Deletes a word from the tree if it exists Args: word (str): word to be deleted Returns: bool: True if the wo

Delete and return the data of the node at the front of the Circular Linked List. Raises: IndexError: If the list is empty

Delete and return the data of the node at the end of the Circular Linked List. Returns: Any: The data of the deleted node

https://en.wikipedia.org/wiki/ROT13 >>> msg = "My secret bank account number is 173-52946 so don't tell anyone!!" >>> s = dencrypt(msg)

>>> root = Node(1) >>> root.depth() 1 >>> root.left = Node(2) >>> root.depth() 2 >>> root.lef

A depth first search preorder traversal to append the values at right side of tree.

returns the determinant of an nxn matrix using Laplace expansion

Calculate the distance between two coordinate points >>> distance([0, 0], [3, 4] ) 5.0 >>> distance([0, 0], [-3, 4] ) 5.0 >>>

>>> encrypt('marvin', 'jessica') 'QRACRWU'

encrypt ======= Encodes a given string with the caesar cipher and returns the encoded message Parameters: -----------

The only difference with real-world enigma is that ``I`` allowed string input. All characters are converted to uppercase. (non-letter symbol

Calculates euclidean distance between two data. :param input_a: ndarray of first vector. :param input_b: ndarray of second vector. :r

>>> euclidean_distance_sqr([1,2],[2,4]) 5

Evaluate a given expression in prefix notation. Asserts that the given expression is valid. >>> evaluate("+ 9 * 2 6") 21 >>> eva

Evaluates the clause with the assignments in model. This has the following steps: 1. Return ``True`` if both a literal and

>>> extended_euclid(10, 6) (-1, 2) >>> extended_euclid(7, 5) (-2, 3)

get and remove max from heap >>> h = Heap() >>> h.build_max_heap([20,40,50,20,10]) >>> h.extract_max() 50

May raise json.decoder.JSONDecodeError

>>> factors(12) [1, 2, 3, 4, 6] >>> factors(1) [1] >>> factors(100) [1, 2, 4, 5, 10, 20, 25, 50] # >>> factors(-12)

The information moves in only one direction i.e. forward from the input nodes, through the two hidden nodes and to the output nodes.

Fetch GitHub info of a user using the httpx module

Calculates the i-th (0-indexed) Fibonacci number using recursion >>> fib_recursive_term(0) 0 >>> fib_recursive_term(1

Calls all the other methods to process the input. Pads the data, then splits into blocks and then does a series of operations for eac

Return circular primes below limit. >>> len(find_circular_primes(100)) 13 >>> len(find_circular_primes(1000000)) 55

Propagates a new component throughout a given component.

This is the implementation of the median. :param nums: The list of numeric nums :return: Median of the list >>> find_median(nums=([1,

Return a Python Standard Library set that contains i.

Convert a frequency in Hertz to the mel scale. Args: freq: The frequency in Hertz. Returns: The frequency in mel scale.

Generates all possible combinations of k numbers out of 1 ... n using backtracking. >>> generate_all_combinations(n=4, k=2) [[1, 2], [1,

Returna all edges in the graph

Calculates the new index we should go to if we fail a comparison :param pattern: :return:

>>> Burkes.get_greyscale(3, 4, 5) 4.185 >>> Burkes.get_greyscale(0, 0, 0) 0.0 >>> Burkes.get_greyscale(255, 2

Returns the largest element in this tree. This method is guaranteed to run in O(log(n)) time.

Returns a list of coordinates of neighbors adjacent to the current coordinates. Neighbors: | 0 | 1 | 2 | | 3 | _ | 4

Returns a list of nodes value from a particular level: Left to right direction of the binary tree. >>> list(get_nodes_from_left_to_rig

Given an 'isbn/0140328726', return book data from Open Library as a Python dict. Given an '/authors/OL34184A', return authors data as a Pytho

Find the Parent of a given set >>> A = DisjointSet([1, 1, 1]) >>> A.merge(1, 2) True >>> A.get_parent(0)

heap helper function get the position of the parent of the current node >>> get_parent_position(1) 0 >>> get_parent_position(2)

Returns the hash key of matrix indexes. >>> get_point_key(10, 20, 1, 0) 200

Get previous index in O(1)

Compute the winning vector by Euclidean distance >>> SelfOrganizingMap().get_winner([[1, 2, 3], [4, 5, 6]], [1, 2, 3]) 1