MCPcopy Create free account

hub / github.com/alexhagiopol/cracking-the-coding-interview / functions

Functions453 in github.com/alexhagiopol/cracking-the-coding-interview

⨍ Functions 453◇ Types & classes 48
↓ 3 callersFunctionreverse
cpp_solutions/chapter_12_cpp/problem_12_02_reverse.cpp:24
↓ 3 callersMethodseeMin
cpp_solutions/chapter_03_stacks_and_queues/problem_03_02_StackMin.h:50
↓ 3 callersMethodsee_min
(self)
python_solutions/chapter_03_stacks_queues/problem_03_02_stack_min.py:41
↓ 3 callersMethodsetValue
cpp_solutions/chapter_02_linked_lists/Node.h:16
↓ 3 callersFunctionsingleByteLine
cpp_solutions/chapter_05_bit_manipulation/problem_05_08_drawLine.cpp:74
↓ 3 callersFunctionsingle_byte_line
(x1, x2)
python_solutions/chapter_05_bit_manipulation/problem_05_08_draw_line.py:52
↓ 3 callersFunctionswapNumbers
cpp_solutions/chapter_16_moderate/problem_16_01_swapNumbers.h:9
↓ 3 callersFunctiontripleStep
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_01_tripleStep.cpp:13
↓ 2 callersMethodQueue
cpp_solutions/chapter_03_stacks_and_queues/Queue.h:11
↓ 2 callersMethodadd_to_end
(self, node)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:29
↓ 2 callersFunctionbstToVector
cpp_solutions/chapter_02_linked_lists/Node.h:184
↓ 2 callersFunctioncheckBalanced
cpp_solutions/chapter_04_trees_and_graphs/problem_04_04_checkBalanced.h:29
↓ 2 callersFunctioncomputeIndex
cpp_solutions/chapter_10_sorting_and_searching/problem_10_04_searchNoSize.cpp:25
↓ 2 callersFunctionconversion
cpp_solutions/chapter_05_bit_manipulation/problem_05_06_conversion.cpp:4
↓ 2 callersMethoddequeue_cat
(self)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:75
↓ 2 callersMethodenqueue
cpp_solutions/chapter_03_stacks_and_queues/problem_03_04_QueueViaStacks.h:31
↓ 2 callersMethodgetChildren
cpp_solutions/chapter_02_linked_lists/Node.h:103
↓ 2 callersMethodgetID
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.h:41
↓ 2 callersMethodgetLeftChildrenCount
cpp_solutions/chapter_10_sorting_and_searching/problem_10_10_rankFromStream.h:81
↓ 2 callersMethodgetNumAncestors
cpp_solutions/chapter_02_linked_lists/Node.h:74
↓ 2 callersMethodgetSpecies
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.h:44
↓ 2 callersMethodinBounds
cpp_solutions/chapter_16_moderate/problem_16_03_intersection.h:36
↓ 2 callersMethodincrementLeft
cpp_solutions/chapter_10_sorting_and_searching/problem_10_10_rankFromStream.h:82
↓ 2 callersMethodisEmpty
cpp_solutions/chapter_03_stacks_and_queues/problem_03_04_QueueViaStacks.h:30
↓ 2 callersMethodis_empty
(self)
python_solutions/chapter_03_stacks_queues/Queue.py:24
↓ 2 callersMethodleft_children
(self)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:44
↓ 2 callersFunctionmakeIntegralImage
cpp_solutions/misc_exercises/misc_01_integralImage.cpp:4
↓ 2 callersFunctionminimalTree
cpp_solutions/chapter_04_trees_and_graphs/problem_04_02_minimalTree.h:39
↓ 2 callersFunctionminimalTreeHelper
cpp_solutions/chapter_04_trees_and_graphs/problem_04_02_minimalTree.h:25
↓ 2 callersFunctionnode_to_ll
(list_ll, node, depth)
python_solutions/chapter_04_trees_and_graphs/problem_04_03_make_ll.py:25
↓ 2 callersFunctionpartition
cpp_solutions/chapter_10_sorting_and_searching/quickSort.h:6
↓ 2 callersMethodpop
override pop() function from base class
cpp_solutions/chapter_03_stacks_and_queues/problem_03_02_StackMin.h:43
↓ 2 callersMethodpop_at
(self, index)
python_solutions/chapter_03_stacks_queues/problem_03_03_stack_of_plates.py:24
↓ 2 callersFunctionsetPairValues
Sets pair associated with number
cpp_solutions/chapter_10_sorting_and_searching/problem_10_08_findDuplicates.cpp:15
↓ 2 callersFunctionsortedMerge
cpp_solutions/chapter_10_sorting_and_searching/problem_10_01_sortedMerge.h:21
↓ 2 callersFunctionvalidateBST
cpp_solutions/chapter_04_trees_and_graphs/problem_04_05_validateBST.h:30
↓ 1 callersMethodAnimalShelter
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:18
↓ 1 callersMethodQueueViaStacks
cpp_solutions/chapter_03_stacks_and_queues/problem_03_04_QueueViaStacks.h:29
↓ 1 callersMethodStackMin
cpp_solutions/chapter_03_stacks_and_queues/problem_03_02_StackMin.h:32
↓ 1 callersMethodadd
(self, value)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_06_hanoi_towers.py:8
↓ 1 callersFunctionapproxEqual
cpp_solutions/chapter_16_moderate/problem_16_03_intersection.h:6
↓ 1 callersFunctionbinarySearchMagicIndex
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_03_magicIndex.cpp:4
↓ 1 callersFunctioncheck_height
(root)
python_solutions/chapter_04_trees_and_graphs/problem_04_04_check_balanced.py:21
↓ 1 callersFunctioncombine
(char, string_list)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_07_permutations_no_dups.py:54
↓ 1 callersFunctioncombine
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_07_permutationsNoDups.cpp:46
↓ 1 callersFunctioncomputeCompressedLength
cpp_solutions/chapter_01_arrays_and_strings/problem_01_06_stringCompression.cpp:27
↓ 1 callersFunctioncomputeEndpoint
cpp_solutions/chapter_10_sorting_and_searching/problem_10_04_searchNoSize.cpp:27
↓ 1 callersFunctioncompute_compressed_length
(string)
python_solutions/chapter_01_arrays_and_strings/problem_01_06_string_compression.py:29
↓ 1 callersFunctioncopyNode
cpp_solutions/chapter_12_cpp/problem_12_08_copyNode.h:26
↓ 1 callersFunctioncount_paths
(node, target_sum, running_sum, hash_table)
python_solutions/chapter_04_trees_and_graphs/problem_04_12_paths_with_sum.py:46
↓ 1 callersMethoddecAncestors
cpp_solutions/chapter_02_linked_lists/Node.h:71
↓ 1 callersFunctiondeleteMiddleNode
cpp_solutions/chapter_02_linked_lists/problem_02_03_deleteMiddleNode.h:25
↓ 1 callersMethoddequeueCat
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:35
↓ 1 callersMethoddequeueDog
cpp_solutions/chapter_03_stacks_and_queues/problem_03_06_animalShelter.cpp:43
↓ 1 callersMethoddequeue_dog
(self)
python_solutions/chapter_03_stacks_queues/problem_03_06_animal_shelter.py:72
↓ 1 callersFunctiondfsHelper
cpp_solutions/chapter_16_moderate/problem_16_19_pondSizes.cpp:5
↓ 1 callersFunctionfindDuplicates
cpp_solutions/chapter_10_sorting_and_searching/problem_10_08_findDuplicates.cpp:20
↓ 1 callersFunctionfirstCommonAncestorHelper
cpp_solutions/chapter_04_trees_and_graphs/problem_04_08_firstCommonAncestor.h:29
↓ 1 callersFunctionfirst_common_ancestor_helper
(currentNode, node1, node2, fca_reference)
python_solutions/chapter_04_trees_and_graphs/problem_04_08_first_common_ancestor.py:25
↓ 1 callersFunctiongetFirstRightAncestor
cpp_solutions/chapter_04_trees_and_graphs/problem_04_06_successor.h:36
↓ 1 callersMethodgetHeadOfDescendants
cpp_solutions/chapter_02_linked_lists/Node.h:77
↓ 1 callersFunctiongetLeftmostDescendant
cpp_solutions/chapter_04_trees_and_graphs/problem_04_06_successor.h:27
↓ 1 callersFunctiongetPath
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_02_robotGrid.cpp:21
↓ 1 callersMethodgetRandomNode
cpp_solutions/chapter_04_trees_and_graphs/problem_04_11_randomBST.h:69
↓ 1 callersMethodget_children
(self, node)
python_solutions/chapter_04_trees_and_graphs/problem_04_01_path_exists.py:29
↓ 1 callersFunctionget_first_right_ancestor
(node)
python_solutions/chapter_04_trees_and_graphs/problem_04_06_successor.py:32
↓ 1 callersFunctionget_leftmost_descendant
(node)
python_solutions/chapter_04_trees_and_graphs/problem_04_06_successor.py:24
↓ 1 callersFunctionget_path
(maze, start, end, path, visited_points)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_02_robot_grid.py:9
↓ 1 callersMethodget_random
(self, rand_int=None)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:74
↓ 1 callersFunctionhelper
(string, left, right, combinations)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_09_parens.py:10
↓ 1 callersFunctionhelper
(string, hash_table, permutations)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_08_permutations_with_dups.py:13
↓ 1 callersFunctionhelper_recursive_multiply
(a, b)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_05_recursive_multiply.py:7
↓ 1 callersMethodincAncestors
cpp_solutions/chapter_02_linked_lists/Node.h:68
↓ 1 callersMethodinsert
(self, value)
python_solutions/chapter_04_trees_and_graphs/problem_04_11_random_BST.py:56
↓ 1 callersFunctioninsertion
cpp_solutions/chapter_05_bit_manipulation/problem_05_01_insertion.cpp:4
↓ 1 callersFunctionint_to_char
(mod)
python_solutions/chapter_05_bit_manipulation/problem_05_00_convert_binary.py:10
↓ 1 callersFunctionis_combination
(string, dict)
python_solutions/chapter_17_hard/problem_17_15_longest_combination.py:2
↓ 1 callersFunctionis_substring
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_09_string_rotation.py:22
↓ 1 callersFunctionkernelConvolution
cpp_solutions/misc_exercises/misc_02_kernelConvolution.cpp:4
↓ 1 callersFunctionmakeDatabase
cpp_solutions/chapter_16_moderate/problem_16_02_wordFrequencies.cpp:13
↓ 1 callersFunctionmakeLL
cpp_solutions/chapter_04_trees_and_graphs/problem_04_03_makeLL.h:42
↓ 1 callersFunctionmergeHelper
cpp_solutions/chapter_10_sorting_and_searching/mergeSort.h:6
↓ 1 callersFunctionmerge_helper
(array, helper_array, start, middle, end)
python_solutions/chapter_10_sorting_and_searching/merge_sort.py:4
↓ 1 callersFunctionmissingInt
cpp_solutions/chapter_10_sorting_and_searching/problem_10_07_missingInt.cpp:8
↓ 1 callersMethodmove_disks
(self, n, destination, buffer)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_06_hanoi_towers.py:24
↓ 1 callersMethodmove_top_to
(self, destination)
python_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_06_hanoi_towers.py:18
↓ 1 callersFunctionpartition
(array, start, end)
python_solutions/chapter_10_sorting_and_searching/quick_sort.py:1
↓ 1 callersFunctionpathsWithSum
cpp_solutions/chapter_04_trees_and_graphs/problem_04_12_pathsWithSum.h:68
↓ 1 callersFunctionpathsWithSumHelper
cpp_solutions/chapter_04_trees_and_graphs/problem_04_12_pathsWithSum.h:45
↓ 1 callersFunctionpermutationsWithDupsHelper
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_08_permutationsWithDups.cpp:30
↓ 1 callersMethodpush
(self, value)
python_solutions/chapter_03_stacks_queues/problem_03_03_stack_of_plates.py:10
↓ 1 callersFunctionquickSortHelper
cpp_solutions/chapter_10_sorting_and_searching/quickSort.h:21
↓ 1 callersFunctionquick_sort_helper
(array, start, end)
python_solutions/chapter_10_sorting_and_searching/quick_sort.py:13
↓ 1 callersFunctionrecursiveMultiplyHelper
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_05_recursiveMultiply.cpp:5
↓ 1 callersFunctionrobotGrid
cpp_solutions/chapter_08_recursion_and_dynamic_programming/problem_08_02_robotGrid.cpp:39
↓ 1 callersFunctionrotatedSearchHelper
cpp_solutions/chapter_10_sorting_and_searching/problem_10_03_rotatedSearch.h:34
↓ 1 callersFunctionsearchInsertion
cpp_solutions/chapter_01_arrays_and_strings/problem_01_05_oneAway.cpp:34
↓ 1 callersFunctionsearchNoSizeHelper
cpp_solutions/chapter_10_sorting_and_searching/problem_10_04_searchNoSize.cpp:6
↓ 1 callersFunctionsearchReplacement
cpp_solutions/chapter_01_arrays_and_strings/problem_01_05_oneAway.cpp:57
↓ 1 callersFunctionsearch_insertion
(s1, s2)
python_solutions/chapter_01_arrays_and_strings/problem_01_05_one_away.py:31
← previousnext →101–200 of 453, ranked by callers