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
Function
merge_sort
(array)
python_solutions/chapter_10_sorting_and_searching/merge_sort.py:45
Method
oneAway
cpp_solutions/chapter_01_arrays_and_strings/problem_01_05_oneAway.cpp:73
Function
one_away
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_05_one_away.py:63
Method
operator!=
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:73
Method
operator!=
cpp_solutions/chapter_03_stacks_and_queues/Stack.h:70
Method
operator*
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:100
Method
operator+
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:94
Method
operator-
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:91
Method
operator/
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:97
Method
operator<
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:85
Method
operator<=
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:88
Method
operator==
cpp_solutions/chapter_16_moderate/problem_16_03_intersection.h:15
Method
operator==
destructor
cpp_solutions/chapter_02_linked_lists/Node.h:14
Method
operator==
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:76
Method
operator==
compare values in stack top-to-bottom to values in vector front-to-back for easy unit testing
cpp_solutions/chapter_03_stacks_and_queues/Stack.h:56
Method
operator>
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:79
Method
operator>=
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:82
Function
paint_fill
(image, target_color, location, init_color=None)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_10_paint_fill.py:1
Function
pairwise_swap
(x)
python_solutions/chapter_05_bit_manipulation/problem_05_07_pairwise_swap.py:1
Function
palindrome
(head)
python_solutions/chapter_02_linked_lists/problem_02_06_palindrome.py:24
Method
palindromePermutation
cpp_solutions/chapter_01_arrays_and_strings/problem_01_04_palindromePermutation.cpp:32
Function
palindrome_permutation
(string)
python_solutions/chapter_01_arrays_and_strings/problem_01_04_palindrome_permutation.py:29
Function
parens
(n)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_09_parens.py:1
Function
partition
(node, k)
python_solutions/chapter_02_linked_lists/problem_02_04_partition.py:23
Function
partition
cpp_solutions/chapter_02_linked_lists/problem_02_04_partition.h:28
Function
path_exists_BFS
(graph, start, end)
python_solutions/chapter_04_trees_and_graphs/problem_04_01_path_exists.py:67
Function
paths_with_sum
(root, target_sum)
python_solutions/chapter_04_trees_and_graphs/problem_04_12_paths_with_sum.py:41
Method
peek
cpp_solutions/chapter_03_stacks_and_queues/Queue.h:40
Function
permutations_no_dups
(string)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_07_permutations_no_dups.py:43
Function
permutations_with_dups
(string)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_08_permutations_with_dups.py:1
Method
permuteAndCheckBoard
cpp_solutions/chapter_16_moderate/problem_16_04_ticTacWin.cpp:78
Method
pop
(self)
python_solutions/chapter_03_stacks_queues/problem_03_02_stack_min.py:35
Method
pop
cpp_solutions/chapter_03_stacks_and_queues/Queue.h:31
Function
post_order_traversal
(node, visit_sequence)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:46
Function
power_set
(set)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_04_power_set.py:1
Function
pre_order_traversal
(node, visit_sequence)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:39
Method
print
cpp_solutions/chapter_10_sorting_and_searching/problem_10_09_matrixSearch.h:119
Function
printPath
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_02_robotGrid.cpp:13
Function
printbin
(int_num, name)
python_solutions/chapter_05_bit_manipulation/problem_05_01_insertion.py:1
Method
push
(self, value)
python_solutions/chapter_03_stacks_queues/problem_03_02_stack_min.py:30
Method
push
cpp_solutions/chapter_03_stacks_and_queues/Queue.h:20
Function
quick_sort
(array)
python_solutions/chapter_10_sorting_and_searching/quick_sort.py:20
Function
recursive_multiply
(a, b)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_05_recursive_multiply.py:1
Method
remove
cpp_solutions/chapter_12_cpp/problem_12_09_smartPointer.h:39
Method
removeLeft
cpp_solutions/chapter_02_linked_lists/Node.h:143
Method
removeParent
cpp_solutions/chapter_02_linked_lists/Node.h:149
Method
removeRight
cpp_solutions/chapter_02_linked_lists/Node.h:146
Function
remove_dups
(head)
python_solutions/chapter_02_linked_lists/problem_02_01_remove_dups.py:1
Function
remove_dups_alternative
(head)
python_solutions/chapter_02_linked_lists/problem_02_01_remove_dups.py:12
Function
reset
Implements this directed graph with an adjacency list: 1 -> 2 -> 3 | v
python_solutions/chapter_04_trees_and_graphs/problem_04_01_path_exists.py:36
Function
return_kth_to_last
(head, k)
python_solutions/chapter_02_linked_lists/problem_02_02_return_kth_to_last.py:1
Method
right_children
(self)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:50
Function
robot_grid
(maze, start, end)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_02_robot_grid.py:1
Method
rotate
cpp_solutions/chapter_01_arrays_and_strings/problem_01_07_rotateMatrix.cpp:25
Function
rotate_matrix
(matrix)
python_solutions/chapter_01_arrays_and_strings/problem_01_07_rotate_matrix.py:25
Method
setUp
(self)
tests.py:72
Method
setZero
cpp_solutions/chapter_01_arrays_and_strings/problem_01_08_setZero.cpp:28
Function
set_zero
(matrix)
python_solutions/chapter_01_arrays_and_strings/problem_01_08_set_zero.py:26
Function
sort_stack
(stack)
python_solutions/chapter_03_stacks_queues/problem_03_05_sort_stack.py:27
Function
sorted_merge
(A, lastA, B, lastB)
python_solutions/chapter_10_sorting_and_searching/problem_10_01_sorted_merge.py:20
Method
stringCompression
cpp_solutions/chapter_01_arrays_and_strings/problem_01_06_stringCompression.cpp:46
Method
stringRotation
cpp_solutions/chapter_01_arrays_and_strings/problem_01_09_stringRotation.cpp:24
Function
string_compression
(string)
python_solutions/chapter_01_arrays_and_strings/problem_01_06_string_compression.py:45
Function
string_rotation
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_09_string_rotation.py:26
Function
stringify_bin_tree
(root)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:82
Function
stringify_linked_list
(head)
python_solutions/chapter_02_linked_lists/SinglyLinkedNode.py:7
Function
stringify_list_of_linked_lists
(linked_lists)
python_solutions/chapter_04_trees_and_graphs/tree_basics.py:99
Function
stringify_screen
(screen, width)
python_solutions/chapter_05_bit_manipulation/problem_05_08_draw_line.py:41
Function
successor
(node)
python_solutions/chapter_04_trees_and_graphs/problem_04_06_successor.py:42
Function
sum_lists
(node1, node2)
python_solutions/chapter_02_linked_lists/problem_02_05_sum_lists.py:27
Function
swap_numbers
(pair_ab)
python_solutions/chapter_16_moderate/problem_16_01_swap_numbers.py:6
Method
tearDown
(self)
tests.py:1199
Method
test_graph_exploration
1 <- 8 -> 17 / \ 3 <- 4 10 -> 15 /\ /\ 0 <- 2 6 9 20 -> 23
tests.py:502
Method
test_merge_sort
(self)
tests.py:1084
Method
test_problem_10_01
(self)
tests.py:1128
Method
test_problem_16_01
(self)
tests.py:1144
Method
test_problem_16_03
(self)
tests.py:1155
Method
test_problem_17_10
(self)
tests.py:1166
Method
test_problem_17_15
(self)
tests.py:1181
Method
test_problem_17_21
(self)
tests.py:1191
Method
test_problem_1_1
(self)
tests.py:75
Method
test_problem_1_2
(self)
tests.py:81
Method
test_problem_1_3
(self)
tests.py:89
Method
test_problem_1_4
(self)
tests.py:109
Method
test_problem_1_5
(self)
tests.py:117
Method
test_problem_1_6
(self)
tests.py:129
Method
test_problem_1_7
(self)
tests.py:135
Method
test_problem_1_8
(self)
tests.py:158
Method
test_problem_1_9
(self)
tests.py:181
Method
test_problem_2_1
(self)
tests.py:186
Method
test_problem_2_1_alternative
(self)
tests.py:198
Method
test_problem_2_2
(self)
tests.py:210
Method
test_problem_2_3
(self)
tests.py:222
Method
test_problem_2_4
(self)
tests.py:235
Method
test_problem_2_5
List1: 3 -> 2 -> 4 -> 9 -> NONE List2: -> NONE 9423 + 951 ----- 10374
tests.py:250
Method
test_problem_2_6
(self)
tests.py:276
Method
test_problem_2_7
(self)
tests.py:320
Method
test_problem_2_8
(self)
tests.py:339
Method
test_problem_3_1
(self)
tests.py:397
Method
test_problem_3_2
(self)
tests.py:413
← previous
next →
301–400 of 453, ranked by callers