repo_id stringclasses 409
values | prefix large_stringlengths 34 36.3k | target large_stringlengths 1 498 | assertion_type stringclasses 31
values | difficulty stringclasses 8
values | test_file stringlengths 10 121 | test_function stringlengths 1 104 | test_class stringlengths 0 51 | lineno int32 2 11.3k | commit_idx int32 |
|---|---|---|---|---|---|---|---|---|---|
keon/algorithms | import unittest
from algorithms.stack import (
ArrayStack,
LinkedListStack,
OrderedStack,
first_is_consecutive,
first_stutter,
first_switch_pairs,
is_sorted,
is_valid,
remove_min,
second_is_consecutive,
second_stutter,
second_switch_pairs,
simplify_path,
)
class Tes... | stack.is_empty()) | self.assertTrue | func_call | tests/test_stack.py | test_ordered_stack | TestOrderedStack | 146 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.common.tree_node import TreeNode
from algorithms.data_structures import SqrtDecomposition
from algorithms.graph.dijkstra_heapq import dijkstra
from algorithms.math.goldbach import goldbach, verify_goldbach
from algorithms.tree.binary_tree_views import... | 8) | self.assertEqual | numeric_literal | tests/test_issue_fixes.py | test_shortest_path | TestDijkstraHeapq | 36 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | self.p4) | self.assertEqual | complex_expr | tests/test_polynomial.py | test_polynomial_clone | TestSuite | 143 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.backtracking.minimax import minimax
from algorithms.bit_manipulation.gray_code import gray_code, gray_to_binary
from algorithms.data_structures.kd_tree import KDTree
from algorithms.dynamic_programming.bitmask import tsp
from algorithms.dynamic_progra... | 0) | self.assertEqual | numeric_literal | tests/test_community_algorithms.py | test_first_element | TestExponentialSearch | 129 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[-4]]) | self.assertEqual | collection | tests/test_matrix.py | test_inversion | TestInversion | 194 | null |
keon/algorithms | import unittest
from algorithms.map import (
HashTable,
ResizableHashTable,
SeparateChainingHashTable,
is_anagram,
is_isomorphic,
longest_palindromic_subsequence,
word_pattern,
)
class TestHashTable(unittest.TestCase):
def test_one_entry(self):
m = HashTable(10)
m.put(1... | m.get(1)) | self.assertEqual | func_call | tests/test_map.py | test_one_entry | TestHashTable | 18 | null |
keon/algorithms | import unittest
from algorithms.data_structures.veb_tree import VEBTree
class TestVEBTree(unittest.TestCase):
def setUp(self):
self.veb = VEBTree(16)
def test_insert_and_member(self):
values = [2, 3, 4, 7, 14]
for v in values:
self.veb.insert(v)
for v in values:
... | self.veb.member(v)) | self.assertTrue | func_call | tests/test_veb_tree.py | test_insert_and_member | TestVEBTree | 16 | null |
keon/algorithms | import unittest
from algorithms.dynamic_programming import (
Item,
Job,
climb_stairs,
climb_stairs_optimized,
combination_sum_bottom_up,
combination_sum_topdown,
count,
edit_distance,
egg_drop,
fib_iter,
fib_list,
fib_recursive,
find_k_factor,
get_maximum_value,
... | 4) | self.assertEqual | numeric_literal | tests/test_dynamic_programming.py | test_count | TestCoinChange | 52 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[14], [7]]) | self.assertEqual | collection | tests/test_matrix.py | test_multiply | TestMultiply | 248 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | {1, 3}) | self.assertEqual | collection | tests/test_polynomial.py | test_polynomial_variables | TestSuite | 109 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | int_to_roman(3999)) | self.assertEqual | func_call | tests/test_string.py | test_int_to_roman | TestIntToRoman | 200 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[-2]]) | self.assertEqual | collection | tests/test_matrix.py | test_inversion | TestInversion | 188 | null |
keon/algorithms | import unittest
from algorithms.searching import (
binary_search,
binary_search_recur,
find_min_rotate,
find_min_rotate_recur,
first_occurrence,
interpolation_search,
jump_search,
last_occurrence,
linear_search,
next_greatest_letter,
next_greatest_letter_v1,
next_greates... | two_sum(array, 22)) | self.assertEqual | func_call | tests/test_searching.py | test_two_sum | TestSuite | 87 | null |
keon/algorithms | import unittest
import pytest
from algorithms.math import (
base_to_int,
chinese_remainder_theorem,
combination,
combination_memo,
cosine_similarity,
decimal_to_binary_ip,
decrypt,
diffie_hellman_key_exchange,
encrypt,
euler_totient,
extended_gcd,
factorial,
factori... | Exception) | self.assertRaises | variable | tests/test_math.py | test_exception_non_coprime | TestChineseRemainderSolver | 573 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | maze_search(grid_1)) | self.assertEqual | func_call | tests/test_graph.py | test_maze_search | TestMazeSearchBfs | 431 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | int_to_roman(644)) | self.assertEqual | func_call | tests/test_string.py | test_int_to_roman | TestIntToRoman | 198 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | result.next.label) | self.assertEqual | complex_expr | tests/test_linked_list.py | _assert_is_a_copy | TestSuite | 198 | null |
keon/algorithms | import unittest
from algorithms.stack import (
ArrayStack,
LinkedListStack,
OrderedStack,
first_is_consecutive,
first_stutter,
first_switch_pairs,
is_sorted,
is_valid,
remove_min,
second_is_consecutive,
second_stutter,
second_switch_pairs,
simplify_path,
)
class Tes... | is_valid("(}")) | self.assertFalse | func_call | tests/test_stack.py | test_is_valid_parenthesis | TestSuite | 69 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | [4, 2, 5, 1, 6, 3, 7]) | self.assertEqual | collection | tests/test_tree.py | test_construct_tree | TestConstructTreePreorderPostorder | 127 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | is_cyclic(head)) | self.assertTrue | func_call | tests/test_linked_list.py | test_is_cyclic | TestSuite | 139 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[7, 4, 1], [8, 5, 2], [9, 6, 3]]) | self.assertEqual | collection | tests/test_matrix.py | test_copy_transform | TestCopyTransform | 50 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.common.tree_node import TreeNode
from algorithms.data_structures import SqrtDecomposition
from algorithms.graph.dijkstra_heapq import dijkstra
from algorithms.math.goldbach import goldbach, verify_goldbach
from algorithms.tree.binary_tree_views import... | []) | self.assertEqual | collection | tests/test_issue_fixes.py | test_unreachable_target | TestDijkstraHeapq | 53 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[3, 6, 9], [2, 5, 8], [1, 4, 7]]) | self.assertEqual | collection | tests/test_matrix.py | test_copy_transform | TestCopyTransform | 55 | null |
keon/algorithms | import unittest
from algorithms.backtracking import (
add_operators,
anagram,
array_sum_combinations,
combination_sum,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthesis_v2,
get_factors,
letter_combinations,
palindromic_substrings,
pattern_... | answer2) | self.assertEqual | variable | tests/test_backtracking.py | test_combination_sum | TestCombinationSum | 125 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | is_power_of_two(1)) | self.assertTrue | func_call | tests/test_bit_manipulation.py | test_is_power_of_two | TestSuite | 121 | null |
keon/algorithms | import unittest
from algorithms.heap import BinaryHeap, get_skyline, k_closest, max_sliding_window
class TestSuite(unittest.TestCase):
def test_max_sliding_window(self):
nums = [1, 3, -1, -3, 5, 3, 6, 7]
self.assertEqual([3, 3, 5, 5, 6, 7], | max_sliding_window(nums, 3)) | self.assertEqual | func_call | tests/test_heap.py | test_max_sliding_window | TestSuite | 46 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.common.tree_node import TreeNode
from algorithms.data_structures import SqrtDecomposition
from algorithms.graph.dijkstra_heapq import dijkstra
from algorithms.math.goldbach import goldbach, verify_goldbach
from algorithms.tree.binary_tree_views import... | 0) | self.assertEqual | numeric_literal | tests/test_issue_fixes.py | test_same_source_and_target | TestDijkstraHeapq | 41 | null |
keon/algorithms | import unittest
from algorithms.backtracking import (
add_operators,
anagram,
array_sum_combinations,
combination_sum,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthesis_v2,
get_factors,
letter_combinations,
palindromic_substrings,
pattern_... | permute("abc")) | self.assertEqual | func_call | tests/test_backtracking.py | test_permute | TestPermuteAndAnagram | 61 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | btree.find(key)) | self.assertFalse | func_call | tests/test_tree.py | test_deletion_even_degree | TestBTree | 89 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | is_palindrome(self.l1)) | self.assertFalse | func_call | tests/test_linked_list.py | test_is_palindrome | TestSuite | 174 | null |
keon/algorithms | import unittest
from algorithms.searching import (
binary_search,
binary_search_recur,
find_min_rotate,
find_min_rotate_recur,
first_occurrence,
interpolation_search,
jump_search,
last_occurrence,
linear_search,
next_greatest_letter,
next_greatest_letter_v1,
next_greates... | helper(array, 5)) | self.assertEqual | func_call | tests/test_searching.py | test_first_occurrence | TestSuite | 36 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[-3]]) | self.assertEqual | collection | tests/test_matrix.py | test_inversion | TestInversion | 191 | null |
keon/algorithms | import unittest
from algorithms.compression.elias import elias_delta, elias_gamma
from algorithms.compression.huffman_coding import HuffmanCoding
from algorithms.compression.rle_compression import decode_rle, encode_rle
class TestHuffmanCoding(unittest.TestCase):
def setUpClass(cls):
cls.file_in_name = "... | content_2) | self.assertEqual | variable | tests/test_compression.py | test_huffman_coding | TestHuffmanCoding | 34 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | 2) | self.assertEqual | numeric_literal | tests/test_graph.py | test_kosaraju_algorithm | TestStronglyConnectedComponentsKosaraju | 394 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | inorder(tree)) | self.assertEqual | func_call | tests/test_tree.py | test_inorder | TestTraversal | 31 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | convert(swap_pairs(head))) | self.assertEqual | func_call | tests/test_linked_list.py | test_swap_in_pairs | TestSuite | 114 | null |
keon/algorithms | import unittest
from algorithms.array import (
Interval,
delete_nth,
delete_nth_naive,
flatten,
flatten_iter,
garage,
get_longest_non_repeat_v1,
get_longest_non_repeat_v2,
josephus,
limit,
longest_non_repeat_v1,
longest_non_repeat_v2,
max_ones_index,
merge_interv... | 1) | self.assertEqual | numeric_literal | tests/test_array.py | test_flatten_iter | TestFlatten | 109 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | is_palindrome(self.l)) | self.assertTrue | func_call | tests/test_linked_list.py | test_is_palindrome | TestSuite | 173 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.common.tree_node import TreeNode
from algorithms.data_structures import SqrtDecomposition
from algorithms.graph.dijkstra_heapq import dijkstra
from algorithms.math.goldbach import goldbach, verify_goldbach
from algorithms.tree.binary_tree_views import... | 3) | self.assertEqual | numeric_literal | tests/test_issue_fixes.py | test_triangle | TestDijkstraHeapq | 64 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | Polynomial([])) | self.assertEqual | func_call | tests/test_polynomial.py | test_polynomial_subtraction | TestSuite | 82 | null |
keon/algorithms | import unittest
from algorithms.searching import (
binary_search,
binary_search_recur,
find_min_rotate,
find_min_rotate_recur,
first_occurrence,
interpolation_search,
jump_search,
last_occurrence,
linear_search,
next_greatest_letter,
next_greatest_letter_v1,
next_greates... | helper(array, 6)) | self.assertEqual | func_call | tests/test_searching.py | test_first_occurrence | TestSuite | 37 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | roman_to_int("I")) | self.assertEqual | func_call | tests/test_string.py | test_roman_to_int | TestRomanToInt | 424 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | postorder_rec(tree)) | self.assertEqual | func_call | tests/test_tree.py | test_postorder | TestTraversal | 27 | null |
keon/algorithms | import unittest
from algorithms.data_structures.veb_tree import VEBTree
class TestVEBTree(unittest.TestCase):
def setUp(self):
self.veb = VEBTree(16)
def test_successor(self):
for v in [2, 4, 8, 12]:
self.veb.insert(v)
self.assertEqual(4, | self.veb.successor(2)) | self.assertEqual | func_call | tests/test_veb_tree.py | test_successor | TestVEBTree | 32 | null |
keon/algorithms | import unittest
from algorithms.compression.elias import elias_delta, elias_gamma
from algorithms.compression.huffman_coding import HuffmanCoding
from algorithms.compression.rle_compression import decode_rle, encode_rle
class TestEliasCoding(unittest.TestCase):
def test_elias_gamma(self):
correct_result =... | result) | self.assertEqual | variable | tests/test_compression.py | test_elias_gamma | TestEliasCoding | 80 | null |
keon/algorithms | import unittest
from algorithms.dynamic_programming import (
Item,
Job,
climb_stairs,
climb_stairs_optimized,
combination_sum_bottom_up,
combination_sum_topdown,
count,
edit_distance,
egg_drop,
fib_iter,
fib_list,
fib_recursive,
find_k_factor,
get_maximum_value,
... | 55) | self.assertEqual | numeric_literal | tests/test_dynamic_programming.py | test_fib_recursive | TestFib | 79 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | get_factors(32)) | self.assertEqual | func_call | tests/test_graph.py | test_get_factors | TestAllFactors | 464 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | ft.get_sum(bit_tree, 5)) | self.assertEqual | func_call | tests/test_tree.py | test_construct_tree_with_update_1 | TestFenwickTree | 145 | null |
keon/algorithms | import unittest
from algorithms.queue import (
ArrayQueue,
LinkedListQueue,
PriorityQueue,
max_sliding_window,
reconstruct_queue,
)
class TestSuite(unittest.TestCase):
def test_max_sliding_window(self):
array = [1, 3, -1, -3, 5, 3, 6, 7]
self.assertEqual(max_sliding_window(arra... | [10, 10, 10, 15, 15, 90, 90]) | self.assertEqual | collection | tests/test_queue.py | test_max_sliding_window | TestSuite | 84 | null |
keon/algorithms | import unittest
from bst import bst
def num_empty(root):
if root is None:
return 1
elif root.left is None and root.right:
return 1 + num_empty(root.right)
elif root.right is None and root.left:
return 1 + num_empty(root.left)
else:
return num_empty(root.left) + num_empt... | num_empty(self.tree.root)) | self.assertEqual | func_call | algorithms/tree/bst_num_empty.py | test_num_empty | TestSuite | 68 | null |
keon/algorithms | import unittest
from algorithms.linked_list import (
RandomListNode,
copy_random_pointer_v1,
copy_random_pointer_v2,
is_cyclic,
is_palindrome,
is_palindrome_dict,
is_palindrome_stack,
is_sorted,
merge_two_list,
merge_two_list_recur,
remove_range,
reverse_list,
revers... | is_palindrome_dict(self.l)) | self.assertTrue | func_call | tests/test_linked_list.py | test_is_palindrome_dict | TestSuite | 181 | null |
keon/algorithms | import unittest
from algorithms.queue import (
ArrayQueue,
LinkedListQueue,
PriorityQueue,
max_sliding_window,
reconstruct_queue,
)
class TestPriorityQueue(unittest.TestCase):
def test_priority_queue(self):
queue = PriorityQueue([3, 4, 1, 6])
self.assertEqual(4, queue.size())
... | queue.pop()) | self.assertEqual | func_call | tests/test_queue.py | test_priority_queue | TestPriorityQueue | 103 | null |
keon/algorithms | import unittest
from algorithms.greedy import (
max_contiguous_subsequence_sum,
)
class TestMaxContiguousSubsequenceSum(unittest.TestCase):
def test_max_contiguous_subsequence_sum(self):
arr1 = [-2, 3, 8, -1, 4]
arr2 = [-1, 1, 0]
arr3 = [-1, -3, -4]
arr4 = [-2, 3, 8, -12, 8, 4]... | 1) | self.assertEqual | numeric_literal | tests/test_greedy.py | test_max_contiguous_subsequence_sum | TestMaxContiguousSubsequenceSum | 16 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.m1 = Monomial({})
self.m2 = Monomial({1: 1}, 2)
self.m3 = Monomial({1: 2, 2: -1}, 1.5)
self.m4 = Monomial({1: 1, 2: 2... | 0) | self.assertEqual | numeric_literal | tests/test_monomial.py | test_monomial_substitution | TestSuite | 184 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | [0, 1, 2, 3, 4]) | self.assertCountEqual | collection | tests/test_graph.py | test_no_edges | TestTopologicalSort | 619 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | position[v]) | self.assertLess | complex_expr | tests/test_graph.py | test_simple_dag | TestTopologicalSort | 591 | null |
keon/algorithms | import unittest
from algorithms.stack import (
ArrayStack,
LinkedListStack,
OrderedStack,
first_is_consecutive,
first_stutter,
first_switch_pairs,
is_sorted,
is_valid,
remove_min,
second_is_consecutive,
second_stutter,
second_switch_pairs,
simplify_path,
)
class Tes... | simplify_path(p)) | self.assertEqual | func_call | tests/test_stack.py | test_simplify_path | TestSuite | 73 | null |
keon/algorithms | import unittest
from algorithms.queue import (
ArrayQueue,
LinkedListQueue,
PriorityQueue,
max_sliding_window,
reconstruct_queue,
)
class TestQueue(unittest.TestCase):
def test_array_queue(self):
queue = ArrayQueue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqu... | queue.peek()) | self.assertEqual | func_call | tests/test_queue.py | test_array_queue | TestQueue | 37 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | "github") | self.assertEqual | string_literal | tests/test_string.py | test_valid | TestDomainExtractor | 153 | null |
keon/algorithms | import unittest
from algorithms.heap import BinaryHeap, get_skyline, k_closest, max_sliding_window
class TestBinaryHeap(unittest.TestCase):
def setUp(self):
self.min_heap = BinaryHeap()
self.min_heap.insert(4)
self.min_heap.insert(50)
self.min_heap.insert(7)
self.min_heap.... | self.min_heap.heap) | self.assertEqual | complex_expr | tests/test_heap.py | test_insert | TestBinaryHeap | 24 | null |
keon/algorithms | import unittest
from algorithms.searching import (
binary_search,
binary_search_recur,
find_min_rotate,
find_min_rotate_recur,
first_occurrence,
interpolation_search,
jump_search,
last_occurrence,
linear_search,
next_greatest_letter,
next_greatest_letter_v1,
next_greates... | jump_search(array, 7)) | self.assertEqual | func_call | tests/test_searching.py | test_jump_search | TestSuite | 128 | null |
keon/algorithms | import unittest
import pytest
from algorithms.math import (
base_to_int,
chinese_remainder_theorem,
combination,
combination_memo,
cosine_similarity,
decimal_to_binary_ip,
decrypt,
diffie_hellman_key_exchange,
encrypt,
euler_totient,
extended_gcd,
factorial,
factori... | lcm(8, 12)) | self.assertEqual | func_call | tests/test_math.py | test_lcm | TestGcd | 170 | null |
keon/algorithms | import unittest
from algorithms.searching import (
binary_search,
binary_search_recur,
find_min_rotate,
find_min_rotate_recur,
first_occurrence,
interpolation_search,
jump_search,
last_occurrence,
linear_search,
next_greatest_letter,
next_greatest_letter_v1,
next_greates... | helper(array, 1)) | self.assertEqual | func_call | tests/test_searching.py | test_first_occurrence | TestSuite | 34 | null |
keon/algorithms | import unittest
from algorithms.data_structures.veb_tree import VEBTree
class TestVEBTree(unittest.TestCase):
def setUp(self):
self.veb = VEBTree(16)
def test_successor(self):
for v in [2, 4, 8, 12]:
self.veb.insert(v)
self.assertEqual(4, self.veb.successor(2))
s... | self.veb.successor(4)) | self.assertEqual | func_call | tests/test_veb_tree.py | test_successor | TestVEBTree | 33 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | binary_gap(8)) | self.assertEqual | func_call | tests/test_bit_manipulation.py | test_binary_gap | TestSuite | 289 | null |
keon/algorithms | import unittest
from algorithms.backtracking import (
add_operators,
anagram,
array_sum_combinations,
combination_sum,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthesis_v2,
get_factors,
letter_combinations,
palindromic_substrings,
pattern_... | ["eat"]) | self.assertEqual | collection | tests/test_backtracking.py | test_uneven | TestFindWords | 185 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | TypeError) | self.assertRaises | variable | tests/test_string.py | test_fizzbuzz | TestFizzbuzz | 746 | null |
keon/algorithms | import unittest
import pytest
from algorithms.math import (
base_to_int,
chinese_remainder_theorem,
combination,
combination_memo,
cosine_similarity,
decimal_to_binary_ip,
decrypt,
diffie_hellman_key_exchange,
encrypt,
euler_totient,
extended_gcd,
factorial,
factori... | 1) | self.assertAlmostEqual | numeric_literal | tests/test_math.py | test_cosine_similarity | TestCosineSimilarity | 426 | null |
keon/algorithms | import unittest
from algorithms.stack import (
ArrayStack,
LinkedListStack,
OrderedStack,
first_is_consecutive,
first_stutter,
first_switch_pairs,
is_sorted,
is_valid,
remove_min,
second_is_consecutive,
second_stutter,
second_switch_pairs,
simplify_path,
)
class Tes... | stack.size()) | self.assertEqual | func_call | tests/test_stack.py | test_ordered_stack | TestOrderedStack | 154 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | atbash("PythoN")) | self.assertEqual | func_call | tests/test_string.py | test_atbash_cipher | TestAtbashCipher | 622 | null |
keon/algorithms | import unittest
class TestSuite(unittest.TestCase):
def setUp(self):
self.tree = BST()
self.tree.insert(10)
self.tree.insert(15)
self.tree.insert(6)
self.tree.insert(4)
self.tree.insert(9)
self.tree.insert(12)
self.tree.insert(24)
self.tree.in... | self.tree.size()) | self.assertEqual | func_call | algorithms/data_structures/bst.py | test_size | TestSuite | 144 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | ValueError) | self.assertRaises | variable | tests/test_graph.py | test_cycle_detection | TestTopologicalSort | 625 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | 0) | self.assertEqual | numeric_literal | tests/test_polynomial.py | test_polynomial_subs | TestSuite | 115 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.backtracking.minimax import minimax
from algorithms.bit_manipulation.gray_code import gray_code, gray_to_binary
from algorithms.data_structures.kd_tree import KDTree
from algorithms.dynamic_programming.bitmask import tsp
from algorithms.dynamic_progra... | 2) | self.assertEqual | numeric_literal | tests/test_community_algorithms.py | test_z_array_basic | TestZAlgorithm | 58 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | swap_pair(22)) | self.assertEqual | func_call | tests/test_bit_manipulation.py | test_swap_pair | TestSuite | 229 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | {1, 2, 3}) | self.assertEqual | collection | tests/test_polynomial.py | test_polynomial_variables | TestSuite | 106 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.m1 = Monomial({})
self.m2 = Monomial({1: 1}, 2)
self.m3 = Monomial({1: 2, 2: -1}, 1.5)
self.m4 = Monomial({1: 1, 2: 2... | set()) | self.assertEqual | func_call | tests/test_monomial.py | test_monomial_all_variables | TestSuite | 194 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | get_bit(22, 2)) | self.assertEqual | func_call | tests/test_bit_manipulation.py | test_get_bit | TestSuite | 196 | null |
keon/algorithms | import unittest
from algorithms.matrix import (
bomb_enemy,
cholesky_matrix_decomposition,
copy_transform,
crout_matrix_decomposition,
matrix_exponentiation,
matrix_inversion,
multiply,
rotate_image,
sort_matrix_diagonally,
sparse_dot_vector,
spiral_traversal,
sudoku_val... | [[2, -1], [-1, 1]]) | self.assertEqual | collection | tests/test_matrix.py | test_inversion | TestInversion | 182 | null |
keon/algorithms | import unittest
from algorithms.dynamic_programming import (
Item,
Job,
climb_stairs,
climb_stairs_optimized,
combination_sum_bottom_up,
combination_sum_topdown,
count,
edit_distance,
egg_drop,
fib_iter,
fib_list,
fib_recursive,
find_k_factor,
get_maximum_value,
... | 3) | self.assertEqual | numeric_literal | tests/test_dynamic_programming.py | test_edit_distance | TestEditDistance | 67 | null |
keon/algorithms | import unittest
from algorithms.stack import (
ArrayStack,
LinkedListStack,
OrderedStack,
first_is_consecutive,
first_stutter,
first_switch_pairs,
is_sorted,
is_valid,
remove_min,
second_is_consecutive,
second_stutter,
second_switch_pairs,
simplify_path,
)
class Tes... | is_valid("[]()[]")) | self.assertTrue | func_call | tests/test_stack.py | test_is_valid_parenthesis | TestSuite | 66 | null |
keon/algorithms | import unittest
from algorithms.queue import (
ArrayQueue,
LinkedListQueue,
PriorityQueue,
max_sliding_window,
reconstruct_queue,
)
class TestSuite(unittest.TestCase):
def test_max_sliding_window(self):
array = [1, 3, -1, -3, 5, 3, 6, 7]
self.assertEqual(max_sliding_window(arr... | [5, 5, 6, 7]) | self.assertEqual | collection | tests/test_queue.py | test_max_sliding_window | TestSuite | 79 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | clear_bit(22, 2)) | self.assertEqual | func_call | tests/test_bit_manipulation.py | test_clear_bit | TestSuite | 205 | null |
keon/algorithms | import unittest
from algorithms.string import (
add_binary,
atbash,
bracket,
caesar_cipher,
check_pangram,
contain_string,
convert_morse_word,
count_binary_substring,
decode,
decode_string,
delete_reoccurring_characters,
domain_name_1,
domain_name_2,
encode,
... | int_to_roman(1)) | self.assertEqual | func_call | tests/test_string.py | test_int_to_roman | TestIntToRoman | 199 | null |
keon/algorithms | import unittest
from algorithms.data_structures.veb_tree import VEBTree
class TestVEBTree(unittest.TestCase):
def setUp(self):
self.veb = VEBTree(16)
def test_min_max(self):
self.veb.insert(10)
self.veb.insert(2)
self.veb.insert(15)
self.assertEqual(2, self.veb.minimu... | self.veb.maximum()) | self.assertEqual | func_call | tests/test_veb_tree.py | test_min_max | TestVEBTree | 26 | null |
keon/algorithms | import unittest
import pytest
from algorithms.math import (
base_to_int,
chinese_remainder_theorem,
combination,
combination_memo,
cosine_similarity,
decimal_to_binary_ip,
decrypt,
diffie_hellman_key_exchange,
encrypt,
euler_totient,
extended_gcd,
factorial,
factori... | gcd(8, 12)) | self.assertEqual | func_call | tests/test_math.py | test_gcd | TestGcd | 147 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.m1 = Monomial({})
self.m2 = Monomial({1: 1}, 2)
self.m3 = Monomial({1: 2, 2: -1}, 1.5)
self.m4 = Monomial({1: 1, 2: 2... | {2}) | self.assertEqual | collection | tests/test_monomial.py | test_monomial_all_variables | TestSuite | 193 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial, Polynomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.p0 = Polynomial([Monomial({})])
self.p1 = Polynomial([Monomial({}), Monomial({})])
self.p2 = Polynomial([Monomial... | set()) | self.assertEqual | func_call | tests/test_polynomial.py | test_polynomial_variables | TestSuite | 101 | null |
keon/algorithms | import unittest
from algorithms.graph import (
Sudoku,
Tarjan,
all_pairs_shortest_path,
bellman_ford,
check_bipartite,
check_digraph_strongly_connected,
count_connected_number_of_component,
count_islands,
cycle_detection,
dinic,
edmonds_karp,
find_path,
find_path_dfs... | rooms) | self.assertEqual | variable | tests/test_graph.py | test_walls_and_gates | TestWallsAndGates | 533 | null |
keon/algorithms | import unittest
from algorithms.data_structures.b_tree import BTree
from algorithms.data_structures.fenwick_tree import Fenwick_Tree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.traversal_inorder import inorder, inorder_rec
from algorithms.tree.traversal_postorder import p... | ft.get_sum(bit_tree, 3)) | self.assertEqual | func_call | tests/test_tree.py | test_construct_tree_with_update_2 | TestFenwickTree | 155 | null |
keon/algorithms | import math
import unittest
from fractions import Fraction
from algorithms.math.polynomial import Monomial
class TestSuite(unittest.TestCase):
def setUp(self):
self.m1 = Monomial({})
self.m2 = Monomial({1: 1}, 2)
self.m3 = Monomial({1: 2, 2: -1}, 1.5)
self.m4 = Monomial({1: 1, 2: 2... | self.m1) | self.assertEqual | complex_expr | tests/test_monomial.py | test_monomial_addition | TestSuite | 37 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | binary_gap(6)) | self.assertEqual | func_call | tests/test_bit_manipulation.py | test_binary_gap | TestSuite | 287 | null |
keon/algorithms | import unittest
from algorithms.heap import BinaryHeap, get_skyline, k_closest, max_sliding_window
class TestSuite(unittest.TestCase):
def test_k_closest_points(self):
points = [(1, 0), (2, 3), (5, 2), (1, 1), (2, 8), (10, 2), (-1, 0), (-2, -2)]
self.assertEqual([(-1, 0), (1, 0)], | k_closest(points, 2)) | self.assertEqual | func_call | tests/test_heap.py | test_k_closest_points | TestSuite | 50 | null |
keon/algorithms | import random
import unittest
from algorithms.bit_manipulation import (
add_bitwise_operator,
binary_gap,
bytes_big_endian_to_int,
bytes_little_endian_to_int,
clear_bit,
count_flips_to_convert,
count_ones_iter,
count_ones_recur,
find_difference,
find_missing_number,
find_mis... | is_power_of_two(0)) | self.assertFalse | func_call | tests/test_bit_manipulation.py | test_is_power_of_two | TestSuite | 122 | null |
keon/algorithms | import unittest
from algorithms.map import (
HashTable,
ResizableHashTable,
SeparateChainingHashTable,
is_anagram,
is_isomorphic,
longest_palindromic_subsequence,
word_pattern,
)
class TestHashTable(unittest.TestCase):
def test_resizable_hash_table(self):
m = ResizableHashTabl... | m.size) | self.assertEqual | complex_expr | tests/test_map.py | test_resizable_hash_table | TestHashTable | 85 | null |
keon/algorithms | import unittest
from algorithms.heap import BinaryHeap, get_skyline, k_closest, max_sliding_window
class TestSuite(unittest.TestCase):
def test_get_skyline(self):
buildings = [[2, 9, 10], [3, 7, 15], [5, 12, 12], [15, 20, 10], [19, 24, 8]]
# Expect output
output = [[2, 10], [3, 15], [7, 12... | get_skyline(buildings)) | self.assertEqual | func_call | tests/test_heap.py | test_get_skyline | TestSuite | 42 | null |
keon/algorithms | import unittest
from algorithms.backtracking import (
add_operators,
anagram,
array_sum_combinations,
combination_sum,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthesis_v2,
get_factors,
letter_combinations,
palindromic_substrings,
pattern_... | next(it)) | self.assertEqual | func_call | tests/test_backtracking.py | test_permute_iter | TestPermuteAndAnagram | 67 | null |
keon/algorithms | from __future__ import annotations
import unittest
from algorithms.backtracking.minimax import minimax
from algorithms.bit_manipulation.gray_code import gray_code, gray_to_binary
from algorithms.data_structures.kd_tree import KDTree
from algorithms.dynamic_programming.bitmask import tsp
from algorithms.dynamic_progra... | 1) | self.assertEqual | numeric_literal | tests/test_community_algorithms.py | test_z_array_basic | TestZAlgorithm | 57 | null |
keon/algorithms | import unittest
from algorithms.greedy import (
max_contiguous_subsequence_sum,
)
class TestMaxContiguousSubsequenceSum(unittest.TestCase):
def test_max_contiguous_subsequence_sum(self):
arr1 = [-2, 3, 8, -1, 4]
arr2 = [-1, 1, 0]
arr3 = [-1, -3, -4]
arr4 = [-2, 3, 8, -12, 8, 4]... | -1) | self.assertEqual | numeric_literal | tests/test_greedy.py | test_max_contiguous_subsequence_sum | TestMaxContiguousSubsequenceSum | 17 | null |
keon/algorithms | import unittest
from algorithms.backtracking import (
add_operators,
anagram,
array_sum_combinations,
combination_sum,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthesis_v2,
get_factors,
letter_combinations,
palindromic_substrings,
pattern_... | []) | self.assertEqual | collection | tests/test_backtracking.py | test_get_factors | TestFactorCombinations | 137 | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.