Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/alexhagiopol/cracking-the-coding-interview
/ functions
Functions
453 in github.com/alexhagiopol/cracking-the-coding-interview
⨍
Functions
453
◇
Types & classes
48
↓ 1 callers
Function
search_replacement
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_05_one_away.py:50
↓ 1 callers
Method
setID
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.h:42
↓ 1 callers
Method
setValue
cpp_solutions/chapter_12_cpp/problem_12_09_smartPointer.h:71
↓ 1 callers
Function
sortHelper
cpp_solutions/chapter_10_sorting_and_searching/mergeSort.h:41
↓ 1 callers
Function
sortStack
cpp_solutions/chapter_03_stacks_and_queues/problem_03_05_sortStack.h:26
↓ 1 callers
Function
sort_helper
(array, helper_array, start, end)
python_solutions/chapter_10_sorting_and_searching/merge_sort.py:34
↓ 1 callers
Function
sparseSearchHelper
cpp_solutions/chapter_10_sorting_and_searching/problem_10_05_sparseSearch.cpp:4
↓ 1 callers
Method
stackSize
cpp_solutions/chapter_03_stacks_and_queues/Stack.h:45
↓ 1 callers
Function
submatrixSearchHelper
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:125
↓ 1 callers
Function
subtreeEquality
cpp_solutions/chapter_04_trees_and_graphs/problem_04_10_checkSubtree.h:26
↓ 1 callers
Function
subtree_equality
(t1, t2)
python_solutions/chapter_04_trees_and_graphs/problem_04_10_check_subtree.py:22
↓ 1 callers
Function
sumLists
cpp_solutions/chapter_02_linked_lists/problem_02_05_sumLists.h:28
↓ 1 callers
Function
trimCopy
cpp_solutions/chapter_16_moderate/problem_16_02_wordFrequencies.cpp:4
↓ 1 callers
Function
validate_BST_helper
(node, min, max)
python_solutions/chapter_04_trees_and_graphs/problem_04_05_validate_BST.py:26
↓ 1 callers
Function
vectorFromVectorOfLLs
cpp_solutions/chapter_04_trees_and_graphs/problem_04_03_makeLL.h:29
Method
Animal
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:4
Method
Cat
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:14
Method
Dog
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:10
Method
GraphNode
cpp_solutions/chapter_02_linked_lists/Node.h:40
Method
LineSegment2
cpp_solutions/chapter_16_moderate/problem_16_03_intersection.h:25
Method
Listy
cpp_solutions/chapter_10_sorting_and_searching/problem_10_04_searchNoSize.h:44
Method
Person
cpp_solutions/chapter_16_moderate/problem_16_10_livingPeople.h:29
Method
Point2
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:72
Method
RandBinaryNode
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:44
Method
RankBinaryNode
cpp_solutions/chapter_10_sorting_and_searching/problem_10_10_rankFromStream.h:71
Method
RankTracker
cpp_solutions/chapter_10_sorting_and_searching/problem_10_10_rankFromStream.h:89
Method
SmartPointer
regular constructor
cpp_solutions/chapter_12_cpp/problem_12_09_smartPointer.h:48
Method
TTTDatabase
cpp_solutions/chapter_16_moderate/problem_16_04_ticTacWin.cpp:5
Method
TetraGraphNode
cpp_solutions/chapter_02_linked_lists/Node.h:88
Method
__eq__
(self, other)
python_solutions/chapter_16_moderate/problem_16_03_intersection.py:6
Method
__eq__
(self, other)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:20
Method
__init__
(self, x, y)
python_solutions/chapter_16_moderate/problem_16_03_intersection.py:2
Method
__init__
(self, start, end)
python_solutions/chapter_16_moderate/problem_16_03_intersection.py:11
Method
__init__
(self, value, next_node)
python_solutions/chapter_02_linked_lists/SinglyLinkedNode.py:2
Method
__init__
(self, disks=None)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_06_hanoi_towers.py:2
Method
__init__
(self, left, right, val)
python_solutions/chapter_04_trees_and_graphs/problem_04_02_make_bst.py:22
Method
__init__
(self, name)
python_solutions/chapter_04_trees_and_graphs/problem_04_07_build_order.py:37
Method
__init__
(self, val, left=None, right=None)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:7
Method
__init__
(self, val, left=None, right=None, parent=None)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:14
Method
__init__
(self, val, next_elem=None)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:27
Method
__init__
(self, val, children=())
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:54
Method
__init__
(self, value, frontier=False, explored=False)
python_solutions/chapter_04_trees_and_graphs/problem_04_01_path_exists.py:19
Method
__init__
(self)
python_solutions/chapter_04_trees_and_graphs/problem_04_01_path_exists.py:26
Method
__init__
(self, value=None, left=None, right=None, children=0)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:38
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/Stack.py:5
Method
__init__
(self, max_height)
python_solutions/chapter_03_stacks_queues/problem_03_03_stack_of_plates.py:5
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/problem_03_04_queue_via_stacks.py:23
Method
__init__
(self, head=None)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:25
Method
__init__
(self, name, species, order, next_node=None)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:51
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:59
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/Queue.py:4
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/problem_03_01_three_in_one.py:2
Method
__init__
(self)
python_solutions/chapter_03_stacks_queues/problem_03_02_stack_min.py:26
Method
__str__
(self)
python_solutions/chapter_03_stacks_queues/Stack.py:30
Function
are_permutations
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_02_are_permuations.py:30
Function
bfs
(root, visit_sequence)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:68
Function
binary_to_string
(fraction)
python_solutions/chapter_05_bit_manipulation/problem_05_02_binary_to_string.py:1
Method
board2Hash
cpp_solutions/chapter_16_moderate/problem_16_04_ticTacWin.cpp:15
Method
buildDB
cpp_solutions/chapter_16_moderate/problem_16_04_ticTacWin.cpp:88
Function
build_order
(project_list, deps_list)
python_solutions/chapter_04_trees_and_graphs/problem_04_07_build_order.py:44
Function
check_balanced
(root)
python_solutions/chapter_04_trees_and_graphs/problem_04_04_check_balanced.py:29
Function
check_subtree
(t1, t2)
python_solutions/chapter_04_trees_and_graphs/problem_04_10_check_subtree.py:32
Function
coin_representations
(n, denom_index=0, denoms=(1, 5, 10, 25))
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_11_coins.py:2
Function
conversion
(A, B)
python_solutions/chapter_05_bit_manipulation/problem_05_06_conversion.py:1
Function
convert_to_base
(num, old, new)
python_solutions/chapter_05_bit_manipulation/problem_05_00_convert_binary.py:16
Function
convert_to_base2
(num)
python_solutions/chapter_05_bit_manipulation/problem_05_00_convert_binary.py:1
Method
decrementChildren
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:102
Method
delete
(self)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:87
Function
delete_middle
(node)
python_solutions/chapter_02_linked_lists/problem_02_03_delete_middle.py:20
Method
dequeue
(self)
python_solutions/chapter_03_stacks_queues/problem_03_04_queue_via_stacks.py:30
Function
dfs
(root, visit_sequence)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:60
Function
draw_line
(screen, width, x1, x2, y)
python_solutions/chapter_05_bit_manipulation/problem_05_08_draw_line.py:64
Method
enqueue
(self, value)
python_solutions/chapter_03_stacks_queues/problem_03_04_queue_via_stacks.py:27
Method
enqueue
(self, species, name)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:64
Function
find_longest_combination
(list)
python_solutions/chapter_17_hard/problem_17_15_longest_combination.py:13
Function
find_loop
(head)
python_solutions/chapter_02_linked_lists/problem_02_08_find_loop.py:25
Function
first_common_ancestor
(head, node1, node2)
python_solutions/chapter_04_trees_and_graphs/problem_04_08_first_common_ancestor.py:40
Function
flip_bit_to_win
(number)
python_solutions/chapter_05_bit_manipulation/problem_05_03_flip_bit_to_win.py:1
Method
getLeftChildren
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:85
Method
getRightChildren
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:93
Function
get_next
(positive_integer)
python_solutions/chapter_05_bit_manipulation/problem_05_04_next_number.py:75
Function
get_prev
(positive_integer)
python_solutions/chapter_05_bit_manipulation/problem_05_04_next_number.py:40
Function
histogram_volume
(histogram_array)
python_solutions/chapter_17_hard/problem_17_21_histogram_volume.py:1
Function
in_order_traversal
(node, visit_sequence)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:32
Method
incrementChildren
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:101
Function
insertion
example input: N = 10000000000, M = 10011, i = 2, j = 6 example output: 10001001100
python_solutions/chapter_05_bit_manipulation/problem_05_01_insertion.py:5
Function
intersection
(segment1, segment2)
python_solutions/chapter_16_moderate/problem_16_03_intersection.py:22
Function
intersection
(head1, head2)
python_solutions/chapter_02_linked_lists/problem_02_07_intersection.py:32
Function
intersection
cpp_solutions/chapter_02_linked_lists/problem_02_07_intersection.h:52
Method
isEmpty
cpp_solutions/chapter_03_stacks_and_queues/Queue.h:18
Method
isPermutation
cpp_solutions/chapter_01_arrays_and_strings/problem_01_02_arePermutations.cpp:33
Method
isUnique
cpp_solutions/chapter_01_arrays_and_strings/problem_01_01_isUnique.cpp:33
Function
is_unique
(input_string)
python_solutions/chapter_01_arrays_and_strings/problem_01_01_is_unique.py:29
Method
linearIndex
cpp_solutions/chapter_16_moderate/problem_16_04_ticTacWin.cpp:38
Function
list_length
(node)
python_solutions/chapter_02_linked_lists/SinglyLinkedNode.py:15
Function
magic_index
(A, start=None, end=None)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_03_magic_index.py:1
Function
main
cpp_solutions/chapter_10_sorting_and_searching/chapter_10_dataset_generation/generate_random_number_file.cpp:6
Function
majority_element
(array)
python_solutions/chapter_17_hard/problem_17_10_majority_element.py:1
Function
make_bst
(sorted_list)
python_solutions/chapter_04_trees_and_graphs/problem_04_02_make_bst.py:28
Function
make_ll
(root)
python_solutions/chapter_04_trees_and_graphs/problem_04_03_make_ll.py:40
← previous
next →
201–300 of 453, ranked by callers