Convert grid into a dict of {square: char} with '0' or '.' for empties.

:param unsorted: unsorted list containing integers numbers :param index: index :param heap_size: size of the heap :return: None >

>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12] >>> heapify(array, len(array) // 2, len(array))

Returns nth hexagonal number >>> hexagonal_num(143) 40755 >>> hexagonal_num(21) 861 >>> hexagonal_num(10) 190

:param len: max number of elements :type len: int :return: Hexagonal numbers as a list Tests: >>> hexagonal_numbers(10)

r""" Returns the horizontal distance that the object cover Formula: .. math:: \frac{v_0^2 \cdot \sin(2 \alpha)}{g}

Insert the value into the heap. >>> sh = SkewHeap() >>> sh.insert(3) >>> sh.insert(1) >>> sh.insert(3)

insert_data is used for inserting a single element at a time in the HashTable. Examples: >>> ht = HashTable(3) >>>

Insert many words in the tree Args: words (list[str]): list of words >>> RadixNode("myprefix").insert_many(["mystring",

>>> invert_modulo(2, 5) 3 >>> invert_modulo(8,7) 1

Checks whether n is a 9-digit 1 to 9 pandigital number. >>> is_9_pandigital(12345) False >>> is_9_pandigital(156284973) True

>>> queue = LinkedQueue() >>> queue.is_empty() True >>> for i in range(1, 6): ... queue.put(i) >>

Checks whether the queue is empty or not >>> cq = CircularQueueLinkedList() >>> cq.is_empty() True >>> cq.enq

Check if linked list is empty. >>> linked_list = LinkedList() >>> linked_list.is_empty() True >>> linked_list

>>> S = Stack() >>> S.is_full() False >>> S = Stack(1) >>> S.push(10) >>> S.is_full() True

Checks if a matrix is Hermitian. >>> import numpy as np >>> A = np.array([ ... [2, 2+1j, 4], ... [2-1j, 3, 1j], ... [4,

Perform Luhn validation on an input string Algorithm: * Double every other digit starting from 2nd last digit. * Subtract 9 if number

Return True if the given char c is an operand, e.g. it is a number >>> is_operand("1") True >>> is_operand("+") False

Return True if s is a palindrome otherwise return False. >>> all(is_palindrome(key) == value for key, value in test_data.items()) True

Return true if the input n is a palindrome. Otherwise return false. n can be an integer or a string. >>> is_palindrome(909) True

Returns True if n is pentagonal, False otherwise. >>> is_pentagonal(330) True >>> is_pentagonal(7683) False >>> is_pent

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. >>> is_prime(0) False

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. >>> is_prime(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. Returns boolean representin

For 2 <= n <= 1000000, return True if n is prime. >>> is_prime(87) False >>> is_prime(23) True >>> is_prime(25363)

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. Returns boolean representin

>>> is_square([]) True >>> is_square(matrix_1_to_4) True >>> is_square(matrix_5_to_9_high) False

Compute all-pairs shortest paths using Johnson's algorithm. Reference: https://en.wikipedia.org/wiki/Johnson%27s_algorithm Args

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

Return the pair of numbers that represents the given letter in the polybius square >>> np.array_equal(BifidCipher().letter_t

Perform linear search in list. Returns -1 if element is not found. Parameters ---------- left : int left index bound. right :

r""" A A Br / \ / \ / \ B C LR Br C RR

>>> lucas_lehmer_test(p=7) True >>> lucas_lehmer_test(p=11) False # M_11 = 2^11 - 1 = 2047 = 23 * 89

>>> make_table_row(("One", "Two", "Three")) '| One | Two | Three |'

Find the minimum number of multiplcations required to multiply the chain of matrices Args: `arr`: The input array of integers.

Source: https://en.wikipedia.org/wiki/Matrix_chain_multiplication The dynamic programming solution is faster than cached the recursive solut

r""" Returns the maximum height that the object reach Formula: .. math:: \frac{v_0^2 \cdot \sin^2 (\alpha)}{2 g}

Create a list of Task objects that are sorted so the highest rewards come first. Return a list of those task ids that can be completed before

Markdown prefix based on indent for bullet points >>> md_prefix(0) '\\n##' >>> md_prefix(1) ' *' >>> md_prefix(2) '

:param gray_img: gray image :param mask: mask size :return: image with median filter

sorting left-half and right-half individually then merging them into result

Merge 2 nodes together. >>> SkewNode.merge(SkewNode(10),SkewNode(-10.5)).value -10.5 >>> SkewNode.merge(SkewNode(10),

Merge 2 nodes together. >>> rhn1 = RandomizedHeapNode(10) >>> rhn2 = RandomizedHeapNode(20) >>> RandomizedHeapNode.m

In-place merge of two binomial trees of equal size. Returns the root of the resulting tree

returns the minor along (x, y)

Attempts to move to an unoccupied neighbouring square in either of the four directions (North, South, East, West). If the mov

>>> multiply([[1,2],[3,4]],[[5,5],[7,5]]) [[19, 15], [43, 35]] >>> multiply([[1,2.5],[3,4.5]],[[5,5],[7,5]]) [[22.5, 17.5], [46.5, 37

Mutate a random gene of a child with another one from the list. >>> random.seed(123) >>> mutate("123456", list("ABCDEF")) '12345A'

>>> naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC") [4, 10, 18] >>> naive_pattern_search("ABC", "ABAAABCDBBABCDDEBCABC") []

Return the letter corresponding to the position [index1, index2] in the polybius square >>> BifidCipher().numbers_to_letter(

:param data_set: test data or train data :param example_no: example whose output is to be fetched :return: output for that example

Convert grid to a dict of possible values, {square: digits}, or return False if a contradiction is detected.

>>> partition(5) 7 >>> partition(7) 15 >>> partition(100) 190569292 >>> partition(1_000) 2406146786403262247369214972

Compute the piglatin of a given string. https://en.wikipedia.org/wiki/Pig_Latin Usage examples: >>> pig_latin("pig") 'igpay'

We cannot get the optimal w of our kernel SVM model, which is different from a linear SVM. For this reason, we generate randomly distributed

Pop the root element

pop the top element off the stack

Return integer value representing an operator's precedence, or order of operation. https://en.wikipedia.org/wiki/Order_of_operations

Make predictions on input data. Parameters: - features (np.ndarray): The input data for making predictions. Returns

Prefix sum of all elements in [0, right) in O(lg N) Parameters: right (int): right bound of the query (exclusive)

>>> price_plus_tax(100, 0.25) 125.0 >>> price_plus_tax(125.50, 0.05) 131.775

Returns prime factors of n as a list. >>> prime_factors(0) [] >>> prime_factors(100) [2, 2, 5, 5] >>> prime_factors(2560)

Print the entire linked list iteratively. This function prints the elements of a linked list separated by '->'. Parameters:

A function to print the solution in the form of a 9x9 grid

Calculate y[n] >>> issubclass(FilterType, Protocol) True

>>> hill_cipher = HillCipher(np.array([[2, 5], [1, 6]])) >>> hill_cipher.process_text('Testing Hill Cipher') 'TESTINGHILLCIPH

Returns the number of occurrences of num in interval [0, index] in the list >>> root = build_tree(test_array) >>> rank_till_index(root,

Returns the Rayleigh quotient of a Hermitian matrix A and vector v. >>> import numpy as np >>> A = np.array([ ... [1, 2, 4],

>>> remove_non_letters("Hi! how are you?") 'Hi how are you' >>> remove_non_letters("P^y%t)h@o*n") 'Python' >>> remove_non_letters

>>> hill_cipher = HillCipher(np.array([[2, 5], [1, 6]])) >>> hill_cipher.replace_digits(19) 'T' >>> hill_cipher.repla

>>> hill_cipher = HillCipher(np.array([[2, 5], [1, 6]])) >>> hill_cipher.replace_letters('T') 19 >>> hill_cipher.repl

Reduces large number to a more manageable number >>> res(5, 7) 4.892790030352132 >>> res(0, 5) 0 >>> res(3, 0) 1 >>>

Returns the index of right child Examples: >>> priority_queue_test = PriorityQueue() >>> priority_queue_test.right(0

Ratio-Vegetation-Index http://www.seos-project.eu/modules/remotesensing/remotesensing-c03-s01-p01.html :return: index