Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/RodneyShag/Cracking-the-Coding-Interview_solutions
/ functions
Functions
663 in github.com/RodneyShag/Cracking-the-Coding-Interview_solutions
⨍
Functions
663
◇
Types & classes
302
↓ 38 callers
Method
add
(int data)
Chp. 03 - Stacks and Queues/__Intro_Queue/Queue.java:11
↓ 35 callers
Method
print
()
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:51
↓ 33 callers
Method
isEmpty
(int stackNum)
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:42
↓ 28 callers
Method
toString
()
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/Node.java:18
↓ 26 callers
Method
get
(K key)
Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Hash.java:55
↓ 25 callers
Method
add
(int a, int b)
Chp. 17 - More Problems (Hard)/_17_01_Add_Without_Plus/AddWithoutPlus.java:20
↓ 24 callers
Method
get
(int pos)
Chp. 10 - Sorting and Searching/_10_07_Missing_Int/MyBitSet.java:25
↓ 24 callers
Method
put
(int key, String value)
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/LRUCache.java:27
↓ 23 callers
Method
printList
(Node head)
Common/common/ListFunctions.java:6
↓ 22 callers
Method
size
()
Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/QueueViaStacks.java:19
↓ 21 callers
Method
max
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_07_Number_Max/NumberMax.java:17
↓ 19 callers
Method
min
()
Chp. 03 - Stacks and Queues/_3_2_Stack_Min/StackMin.java:33
↓ 17 callers
Method
print
(BiNode n)
Chp. 17 - More Problems (Hard)/_17_12_BiNode/Tester.java:49
↓ 17 callers
Method
size
()
Chp. 17 - More Problems (Hard)/_17_18_Shortest_Supersequence/Range.java:28
↓ 14 callers
Method
add
(T item)
Chp. 04 - Trees and Graphs/_4_11_Random_Node/RandomizedCollection.java:12
↓ 14 callers
Method
get
(int key)
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/LRUCache.java:43
↓ 14 callers
Method
put
(K key, V value)
Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Hash.java:31
↓ 12 callers
Method
add
(String str)
Chp. 16 - More Problems (Moderate)/_16_20_T9__Trie_Solution/Trie.java:16
↓ 12 callers
Method
push
(int data)
Chp. 03 - Stacks and Queues/__Intro_Stack/Stack.java:10
↓ 12 callers
Method
push
(int value, int stackNum)
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:13
↓ 11 callers
Method
contains
(T item)
Chp. 04 - Trees and Graphs/_4_11_Random_Node/RandomizedCollection.java:47
↓ 11 callers
Method
createBST
()
Common/common/TreeFunctions.java:32
↓ 10 callers
Method
remove
()
Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/QueueViaStacks.java:27
↓ 10 callers
Method
remove
()
Chp. 03 - Stacks and Queues/__Intro_Queue/Queue.java:22
↓ 10 callers
Method
remove
(int key)
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/LRUCache.java:37
↓ 9 callers
Method
peek
()
Chp. 03 - Stacks and Queues/__Intro_Stack/Stack.java:26
↓ 8 callers
Method
add
(T item)
Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/QueueViaStacks.java:23
↓ 8 callers
Method
addNeighbor
(GraphNode neighbor)
Common/common/GraphNode.java:30
↓ 8 callers
Method
equals
(Object obj)
Chp. 16 - More Problems (Moderate)/_16_24_Pairs_with_Sum/Pair.java:14
↓ 8 callers
Method
size
()
Chp. 10 - Sorting and Searching/_10_07_Missing_Int/MyBitSet.java:49
↓ 8 callers
Method
test
(int a, int b)
Chp. 17 - More Problems (Hard)/_17_01_Add_Without_Plus/Tester.java:29
↓ 8 callers
Method
test_2
(int a, int b)
Chp. 17 - More Problems (Hard)/_17_01_Add_Without_Plus/Tester.java:33
↓ 8 callers
Method
toString
()
Chp. 17 - More Problems (Hard)/_17_18_Shortest_Supersequence/Range.java:32
↓ 7 callers
Method
areEquivalent
(double a, double b)
Common/common/Line.java:52
↓ 7 callers
Method
sameLine
(Line line1, Line line2)
Common/common/LineFunctions.java:21
↓ 7 callers
Method
sort
(Stack<Integer> stack)
Chp. 03 - Stacks and Queues/_3_5_Sort_Stack/SortStack.java:8
↓ 7 callers
Method
swap
(int[] array, int i, int j)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:37
↓ 7 callers
Method
test
(int n)
Chp. 16 - More Problems (Moderate)/_16_08_English_Int/Tester.java:19
↓ 6 callers
Method
addFirst
(Node n)
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/DoublyLinkedList.java:14
↓ 6 callers
Method
addLeftChild
(int data)
Common/common/TreeNode.java:19
↓ 6 callers
Method
intersect
(Line line1, Line line2)
Common/common/LineFunctions.java:6
↓ 6 callers
Method
merge
(String[] words, String[] moreWords)
Chp. 01 - Arrays and Strings/__Intro_ArrayList/IntroArrayList.java:9
↓ 6 callers
Method
sign
(int a)
Chp. 16 - More Problems (Moderate)/_16_07_Number_Max/NumberMax.java:12
↓ 5 callers
Method
arrayOffset
(int stackNum)
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:46
↓ 5 callers
Method
printImage
(int[][] image)
Common/common/Functions.java:6
↓ 5 callers
Method
push
(int x)
Chp. 03 - Stacks and Queues/_3_2_Stack_Min/StackMin.java:13
↓ 5 callers
Method
set
(int pos)
Chp. 10 - Sorting and Searching/_10_07_Missing_Int/MyBitSet.java:37
↓ 5 callers
Method
test
(String[] words, String word)
Chp. 10 - Sorting and Searching/_10_05_Sparse_Search/Tester.java:19
↓ 5 callers
Method
test
(String value, String pattern)
Chp. 16 - More Problems (Moderate)/_16_18_Pattern_Matching/Tester.java:15
↓ 5 callers
Method
test
(int steps)
Chp. 08 - Recursion and Dynamic Programming/_8_01_Triple_Step/Tester.java:15
↓ 5 callers
Method
visit
()
Common/common/GraphNode.java:22
↓ 4 callers
Method
addRightChild
(int data)
Common/common/TreeNode.java:26
↓ 4 callers
Method
commonAnc
(TreeNode root, TreeNode p, TreeNode q)
Chp. 04 - Trees and Graphs/_4_08_First_Common_Ancestor/FirstCommonAncestor.java:22
↓ 4 callers
Method
enqueue
(Animal animal)
Chp. 03 - Stacks and Queues/_3_6_Animal_Shelter/AnimalShelter.java:12
↓ 4 callers
Method
flip
(int bit)
Chp. 16 - More Problems (Moderate)/_16_07_Number_Max/NumberMax.java:7
↓ 4 callers
Method
getBit
(int num, int bit)
Chp. 17 - More Problems (Hard)/_17_01_Add_Without_Plus/AddWithoutPlus.java:97
↓ 4 callers
Method
getChild
(char ch)
Chp. 16 - More Problems (Moderate)/_16_20_T9__Trie_Solution/TrieNode.java:15
↓ 4 callers
Method
iLeftChild
(int i)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:209
↓ 4 callers
Method
merge
(int[] a, int[] b, int lastA, int lastB)
Chp. 10 - Sorting and Searching/_10_01_Sorted_Merge/SortedMerge.java:9
↓ 4 callers
Method
pause
()
Chp. 15 - Threads and Locks/_15_3_Dining_Philosophers/Philosopher.java:67
↓ 4 callers
Method
peek
(int stackNum)
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:34
↓ 4 callers
Method
pop
()
Chp. 03 - Stacks and Queues/__Intro_Stack/Stack.java:16
↓ 4 callers
Method
swap
(int[][] image, int r1, int c1, int r2, int c2)
Chp. 01 - Arrays and Strings/_1_7_Rotate_Matrix/RotateMatrix.java:34
↓ 4 callers
Method
test
(int n)
Chp. 16 - More Problems (Moderate)/_16_05_Factorial_Zeros/Tester.java:14
↓ 4 callers
Method
test
(Node head)
Chp. 02 - Linked Lists/_2_6_Palindrome/Tester.java:17
↓ 4 callers
Method
test
(String s1, String s2)
Chp. 01 - Arrays and Strings/_1_5_One_Away/Tester.java:14
↓ 4 callers
Method
test
(int[][] image)
Chp. 01 - Arrays and Strings/_1_7_Rotate_Matrix/Tester.java:34
↓ 4 callers
Method
testDivide
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_09_Operations/Tester.java:34
↓ 4 callers
Method
testMultiply
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_09_Operations/Tester.java:29
↓ 4 callers
Method
testSign
(int n)
Chp. 16 - More Problems (Moderate)/_16_07_Number_Max/Tester.java:21
↓ 4 callers
Method
toString
()
Chp. 04 - Trees and Graphs/_4_07_Build_Order/Node.java:22
↓ 3 callers
Method
containsTree
(TreeNode t1, TreeNode t2)
Chp. 04 - Trees and Graphs/_4_10_Check_Subtree/CheckSubtree.java:8
↓ 3 callers
Method
elementAt
(int index)
Chp. 10 - Sorting and Searching/_10_04_Sorted_Search_No_Size/Listy.java:12
↓ 3 callers
Method
getBalance
()
Chp. 15 - Threads and Locks/__Intro_Examples/LockedATM.java:43
↓ 3 callers
Method
getNeighbors
()
Common/common/GraphNode.java:26
↓ 3 callers
Method
iRightChild
(int i)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:213
↓ 3 callers
Method
inOrderSucc
(TreeNode node)
Chp. 04 - Trees and Graphs/_4_06_Successor/Successor.java:11
↓ 3 callers
Method
pop
(int stackNum)
Chp. 03 - Stacks and Queues/_3_1_Three_in_One/ThreeInOne.java:25
↓ 3 callers
Method
remove
(T item)
Chp. 04 - Trees and Graphs/_4_11_Random_Node/RandomizedCollection.java:25
↓ 3 callers
Method
search
(Listy list, int value)
Chp. 10 - Sorting and Searching/_10_04_Sorted_Search_No_Size/SortedSearchNoSize.java:6
↓ 3 callers
Method
setBit
(int num, int bit)
Common/common/BitFunctions.java:10
↓ 3 callers
Method
swap
(int[] A, int i, int j)
Chp. 17 - More Problems (Hard)/_17_14_Smallest_K/SmallestK.java:81
↓ 3 callers
Method
test
(int[] array, int k)
Chp. 17 - More Problems (Hard)/_17_14_Smallest_K/Tester.java:17
↓ 3 callers
Method
test
(int[] array)
Chp. 17 - More Problems (Hard)/_17_10_Majority_Element/Tester.java:15
↓ 3 callers
Method
test
(String[] file, String s1, String s2)
Chp. 17 - More Problems (Hard)/_17_11_Word_Distance/Tester.java:18
↓ 3 callers
Method
test
(int num)
Chp. 06 - Math and Logic Puzzles/__Intro_Prime/Tester.java:14
↓ 3 callers
Method
test
(int num)
Chp. 05 - Bit Manipulation/_5_3_Flip_Bit_to_Win/Tester.java:13
↓ 3 callers
Method
test
(int[] array, int num)
Chp. 10 - Sorting and Searching/_10_10_Rank_from_Stream/Tester.java:24
↓ 3 callers
Method
test
(String s1, String s2)
Chp. 16 - More Problems (Moderate)/_16_15_Master_Mind/Tester.java:13
↓ 3 callers
Method
test
(int[] array)
Chp. 16 - More Problems (Moderate)/_16_16_Sub_Sort/Tester.java:15
↓ 3 callers
Method
test
(String str)
Chp. 01 - Arrays and Strings/_1_1_Is_Unique/Tester.java:13
↓ 3 callers
Method
test
(String s1, String s2)
Chp. 01 - Arrays and Strings/_1_9_String_Rotation/Tester.java:13
↓ 3 callers
Method
testMax
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_07_Number_Max/Tester.java:25
↓ 3 callers
Method
toString
()
Chp. 17 - More Problems (Hard)/_17_23_Max_Black_Square/Subsquare.java:16
↓ 3 callers
Method
toString
()
Chp. 16 - More Problems (Moderate)/_16_15_Master_Mind/Result.java:9
↓ 3 callers
Method
toString
()
Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/Point.java:35
↓ 2 callers
Method
addDirectedNeighbor
(Node neighbor)
Chp. 04 - Trees and Graphs/_4_07_Build_Order/Node.java:18
↓ 2 callers
Method
appendToTail
(int d)
Common/common/Node.java:28
↓ 2 callers
Method
bubbleDown
(int[] A, int start, int end)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:196
↓ 2 callers
Method
clearBit
(int num, int bit)
Common/common/BitFunctions.java:14
next →
1–100 of 663, ranked by callers