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
↓ 1 callersFunctionprint_all_parentheses_internal
chapter-8-recursion-and-Dynamic-Programming/8-9-parens.cpp:4
↓ 1 callersMethodpush
Chapter-3-Stacks-and-Queues/3.2_stack_min.cpp:16
↓ 1 callersMethodpush
Chapter-3-Stacks-and-Queues/C++14/3.2-StackMin.cpp:12
↓ 1 callersFunctionquick
Ch 1.Arrays And Strings/10.Ouicksort.cpp:6
↓ 1 callersFunctionrandomSelect
We use the Reservoir sampling to get a node uniformly at random, WITHOUT knowing the total number of nodes. The idea is, do a whatever order of traver
Chapter-4-tree-and-graph/4.11_random_node.cpp:44
↓ 1 callersFunctionrecursive_multiply
The first method is rather simple and only add operation is used.*/
chapter-8-recursion-and-Dynamic-Programming/8.5_Recursive_Multiply.cpp:4
↓ 1 callersFunctionremoveDuplicates
Method 1 space complexity O(1) time complexity O(n^2) * [removeDuplicates Remove duplicates without using extra space] * @param head [head of list]
chapter-2-Linked-Lists/2-1-remove-dups.cpp:67
↓ 1 callersFunctionremoveDuplicates1
Method 2 space complexity - O(n) time complexity - O(n) * [removeDuplicates1 - Remove duplicates from the list using hash table] * @param head [head
chapter-2-Linked-Lists/2-1-remove-dups.cpp:92
↓ 1 callersFunctionremoveLoop
chapter-2-Linked-Lists/2-8-loop-detection.cpp:17
↓ 1 callersFunctionrotate1
Ch 1.Arrays And Strings/7.Rotate_matrix/7.rotate_matrix.cpp:29
↓ 1 callersFunctionrotate2
Ch 1.Arrays And Strings/7.Rotate_matrix/7.rotate_matrix.cpp:39
↓ 1 callersFunctionrouteBetwenNodes
Width visiting
Ch 4. Trees and Graphs/C++14/4.1-RouteBetweenNodes.cpp:13
↓ 1 callersFunctionrouteBetwenNodesR
Ch 4. Trees and Graphs/C++14/4.1-RouteBetweenNodes.cpp:70
↓ 1 callersFunctionrouteBetwenNodesWalker
Ch 4. Trees and Graphs/C++14/4.1-RouteBetweenNodes.cpp:51
↓ 1 callersFunctionrunNFamilies
Ch 6. Math and Logic Puzzles/7.The Apocalypse/The Apocalypse.cpp:25
↓ 1 callersFunctionsumsFrom
Ch 4. Trees and Graphs/C++14/4.12-PathsWithSum.cpp:11
↓ 1 callersFunctiontest
Ch 4. Trees and Graphs/C++14/4.1-RouteBetweenNodes.cpp:78
↓ 1 callersFunctiontoggle
Ch 1.Arrays And Strings/4.Palindrome_Permutation/4-pallindrome-permutations.cpp:127
↓ 1 callersFunctiontohIterative
Function to implement TOH puzzle
chapter-8-recursion-and-Dynamic-Programming/8.6_Tower_of_Hanoi.cpp:72
↓ 1 callersMethodtopologicalSort
The function to do Topological Sort. It uses recursive DFS()
Chapter-4-tree-and-graph/4.7_build_order.cpp:58
↓ 1 callersFunctiontreeFromArray
Ch 4. Trees and Graphs/C++14/4.2-MinimalTree.cpp:23
↓ 1 callersFunctionurlify
Ch 1.Arrays And Strings/3.URLify/URLify.cpp:17
↓ 1 callersMethodvalue
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:8
↓ 1 callersFunctionways
chapter-8-recursion-and-Dynamic-Programming/8-11-Coins.cpp:5
MethodAnimal
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:16
MethodBlackJackCard
Ch 7.OOD/1.Deck Of Cards/BlackJackCard.cpp:4
MethodBlackJackHand
Ch 7.OOD/1.Deck Of Cards/BlackJackHand.cpp:7
MethodCard
Ch 7.OOD/1.Deck Of Cards/card.cpp:16
MethodCat
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:68
MethodDFS
A recursive function used by topologicalSort
Chapter-4-tree-and-graph/4.7_build_order.cpp:40
MethodDog
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:60
MethodFixedMultiStack
Chapter-3-Stacks-and-Queues/3.1-Three-in-One/FixedMultiStack.cpp:3
MethodGraph
Constructor
Ch 4. Trees and Graphs/4-1-Route-Between-Nodes.cpp:19
MethodGraph
Implement the member functions
Chapter-4-tree-and-graph/4.7_build_order.cpp:28
MethodIterator
Ch 4. Trees and Graphs/C++14/treenodeiterator.hpp:92
MethodIteratorBase
Ch 4. Trees and Graphs/C++14/treenodeiterator.hpp:13
MethodIteratorBase
Ch 4. Trees and Graphs/C++14/treenodeiterator.hpp:47
MethodNode
chapter-2-Linked-Lists/2-4-partition.cpp:23
MethodNode
chapter-2-Linked-Lists/2-7-intersection.cpp:15
MethodNode
chapter-2-Linked-Lists/2-2-kthToLast.cpp:27
MethodNode
chapter-2-Linked-Lists/2-8-loop-detection.cpp:14
MethodNode
chapter-2-Linked-Lists/2-3-delete-middle-node.cpp:20
MethodNode
chapter-2-Linked-Lists/2-6-palindrome.cpp:17
MethodNode
chapter-2-Linked-Lists/2-5-add-lists.cpp:27
MethodNode
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:65
MethodNode
Chapter-3-Stacks-and-Queues/C++14/queue.hpp:71
MethodNode
Ch 4. Trees and Graphs/4-2-Minimal-Tree.cpp:8
MethodNode
Ch 4. Trees and Graphs/C++14/graph.hpp:34
MethodNode
Ch 4. Trees and Graphs/C++14/treenode.hpp:45
MethodNodeBase
Ch 4. Trees and Graphs/C++14/treenode.hpp:9
MethodNodeBase
Ch 4. Trees and Graphs/C++14/treenode.hpp:28
MethodPoint
chapter-8-recursion-and-Dynamic-Programming/8-2-Robot-in-a-Grid.cpp:12
MethodQueue
Chapter-3-Stacks-and-Queues/C++14/queue.hpp:7
MethodRandomNode
Ch 4. Trees and Graphs/C++14/4.11m-RandomTree.cpp:25
MethodRandomNode
Ch 4. Trees and Graphs/C++14/4.11-RandomNode.cpp:35
MethodSetOfStacks
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlates.cpp:57
MethodSetOfStacks
Chapter-3-Stacks-and-Queues/C++14/3.3-StackOfPlatesFU.cpp:148
MethodShelter
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:76
MethodSortedStack
Chapter-3-Stacks-and-Queues/C++14/3.5-SortStack.cpp:12
MethodStack
Chapter-3-Stacks-and-Queues/C++14/stack.hpp:7
MethodStack
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/Stack.cpp:3
MethodStackNode
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/StackNode.cpp:3
MethodTree
Ch 4. Trees and Graphs/C++14/4.11-RandomNode.cpp:21
Methodadd
Ch 4. Trees and Graphs/C++14/4.11m-RandomTree.cpp:91
FunctioncheckHeight
Ch 4. Trees and Graphs/4.4_Check_Balanced.cpp:1
FunctioncheckNode
Ch 4. Trees and Graphs/C++14/4.5-ValidateBST.cpp:8
FunctioncheckSubtree
Ch 4. Trees and Graphs/C++14/4.10r-CheckSubtree.cpp:19
FunctioncompareTrees
Ch 4. Trees and Graphs/C++14/4.10i-CheckSubtree.cpp:33
FunctioncompareTrees
Ch 4. Trees and Graphs/C++14/4.10r-CheckSubtree.cpp:27
FunctionconstainsTree
Chapter-4-tree-and-graph/4.10_check_subtree.cpp:44
FunctioncontainTree
Ch 4. Trees and Graphs/4.10_Check_Subtree.cpp:1
Methodcreate
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:47
FunctioncreateGraph
Ch 4. Trees and Graphs/C++14/graphtestutils.hpp:8
FunctioncreateMinBST
Ch 4. Trees and Graphs/4.2_Minimal_Tree.cpp:1
FunctionfindCommonAncestor
Ch 4. Trees and Graphs/C++14/4.8-FirstCommonAncestor.cpp:37
FunctionfindCommonAncestor
Ch 4. Trees and Graphs/C++14/4.8p-FirstCommonAncestor.cpp:29
FunctionfindNodeFrom
Ch 4. Trees and Graphs/C++14/4.8-FirstCommonAncestor.cpp:23
FunctionfindSuccessor
Ch 4. Trees and Graphs/4.6_Successor.cpp:8
Methodfor
Ch 7.OOD/1.Deck Of Cards/BlackJackHand.cpp:39
FunctiongetExampleGraph
Ch 4. Trees and Graphs/C++14/graphtestutils.hpp:20
FunctiongetExampleGraph2
Ch 4. Trees and Graphs/C++14/graphtestutils.hpp:27
FunctiongetExampleGraph3
Ch 4. Trees and Graphs/C++14/graphtestutils.hpp:34
FunctiongetHeight
Ch 4. Trees and Graphs/C++14/4.4-CheckBalanced.cpp:10
FunctiongetMin
Ch 4. Trees and Graphs/C++14/4.6-Successor.cpp:9
MethodgetMinimum
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/Stack.cpp:63
MethodgetOrder
Chapter-3-Stacks-and-Queues/C++14/3.6-AnimalShelter.cpp:31
FunctiongetSampleTree
Ch 4. Trees and Graphs/C++14/treetestutils.hpp:120
MethodgetSize
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/Stack.cpp:79
MethodindexOfTop
Chapter-3-Stacks-and-Queues/3.1-Three-in-One/FixedMultiStack.cpp:60
Functionis21
Ch 7.OOD/1.Deck Of Cards/BlackJackHand.cpp:70
MethodisAvailable
Ch 7.OOD/1.Deck Of Cards/card.cpp:30
FunctionisBalanced
Ch 4. Trees and Graphs/4.4_Check_Balanced.cpp:22
FunctionisBlackJack
Ch 7.OOD/1.Deck Of Cards/BlackJackHand.cpp:75
MethodisEmpty
Chapter-3-Stacks-and-Queues/C++14/queue.hpp:54
MethodisEmpty
Chapter-3-Stacks-and-Queues/3.2-Stack-Min/Stack.cpp:74
MethodisEmpty
Chapter-3-Stacks-and-Queues/3.1-Three-in-One/FixedMultiStack.cpp:50
MethodisEmpty
Ch 4. Trees and Graphs/C++14/tree.hpp:25
MethodisFull
Chapter-3-Stacks-and-Queues/3.1-Three-in-One/FixedMultiStack.cpp:55
FunctionisPermutationOfPalindrome
Ch 1.Arrays And Strings/3.Palindrome Permutation/Palindrome Permutation.cpp:53
FunctionisPermutationOfPalindrome_bitwise
Ch 1.Arrays And Strings/3.Palindrome Permutation/Palindrome Permutation.cpp:59
← previousnext →201–300 of 434, ranked by callers