repo_id stringclasses 400
values | commit_sha stringclasses 400
values | commit_index int32 0 951 | in_repo_split stringclasses 1
value | cross_repo_split stringclasses 1
value | test_file stringlengths 7 121 | test_function stringlengths 1 108 | assertion_type stringclasses 32
values | difficulty stringclasses 8
values | context_lines int32 3 600 | prefix large_stringlengths 44 113k | target large_stringlengths 1 498 | anchor_sha stringclasses 400
values | anchor_index int32 0 951 | qna_source stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_binary_gap | self.assertEqual | func_call | 42 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | binary_gap(145)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_dfs.py | test_get_factors | self.assertEqual | func_call | 15 | from algorithms.dfs import (
get_factors, get_factors_iterative1, get_factors_iterative2,
num_islands,
pacific_atlantic,
Sudoku,
walls_and_gates,
find_path
)
import unittest
class TestAllFactors(unittest.TestCase):
def test_get_factors(self):
| get_factors(32)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_linkedlist.py | test_is_sorted | self.assertTrue | func_call | 46 | import unittest
from algorithms.linkedlist import (
reverse_list, reverse_list_recursive,
is_sorted,
remove_range,
swap_pairs,
rotate_right,
is_cyclic,
merge_two_list, merge_two_list_recur,
is_palindrome, is_palindrome_stack, is_palindrome_dict,
RandomListNode, copy_random_pointer_v... | is_sorted(head)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_linkedlist.py | test_is_cyclic | self.assertTrue | func_call | 52 | import unittest
from algorithms.linkedlist import (
reverse_list, reverse_list_recursive,
is_sorted,
remove_range,
swap_pairs,
rotate_right,
is_cyclic,
merge_two_list, merge_two_list_recur,
is_palindrome, is_palindrome_stack, is_palindrome_dict,
RandomListNode, copy_random_pointer_v... | is_cyclic(head)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_int_to_roman | self.assertEqual | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | int_to_roman(1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_postorder | self.assertEqual | func_call | 22 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | postorder(tree)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_deletion_even_degree | self.assertFalse | func_call | 50 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | btree.find(key)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/tree/bst/bst.py | test_size | self.assertEqual | func_call | 20 | 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()) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_clear_bit | self.assertEqual | func_call | 36 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | clear_bit(22, 2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_first_occurrence | self.assertEqual | func_call | 27 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | helper(array, 1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_first_occurrence | self.assertEqual | func_call | 28 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | helper(array, 3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_first_occurrence | self.assertEqual | func_call | 29 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | helper(array, 5)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_first_occurrence | self.assertEqual | func_call | 30 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | helper(array, 6)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_first_occurrence | self.assertEqual | func_call | 31 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | helper(array, 7)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_stack.py | test_simplify_path | self.assertEqual | func_call | 19 | from algorithms.stack import (
first_is_consecutive, second_is_consecutive,
is_sorted,
remove_min,
first_stutter, second_stutter,
first_switch_pairs, second_switch_pairs,
is_valid,
simplify_path,
ArrayStack, LinkedListStack,
OrderedStack
)
import unittest
class TestSuite(unittest.Te... | simplify_path(p)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_stack.py | test_OrderedStack | self.assertTrue | func_call | 19 | from algorithms.stack import (
first_is_consecutive, second_is_consecutive,
is_sorted,
remove_min,
first_stutter, second_stutter,
first_switch_pairs, second_switch_pairs,
is_valid,
simplify_path,
ArrayStack, LinkedListStack,
OrderedStack
)
import unittest
class TestOrderedStack(uni... | stack.is_empty()) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_atbash_cipher | self.assertEqual | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | atbash("PythoN")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_remove_bit | self.assertEqual | func_call | 41 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | remove_bit(21, 2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_remove_bit | self.assertEqual | func_call | 42 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | remove_bit(21, 4)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_remove_bit | self.assertEqual | func_call | 43 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | remove_bit(21, 0)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_dfs.py | test_maze_search | self.assertEqual | func_call | 16 | from algorithms.dfs import (
get_factors, get_factors_iterative1, get_factors_iterative2,
num_islands,
pacific_atlantic,
Sudoku,
walls_and_gates,
find_path
)
import unittest
class TestMazeSearch(unittest.TestCase):
def test_maze_search(self):
maze_1 = [[1,0,1,1,1,0,1,1,1,0,1,1,1,0,... | find_path(maze_1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_dfs.py | test_maze_search | self.assertEqual | func_call | 18 | from algorithms.dfs import (
get_factors, get_factors_iterative1, get_factors_iterative2,
num_islands,
pacific_atlantic,
Sudoku,
walls_and_gates,
find_path
)
import unittest
class TestMazeSearch(unittest.TestCase):
def test_maze_search(self):
maze_1 = [[1,0,1,1,1,0,1,1,1,0,1,1,1,0,... | find_path(maze_2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_dfs.py | test_maze_search | self.assertEqual | func_call | 20 | from algorithms.dfs import (
get_factors, get_factors_iterative1, get_factors_iterative2,
num_islands,
pacific_atlantic,
Sudoku,
walls_and_gates,
find_path
)
import unittest
class TestMazeSearch(unittest.TestCase):
def test_maze_search(self):
maze_1 = [[1,0,1,1,1,0,1,1,1,0,1,1,1,0,... | find_path(maze_3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_two_sum | self.assertEqual | func_call | 25 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | two_sum(array, 9)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_stack.py | test_is_valid_parenthesis | self.assertFalse | func_call | 21 | from algorithms.stack import (
first_is_consecutive, second_is_consecutive,
is_sorted,
remove_min,
first_stutter, second_stutter,
first_switch_pairs, second_switch_pairs,
is_valid,
simplify_path,
ArrayStack, LinkedListStack,
OrderedStack
)
import unittest
class TestSuite(unittest.Te... | is_valid("[[[]]")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_int_to_roman | self.assertEqual | func_call | 52 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | int_to_roman(644)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_roman_to_int | self.assertEqual | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | roman_to_int("I")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_inorder | self.assertEqual | func_call | 23 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | inorder_rec(tree)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_count_ones_iter | self.assertEqual | func_call | 37 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | count_ones_iter(8)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_count_ones_iter | self.assertEqual | func_call | 46 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | count_ones_iter(0)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_is_power_of_two | self.assertTrue | func_call | 39 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | is_power_of_two(1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_is_power_of_two | self.assertFalse | func_call | 40 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | is_power_of_two(0)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_two_sum | self.assertEqual | func_call | 26 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | two_sum(array, 22)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_two_sum | self.assertEqual | func_call | 28 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | two_sum1(array, 9)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_two_sum | self.assertEqual | func_call | 31 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | two_sum2(array, 9)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_stack.py | test_is_valid_parenthesis | self.assertTrue | func_call | 20 | from algorithms.stack import (
first_is_consecutive, second_is_consecutive,
is_sorted,
remove_min,
first_stutter, second_stutter,
first_switch_pairs, second_switch_pairs,
is_valid,
simplify_path,
ArrayStack, LinkedListStack,
OrderedStack
)
import unittest
class TestSuite(unittest.Te... | is_valid("[]()[]")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_stack.py | test_is_valid_parenthesis | self.assertTrue | func_call | 22 | from algorithms.stack import (
first_is_consecutive, second_is_consecutive,
is_sorted,
remove_min,
first_stutter, second_stutter,
first_switch_pairs, second_switch_pairs,
is_valid,
simplify_path,
ArrayStack, LinkedListStack,
OrderedStack
)
import unittest
class TestSuite(unittest.Te... | is_valid("{([])}")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_int_to_roman | self.assertEqual | func_call | 54 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | int_to_roman(3999)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_is_rotated | self.assertTrue | func_call | 56 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | is_rotated("", "")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_rotate | self.assertEqual | func_call | 51 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | rotate("hello", 2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_rotate | self.assertEqual | func_call | 52 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | rotate("hello", 5)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_rotate | self.assertEqual | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | rotate("hello", 6)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_rotate | self.assertEqual | func_call | 54 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | rotate("hello", 7)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_preorder | self.assertEqual | func_call | 23 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | preorder_rec(tree)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_maze_search | self.assertEqual | func_call | 15 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestMazeSearch(unittest.TestCase):
def test_maze_search(self):
grid_1 = [[1,0,1,1,1,1],[1,0,1,0,1,0],[1,0,1,0,1,1],[1,1,1,0,1,1]]
self.assertEqual(... | maze_search(grid_1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_maze_search | self.assertEqual | func_call | 17 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestMazeSearch(unittest.TestCase):
def test_maze_search(self):
grid_1 = [[1,0,1,1,1,1],[1,0,1,0,1,0],[1,0,1,0,1,1],[1,1,1,0,1,1]]
self.assertEqual(1... | maze_search(grid_2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_count_ones_recur | self.assertEqual | func_call | 37 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | count_ones_recur(8)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bit.py | test_count_ones_recur | self.assertEqual | func_call | 46 | from algorithms.bit import (
add_bitwise_operator,
count_ones_iter, count_ones_recur,
count_flips_to_convert,
find_missing_number, find_missing_number2,
flip_bit_longest_seq,
is_power_of_two,
reverse_bits,
single_number,
single_number2,
single_number3,
subsets,
get_bit, s... | count_ones_recur(0)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_two_sum | self.assertEqual | func_call | 29 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | two_sum1(array, 22)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_multiply | self.assertEqual | func_call | 52 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | multiply("1", "23")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_multiply | self.assertEqual | func_call | 54 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | multiply("0", "23")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_postorder | self.assertEqual | func_call | 23 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | postorder_rec(tree)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/tree/bst/bst.py | test_search | self.assertTrue | func_call | 20 | 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.search(24)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/tree/bst/bst.py | test_search | self.assertFalse | func_call | 21 | 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.search(50)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_k_closest_points | self.assertEqual | func_call | 15 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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,... | k_closest(points, 2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_k_closest_points | self.assertEqual | func_call | 16 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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, ... | k_closest(points, 3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_k_closest_points | self.assertEqual | func_call | 17 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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, ... | k_closest(points, 4)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_k_closest_points | self.assertEqual | func_call | 18 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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, ... | k_closest(points, 8)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_add_binary | self.assertEqual | func_call | 54 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | add_binary("1", "1")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_multiply | self.assertEqual | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | multiply("23", "23")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_judge_circle | self.assertFalse | func_call | 52 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | judge_circle("LLRU")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_unix.py | test_full_path | self.assertEqual | func_call | 16 | from algorithms.unix import (
join_with_slash,
full_path,
split,
simplify_path_v1, simplify_path_v2
)
import os
import unittest
class TestUnixPath(unittest.TestCase):
def test_full_path(self):
file_name = "file_name"
# Test full path relative
expect_path = "{}/{}".format(os.... | full_path(file_name)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_count_islands | self.assertEqual | func_call | 15 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestCountIslands(unittest.TestCase):
def test_count_islands(self):
grid_1 = [[1,1,1,1,0], [1,1,0,1,0], [1,1,0,0,0], [0,0,0,0,0]]
self.assertEqual(1... | count_islands(grid_1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_count_islands | self.assertEqual | func_call | 17 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestCountIslands(unittest.TestCase):
def test_count_islands(self):
grid_1 = [[1,1,1,1,0], [1,1,0,1,0], [1,1,0,0,0], [0,0,0,0,0]]
self.assertEqual(1,... | count_islands(grid_2)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_count_islands | self.assertEqual | func_call | 19 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestCountIslands(unittest.TestCase):
def test_count_islands(self):
grid_1 = [[1,1,1,1,0], [1,1,0,1,0], [1,1,0,0,0], [0,0,0,0,0]]
self.assertEqual(1,... | count_islands(grid_3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_bfs.py | test_count_islands | self.assertEqual | func_call | 21 | from algorithms.bfs import (
count_islands,
maze_search,
shortest_distance_from_all_buildings,
ladder_length
)
import unittest
class TestCountIslands(unittest.TestCase):
def test_count_islands(self):
grid_1 = [[1,1,1,1,0], [1,1,0,1,0], [1,1,0,0,0], [0,0,0,0,0]]
self.assertEqual(1,... | count_islands(grid_4)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_graph.py | dinic | self.assertEqual | func_call | 30 | from algorithms.graph import Tarjan
from algorithms.graph import check_bipartite
from algorithms.graph.dijkstra import Dijkstra
from algorithms.graph import ford_fulkerson
from algorithms.graph import edmonds_karp
from algorithms.graph import dinic
from algorithms.graph import maximum_flow_bfs
from algorithms.graph imp... | dinic(capacity, 0, 6)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_linkedlist.py | test_is_palindrome | self.assertTrue | func_call | 40 | import unittest
from algorithms.linkedlist import (
reverse_list, reverse_list_recursive,
is_sorted,
remove_range,
swap_pairs,
rotate_right,
is_cyclic,
merge_two_list, merge_two_list_recur,
is_palindrome, is_palindrome_stack, is_palindrome_dict,
RandomListNode, copy_random_pointer_v... | is_palindrome(self.l)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_jump_search | self.assertEqual | func_call | 24 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | jump_search(array, 5)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_jump_search | self.assertEqual | func_call | 25 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | jump_search(array, 3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_jump_search | self.assertEqual | func_call | 26 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | jump_search(array, 7)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_add_binary | self.assertEqual | func_call | 52 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | add_binary("11", "1")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_is_palindrome | self.assertTrue | func_call | 53 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | is_palindrome("Otto")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_strings.py | test_is_rotated_v1 | self.assertTrue | func_call | 56 | from algorithms.strings import (
add_binary,
match_symbol, match_symbol_1, bracket,
decode_string,
delete_reoccurring_characters,
domain_name_1, domain_name_2,
encode, decode,
group_anagrams,
int_to_roman,
is_palindrome, is_palindrome_reverse,
is_palindrome_two_pointer, is_palind... | is_rotated_v1("", "")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/tree/bst/height.py | test_height | self.assertEqual | func_call | 26 | import unittest
from bst import Node
from bst import bst
def height(root):
if root is None:
return 0
else:
return 1 + max(height(root.left), height(root.right))
class TestSuite(unittest.TestCase):
def setUp(self):
self.tree = bst()
self.tree.insert(9)
self.tree.inse... | height(self.tree.root)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_get_skyline | self.assertEqual | func_call | 18 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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
... | get_skyline(buildings)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_linkedlist.py | test_is_palindrome | self.assertFalse | func_call | 41 | import unittest
from algorithms.linkedlist import (
reverse_list, reverse_list_recursive,
is_sorted,
remove_range,
swap_pairs,
rotate_right,
is_cyclic,
merge_two_list, merge_two_list_recur,
is_palindrome, is_palindrome_stack, is_palindrome_dict,
RandomListNode, copy_random_pointer_v... | is_palindrome(self.l1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_search_range | self.assertEqual | func_call | 24 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | search_range(array, 8)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_search_range | self.assertEqual | func_call | 25 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | search_range(array, 7)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_find_min_rotate | self.assertEqual | func_call | 24 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | find_min_rotate(array)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_jump_search | self.assertEqual | func_call | 27 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | jump_search(array, -1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/linkedlist/add_two_numbers.py | test_convert_to_str | self.assertEqual | func_call | 61 | import unittest
def add_two_numbers(left: Node, right: Node) -> Node:
head = Node(0)
current = head
sum = 0
while left or right:
print("adding: ", left.val, right.val)
sum //= 10
if left:
sum += left.val
left = left.next
if right:
sum ... | convert_to_str(number1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_binary_search | self.assertEqual | func_call | 24 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | binary_search(array, 5)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_search.py | test_binary_search | self.assertEqual | func_call | 25 | from algorithms.search import (
binary_search, binary_search_recur,
ternary_search,
first_occurrence,
last_occurrence,
linear_search,
search_insert,
two_sum, two_sum1, two_sum2,
search_range,
find_min_rotate, find_min_rotate_recur,
search_rotate, search_rotate_recur,
jump_sea... | binary_search(array, 6)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_construct_tree_with_update_1 | self.assertEqual | func_call | 36 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | ft.get_sum(bit_tree, 5)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_tree.py | test_construct_tree_with_update_2 | self.assertEqual | func_call | 37 | from algorithms.tree.traversal import (
preorder,
preorder_rec,
postorder,
postorder_rec,
inorder,
inorder_rec
)
from algorithms.tree.b_tree import BTree
from algorithms.tree import construct_tree_postorder_preorder as ctpp
from algorithms.tree.fenwick_tree.fenwick_tree import Fenwick_Tree
im... | ft.get_sum(bit_tree, 3)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/linkedlist/intersection.py | test_intersection | self.assertEqual | func_call | 78 | import unittest
def intersection(h1, h2):
count = 0
flag = None
h1_orig = h1
h2_orig = h2
while h1 or h2:
count += 1
if not flag and (h1.next is None or h2.next is None):
# We hit the end of one of the lists, set a flag for this
flag = (count, h1.next, h2.... | intersection(a1, a2).val) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_unix.py | test_simplify_path | self.assertEqual | func_call | 13 | from algorithms.unix import (
join_with_slash,
full_path,
split,
simplify_path_v1, simplify_path_v2
)
import os
import unittest
class TestUnixPath(unittest.TestCase):
def test_simplify_path(self):
self.assertEqual("/", | simplify_path_v1("/../")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_unix.py | test_simplify_path | self.assertEqual | func_call | 15 | from algorithms.unix import (
join_with_slash,
full_path,
split,
simplify_path_v1, simplify_path_v2
)
import os
import unittest
class TestUnixPath(unittest.TestCase):
def test_simplify_path(self):
self.assertEqual("/", simplify_path_v1("/../"))
self.assertEqual("/home/foo", simplify... | simplify_path_v2("/../")) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/dp/regex_matching.py | test_none_0 | self.assertTrue | func_call | 8 | import unittest
class TestSolution(unittest.TestCase):
def test_none_0(self):
s = ""
p = ""
self.assertTrue( | Solution().is_match(s, p)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/matrix/bomb_enemy.py | test_3x4 | self.assertEqual | func_call | 46 | def max_killed_enemies(grid):
if not grid: return 0
m, n = len(grid), len(grid[0])
max_killed = 0
row_e, col_e = 0, [0] * n
# iterates over all cells in the grid
for i in range(m):
for j in range(n):
# makes sure we are next to a wall.
if j == 0 or grid[i][j-1] ==... | max_killed_enemies(grid1)) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_heap.py | test_remove_min | self.assertEqual | variable | 27 | from algorithms.heap import (
BinaryHeap,
get_skyline,
max_sliding_window,
k_closest
)
import unittest
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)
... | ret) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_dfs.py | test_walls_and_gates | self.assertEqual | variable | 20 | from algorithms.dfs import (
get_factors, get_factors_iterative1, get_factors_iterative2,
num_islands,
pacific_atlantic,
Sudoku,
walls_and_gates,
find_path
)
import unittest
class TestWallsAndGates(unittest.TestCase):
def test_walls_and_gates(self):
rooms = [[float("inf"), -1, 0, f... | rooms) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | algorithms/linkedlist/add_two_numbers.py | test_add_two_numbers | self.assertEqual | variable | 66 | import unittest
def add_two_numbers(left: Node, right: Node) -> Node:
head = Node(0)
current = head
sum = 0
while left or right:
print("adding: ", left.val, right.val)
sum //= 10
if left:
sum += left.val
left = left.next
if right:
sum ... | result) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_backtrack.py | test_add_operators | self.assertEqual | variable | 54 | from algorithms.backtrack import (
add_operators,
permute,
permute_iter,
anagram,
array_sum_combinations,
unique_array_sum_combinations,
combination_sum,
get_factors,
recursive_get_factors,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthe... | answer) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_compression.py | test_elias_gamma | self.assertEqual | variable | 17 | from algorithms.compression.huffman_coding import HuffmanCoding
from algorithms.compression.rle_compression import (decode_rle, encode_rle)
from algorithms.compression.elias import (elias_gamma, elias_delta)
import unittest
class TestEliasCoding(unittest.TestCase):
def test_elias_gamma(self):
correct_res... | result) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_backtrack.py | test_combination_sum | self.assertEqual | variable | 44 | from algorithms.backtrack import (
add_operators,
permute,
permute_iter,
anagram,
array_sum_combinations,
unique_array_sum_combinations,
combination_sum,
get_factors,
recursive_get_factors,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthe... | answer1) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_backtrack.py | test_combination_sum | self.assertEqual | variable | 53 | from algorithms.backtrack import (
add_operators,
permute,
permute_iter,
anagram,
array_sum_combinations,
unique_array_sum_combinations,
combination_sum,
get_factors,
recursive_get_factors,
find_words,
generate_abbreviations,
generate_parenthesis_v1,
generate_parenthe... | answer2) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_maths.py | test_prime_test | self.assertEqual | variable | 45 | from algorithms.maths import (
power, power_recur,
int_to_base, base_to_int,
decimal_to_binary_ip,
euler_totient,
extended_gcd,
factorial, factorial_recur,
gcd, lcm, trailing_zero, gcd_bit,
gen_strobogrammatic, strobogrammatic_in_range,
is_strobogrammatic, is_strobogrammatic2,
mo... | counter) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
keon/algorithms | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | train | train | tests/test_compression.py | test_huffman_coding | self.assertEqual | variable | 35 | from algorithms.compression.huffman_coding import HuffmanCoding
from algorithms.compression.rle_compression import (decode_rle, encode_rle)
from algorithms.compression.elias import (elias_gamma, elias_delta)
import unittest
class TestHuffmanCoding(unittest.TestCase):
def setUpClass(cls):
cls.file_in_name... | content_2) | 40f240a46573dcb7559d0557eaa6a768d976ba46 | 129 | v2_extractor_at_anchor |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.