MCPcopy Create free account

hub / github.com/careercup/CtCI-6th-Edition-cpp / functions

Functions434 in github.com/careercup/CtCI-6th-Edition-cpp

⨍ Functions 434◇ Types & classes 73
↓ 53 callersMethodsize
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:53
↓ 27 callersMethodempty
Chapter-3-Stacks-and-Queues/3.2_stack_min.cpp:34
↓ 21 callersMethodpush
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:22
↓ 20 callersFunctionprintTree
Ch 4. Trees and Graphs/C++14/treetestutils.hpp:21
↓ 16 callersFunctioninsert
* [insert helper routine to insert new node at head] * @param head [current head of the list] * @param c [new node's data] */
chapter-2-Linked-Lists/2-6-palindrome.cpp:25
↓ 16 callersFunctioninsert
* [insert - insert a new node at head of the list] * @param head [head of the list] * @param data [new node's data] */
chapter-2-Linked-Lists/2-5-add-lists.cpp:35
↓ 13 callersMethodgetParent
Ch 4. Trees and Graphs/C++14/treenode.hpp:15
↓ 13 callersMethodpeek
Chapter-3-Stacks-and-Queues/C++14/3.4-QueueViaStacks.cpp:16
↓ 13 callersMethodsize
Number of used limited stacks
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlatesFU.cpp:47
↓ 12 callersMethodinsert
Ch 4. Trees and Graphs/C++14/4.11-RandomNode.cpp:60
↓ 11 callersFunctionmax
returns maximum of two integers */
Chapter-4-tree-and-graph/4.4_check_balanced.cpp:53
↓ 11 callersMethodpop
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:36
↓ 9 callersMethodaddEdge
Chapter-4-tree-and-graph/4.7_build_order.cpp:34
↓ 8 callersMethodtop
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/Stack.cpp:52
↓ 7 callersFunctiondeleteList
* [deleteList Helper routine to delete list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-5-add-lists.cpp:216
↓ 7 callersFunctionprintList
* [printList - print the list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-5-add-lists.cpp:45
↓ 6 callersMethodaddEdge
add a directed edge from x to y
Ch 4. Trees and Graphs/4-1-Route-Between-Nodes.cpp:26
↓ 6 callersFunctionbits
Ch 5. Bit Manipulation/C++14/bitutils.hpp:6
↓ 6 callersFunctionprintList
* [printList = helper routine to print the list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-6-palindrome.cpp:35
↓ 6 callersMethodsize
Number of limited stacks
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlates.cpp:37
↓ 6 callersFunctionswap
Function to swap values at two pointers */
chapter-8-recursion-and-Dynamic-Programming/8.7_Permutations_without_Dups.cpp:7
↓ 5 callersMethoddequeueCat
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:108
↓ 5 callersFunctiongetDepth
Ch 4. Trees and Graphs/C++14/4.8p-FirstCommonAncestor.cpp:11
↓ 5 callersFunctioninsert
chapter-2-Linked-Lists/2-8-loop-detection.cpp:50
↓ 5 callersMethodisEmpty
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:48
↓ 5 callersFunctiononeEditAway
Ch 1.Arrays And Strings/5.One_Away/5-one-edit-away.cpp:32
↓ 5 callersFunctiontranslate
Ch 1.Arrays And Strings/5.One_Away/5-one-edit-away.cpp:64
↓ 4 callersFunctiongetCharNumber
Ch 1.Arrays And Strings/3.Palindrome Permutation/Palindrome Permutation.cpp:8
↓ 4 callersMethodisEmpty
Chapter-3-Stacks-and-Queues/C++14/3.4-QueueViaStacks.cpp:30
↓ 4 callersMethodisEmpty
Chapter-3-Stacks-and-Queues/C++14/3.5-SortStack.cpp:35
↓ 4 callersMethodmin
Chapter-3-Stacks-and-Queues/3.2_stack_min.cpp:28
↓ 4 callersFunctionmoveDisk
Function to show the movement of disks
chapter-8-recursion-and-Dynamic-Programming/8.6_Tower_of_Hanoi.cpp:9
↓ 4 callersMethodpop
Chapter-3-Stacks-and-Queues/C++14/3.5-SortStack.cpp:29
↓ 4 callersMethodpopAt
O(N)
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlatesFU.cpp:36
↓ 4 callersFunctionprintList
* [printList Helper routine to print list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-1-remove-dups.cpp:37
↓ 4 callersMethodpush
Chapter-3-Stacks-and-Queues/C++14/3.5-SortStack.cpp:17
↓ 4 callersMethodsetLeftChild
Ch 4. Trees and Graphs/C++14/treenode.hpp:87
↓ 4 callersFunctionsubtreeFromArray
Ch 4. Trees and Graphs/C++14/4.2-MinimalTree.cpp:10
↓ 4 callersFunctionsum
Ch 17. Hard/Q17_01_Add_Without_Plus/addWithoutPlus.cpp:4
↓ 3 callersMethodadd
Ch 4. Trees and Graphs/C++14/4.11m-RandomTree.cpp:46
↓ 3 callersFunctionbegin
Ch 4. Trees and Graphs/C++14/treenodeiterator.hpp:113
↓ 3 callersFunctioncountBits
Ch 5. Bit Manipulation/C++14/bitutils.hpp:12
↓ 3 callersMethoddequeueAny
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:96
↓ 3 callersMethoddequeueDog
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:113
↓ 3 callersFunctionend
Ch 4. Trees and Graphs/C++14/treenodeiterator.hpp:119
↓ 3 callersFunctiongetCharIndex
Ch 1.Arrays And Strings/4.Palindrome_Permutation/4-pallindrome-permutations.cpp:23
↓ 3 callersMethodisEmpty
Chapter-3-Stacks-and-Queues/C++14/3.2-StackMin.cpp:37
↓ 3 callersFunctionmoveDisksBetweenTwoPoles
Function to implement legal movement between two poles
chapter-8-recursion-and-Dynamic-Programming/8.6_Tower_of_Hanoi.cpp:17
↓ 3 callersFunctionnextBiggerSmaller
Ch 5. Bit Manipulation/C++14/5.4-NextNumber.cpp:9
↓ 3 callersFunctiontestGraph
Ch 4. Trees and Graphs/C++14/4.1-RouteBetweenNodes.cpp:90
↓ 3 callersMethodtop
Chapter-3-Stacks-and-Queues/3.2_stack_min.cpp:37
↓ 3 callersFunctiontreeFromArray
Ch 4. Trees and Graphs/C++14/treetestutils.hpp:89
↓ 2 callersMethodadd
Chapter-3-Stacks-and-Queues/C++14/3.4-QueueViaStacks.cpp:11
↓ 2 callersMethodadd
Chapter-3-Stacks-and-Queues/C++14/queue.hpp:22
↓ 2 callersFunctionarePermutation
Ch 1.Arrays And Strings/2.Check Permutation/1.Check_Permutation.cpp:6
↓ 2 callersFunctionarePermutation_2
Ch 1.Arrays And Strings/2.Check Permutation/1.Check_Permutation.cpp:28
↓ 2 callersFunctioncheckSubtree
Ch 4. Trees and Graphs/C++14/4.10i-CheckSubtree.cpp:16
↓ 2 callersFunctioncreateMinimalBst
Chapter-4-tree-and-graph/4.10_check_subtree.cpp:9
↓ 2 callersMethodenqueue
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:80
↓ 2 callersFunctiongetListOfDepths
Ch 4. Trees and Graphs/C++14/4.3-ListOfDepths.cpp:14
↓ 2 callersFunctionheight
The function Compute the "height" of a tree. Height is the number of nodes along the longest path from the root node down to the farthest leaf
Chapter-4-tree-and-graph/4.4_check_balanced.cpp:61
↓ 2 callersFunctioninOrderString
Ch 4. Trees and Graphs/4.10_Check_Subtree.cpp:8
↓ 2 callersFunctioninOrderSuccessor
Chapter-4-tree-and-graph/4.6_successor.cpp:39
↓ 2 callersFunctioninsert
* [insert - insert a node at the head of list] * @param head [head of the list] * @param data [new node's data] */
chapter-2-Linked-Lists/2-1-remove-dups.cpp:25
↓ 2 callersMethodisAce
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:48
↓ 2 callersFunctionisDescendant
root1 is decsendent of root
Chapter-4-tree-and-graph/4.8_first_common_ancestor.cpp:25
↓ 2 callersMethodisFaceCard
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:53
↓ 2 callersMethodisRoute
isRoute function to determine if there is a route from x to y
Ch 4. Trees and Graphs/4-1-Route-Between-Nodes.cpp:31
↓ 2 callersFunctionisSubTree
Chapter-4-tree-and-graph/4.10_check_subtree.cpp:36
↓ 2 callersFunctioniter_swap
chapter-8-recursion-and-Dynamic-Programming/8.8_Permutations_with_Dups.cpp:8
↓ 2 callersFunctionlength
* [length - helper routine to return length of list] * @param head [list's head] * @return length of the list */
chapter-2-Linked-Lists/2-5-add-lists.cpp:164
↓ 2 callersFunctionlistLen
chapter-2-Linked-Lists/2-7-intersection.cpp:31
↓ 2 callersMethodmaxValue
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:36
↓ 2 callersMethodminValue
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:24
↓ 2 callersFunctionnullifyRow
Ch 1.Arrays And Strings/8.Zero_matrix/8.zero_matrix.cpp:14
↓ 2 callersFunctionpadList
* [padList - Helper routine for padding the shorter list] * @param list [Current list] * @param padding [number of padding required] */
chapter-2-Linked-Lists/2-5-add-lists.cpp:153
↓ 2 callersMethodpop
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlates.cpp:28
↓ 2 callersMethodpop
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlatesFU.cpp:26
↓ 2 callersFunctionprintList
chapter-2-Linked-Lists/2-4-partition.cpp:39
↓ 2 callersFunctionprintList
* [printList Helper routine to print list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-7-intersection.cpp:22
↓ 2 callersFunctionprintList
chapter-2-Linked-Lists/2-8-loop-detection.cpp:64
↓ 2 callersFunctionprintList
* [printList - Helper routine to print the list] * @param head [head of the list] */
chapter-2-Linked-Lists/2-3-delete-middle-node.cpp:27
↓ 2 callersFunctionprintMatrix
Ch 1.Arrays And Strings/8.Zero_matrix/8.zero_matrix.cpp:66
↓ 2 callersFunctionprintMatrix
Ch 1.Arrays And Strings/7.Rotate_matrix/7.rotate_matrix.cpp:51
↓ 2 callersMethodpush
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlates.cpp:16
↓ 2 callersMethodpush
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlatesFU.cpp:13
↓ 2 callersFunctionrandom_range
generate a random int between min and max * [random_range helper routine to generate a random number between min and max (including)] * @param min [
chapter-2-Linked-Lists/2-1-remove-dups.cpp:52
↓ 2 callersMethodremove
Chapter-3-Stacks-and-Queues/C++14/3.4-QueueViaStacks.cpp:23
↓ 2 callersMethodremove
Chapter-3-Stacks-and-Queues/C++14/queue.hpp:40
↓ 2 callersFunctionreverse
chapter-2-Linked-Lists/2-6-palindrome.cpp:50
↓ 2 callersMethodsetOrder
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:26
↓ 2 callersMethodsetRightChild
Ch 4. Trees and Graphs/C++14/treenode.hpp:93
↓ 2 callersMethodsetRoot
Ch 4. Trees and Graphs/C++14/tree.hpp:20
↓ 2 callersFunctiontest
Ch 4. Trees and Graphs/C++14/4.7d-BuildOrder.cpp:59
↓ 2 callersFunctiontest
Ch 4. Trees and Graphs/C++14/4.7-BuildOrder.cpp:47
↓ 1 callersFunctionMatchTree
Implemented the alternative approach described in the book.*/
Chapter-4-tree-and-graph/4.10_check_subtree.cpp:25
↓ 1 callersFunctionURLify
in this solution we are using C++ stl/std style */
Ch 1.Arrays And Strings/3.URLify/URLify2.cpp:6
↓ 1 callersFunction_printParenthesis
chapter-8-recursion-and-Dynamic-Programming/8.9_Parens.cpp:16
↓ 1 callersFunctionaddCardToScoreList
Ch 7.OOD/1.Deck Of Cards/BlackJackHand.cpp:4
↓ 1 callersMethodaddChild
Ch 4. Trees and Graphs/C++14/graph.hpp:44
next →1–100 of 434, ranked by callers