MCPcopy Create free account

hub / github.com/RodneyShag/Cracking-the-Coding-Interview_solutions / functions

Functions663 in github.com/RodneyShag/Cracking-the-Coding-Interview_solutions

⨍ Functions 663◇ Types & classes 302
↓ 2 callersMethodclearBitsIthrough0
(int num, int bit)
Common/common/BitFunctions.java:24
↓ 2 callersMethodconvert
(int index)
Chp. 07 - Object-Oriented Design/_7_09_Circular_Array/CircularArray.java:27
↓ 2 callersMethodcreateGraph
()
Common/common/GraphFunctions.java:67
↓ 2 callersMethodcreateMaze
(int rows, int cols)
Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/Tester.java:37
↓ 2 callersMethodcreateTree
()
Chp. 17 - More Problems (Hard)/_17_12_BiNode/Tester.java:32
↓ 2 callersMethodcreateTree
()
Common/common/TreeFunctions.java:15
↓ 2 callersMethoddequeueAny
()
Chp. 03 - Stacks and Queues/_3_6_Animal_Shelter/AnimalShelter.java:21
↓ 2 callersMethodfindPath
(final boolean[][] maze, int row, int col)
Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/RobotInAGrid.java:19
↓ 2 callersMethodgetBit
(int num, int bit)
Common/common/BitFunctions.java:6
↓ 2 callersMethodgetBit
(int num, int bit)
Chp. 05 - Bit Manipulation/_5_3_Flip_Bit_to_Win/FlipBitToWin.java:36
↓ 2 callersMethodgetFirst
()
Chp. 16 - More Problems (Moderate)/_16_25_LRU_Cache/DoublyLinkedList.java:32
↓ 2 callersMethodgetLastStack
()
Chp. 03 - Stacks and Queues/_3_3_Stack_of_Plates/StackOfPlates.java:39
↓ 2 callersMethodgetPreorder
(TreeNode node, StringBuffer sb)
Chp. 04 - Trees and Graphs/_4_10_Check_Subtree/CheckSubtree.java:18
↓ 2 callersMethodhashCodeOfKey
(K key)
Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Hash.java:27
↓ 2 callersMethodinitializeLists
(ArrayList<LinkedList<Cell<K, V>>> lists)
Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Hash.java:21
↓ 2 callersMethodinsert
(int x, RankNode root)
Chp. 10 - Sorting and Searching/_10_10_Rank_from_Stream/RankFromStream.java:29
↓ 2 callersMethodisFree
(boolean[][] maze, int row, int col)
Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/RobotInAGrid.java:68
↓ 2 callersMethodjoin
(BiNode node1, BiNode node2)
Chp. 17 - More Problems (Hard)/_17_12_BiNode/Converter.java:46
↓ 2 callersMethodmultiplyHelper
(int smaller, int bigger)
Chp. 08 - Recursion and Dynamic Programming/_8_05_Recursive_Multiply/RecursiveMultiply.java:16
↓ 2 callersMethodnegate2
(int a)
Chp. 16 - More Problems (Moderate)/_16_09_Operations/Operations.java:58
↓ 2 callersMethodoneEditInsert
(String s1, String s2)
Chp. 01 - Arrays and Strings/_1_5_One_Away/OneAway.java:35
↓ 2 callersMethodpeek
()
Chp. 03 - Stacks and Queues/__Intro_Queue/Queue.java:35
↓ 2 callersMethodpop
()
Chp. 03 - Stacks and Queues/_3_2_Stack_Min/StackMin.java:21
↓ 2 callersMethodprintInOrder
(TreeNode node)
Common/common/TreeFunctions.java:50
↓ 2 callersMethodprintPair
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_24_Pairs_with_Sum/PairsWithSum.java:52
↓ 2 callersMethodprintShelter
()
Chp. 03 - Stacks and Queues/_3_6_Animal_Shelter/AnimalShelter.java:48
↓ 2 callersMethodpush
(int d)
Chp. 08 - Recursion and Dynamic Programming/_8_06_Towers_of_Hanoi/Tower.java:18
↓ 2 callersMethodputDown
()
Chp. 15 - Threads and Locks/_15_3_Dining_Philosophers/Philosopher.java:60
↓ 2 callersMethodrand5
()
Chp. 16 - More Problems (Moderate)/_16_23_Rand7_from_Rand5/Rand7FromRand5.java:16
↓ 2 callersMethodshiftStacks
()
Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/QueueViaStacks.java:47
↓ 2 callersMethodswap
(int[] array, int left, int right)
Chp. 10 - Sorting and Searching/_10_11_Peaks_and_Valleys/PeaksAndValleys.java:20
↓ 2 callersMethodtest
(String str)
Chp. 17 - More Problems (Hard)/_17_05_Letters_and_Numbers/Tester.java:14
↓ 2 callersMethodtest
(int n)
Chp. 17 - More Problems (Hard)/_17_06_Count_of_2s/Tester.java:12
↓ 2 callersMethodtest
(String[] array)
Chp. 17 - More Problems (Hard)/_17_15_Longest_Word/Tester.java:14
↓ 2 callersMethodtest
(int a, int b)
Chp. 05 - Bit Manipulation/_5_6_Conversion/Tester.java:12
↓ 2 callersMethodtest
(double decimal)
Chp. 05 - Bit Manipulation/_5_2_Binary_to_String/Tester.java:12
↓ 2 callersMethodtest
(int num)
Chp. 05 - Bit Manipulation/_5_7_Pairwise_Swap/Tester.java:11
↓ 2 callersMethodtest
(int original)
Chp. 05 - Bit Manipulation/_5_4_Next_Number/Tester.java:12
↓ 2 callersMethodtest
(int[] sortedArray, int value)
Chp. 10 - Sorting and Searching/__Intro_Binary_Search/Tester.java:15
↓ 2 callersMethodtest
(int[] array)
Chp. 10 - Sorting and Searching/_10_11_Peaks_and_Valleys/Tester.java:14
↓ 2 callersMethodtest
(int[] input)
Chp. 10 - Sorting and Searching/_10_07_Missing_Int/Tester.java:14
↓ 2 callersMethodtest
(int[][] sortedMatrix, int num)
Chp. 10 - Sorting and Searching/_10_09_Sorted_Matrix_Search/Tester.java:16
↓ 2 callersMethodtest
(TreeNode tree)
Chp. 04 - Trees and Graphs/_4_05_Validate_BST/Tester.java:17
↓ 2 callersMethodtest
(int a, int b)
Chp. 16 - More Problems (Moderate)/_16_01_Number_Swapper/Tester.java:12
↓ 2 callersMethodtest
(int[] array)
Chp. 16 - More Problems (Moderate)/_16_17_Contiguous_Sequence/Tester.java:14
↓ 2 callersMethodtest
(int k, int shortLength, int longLength)
Chp. 16 - More Problems (Moderate)/_16_11_Diving_Board/Tester.java:14
↓ 2 callersMethodtest
(Node head, int k)
Chp. 02 - Linked Lists/_2_2_Return_Kth_to_Last/Tester.java:16
↓ 2 callersMethodtest
(Node head1, Node head2)
Chp. 02 - Linked Lists/_2_7_Intersection/Tester.java:26
↓ 2 callersMethodtest
(Node head)
Chp. 02 - Linked Lists/_2_1_Remove_Dups/Tester.java:15
↓ 2 callersMethodtest
(Node head, int partitionValue)
Chp. 02 - Linked Lists/_2_4_Partition/Tester.java:15
↓ 2 callersMethodtest
(Node head)
Chp. 02 - Linked Lists/_2_3_Delete_Middle_Node/Tester.java:15
↓ 2 callersMethodtest
(String s1, String s2)
Chp. 01 - Arrays and Strings/_1_2_Check_Permutations/Tester.java:12
↓ 2 callersMethodtest
(String original)
Chp. 01 - Arrays and Strings/_1_6_String_Compression/Tester.java:12
↓ 2 callersMethodtest
(String str)
Chp. 01 - Arrays and Strings/_1_4_Palindrome_Permutation/Tester.java:12
↓ 2 callersMethodtest
(int n)
Chp. 08 - Recursion and Dynamic Programming/_8_09_Parens/Tester.java:14
↓ 2 callersMethodtest
(int[] array)
Chp. 08 - Recursion and Dynamic Programming/_8_08_Permutations_with_Dups/Tester.java:14
↓ 2 callersMethodtest
(int a, int b)
Chp. 08 - Recursion and Dynamic Programming/_8_05_Recursive_Multiply/Tester.java:12
↓ 2 callersMethodtest
(int n)
Chp. 08 - Recursion and Dynamic Programming/_8_11_Coins/Tester.java:12
↓ 2 callersMethodtestForward
(Node num1_head, Node num2_head)
Chp. 02 - Linked Lists/_2_5_Sum_Lists/Tester.java:29
↓ 2 callersMethodtestMatrix
(int[][] matrix)
Chp. 01 - Arrays and Strings/_1_8_Zero_Matrix/Tester.java:22
↓ 2 callersMethodtestReverse
(Node num1_head, Node num2_head)
Chp. 02 - Linked Lists/_2_5_Sum_Lists/Tester.java:21
↓ 2 callersMethodtoString
()
Chp. 16 - More Problems (Moderate)/_16_24_Pairs_with_Sum/Pair.java:30
↓ 1 callersMethodBFS
(GraphNode node, int data)
Common/common/GraphFunctions.java:36
↓ 1 callersMethodDFS
(GraphNode node, int data)
Common/common/GraphFunctions.java:15
↓ 1 callersMethodIterative
(int[] sortedArray, int value)
Chp. 10 - Sorting and Searching/__Intro_Binary_Search/BinarySearch.java:10
↓ 1 callersMethodRecursive
(int[] sortedArray, int value)
Chp. 10 - Sorting and Searching/__Intro_Binary_Search/BinarySearch.java:30
↓ 1 callersMethodRecursiveHelper
(int[] array, int value, int start, int end)
Chp. 10 - Sorting and Searching/__Intro_Binary_Search/BinarySearch.java:35
↓ 1 callersMethodURLifyHelper
(String str, int trueLength)
Chp. 01 - Arrays and Strings/_1_3_URLify/Tester.java:11
↓ 1 callersMethodaddDirectedEdge
(String s1, String s2)
Chp. 04 - Trees and Graphs/_4_07_Build_Order/Graph.java:11
↓ 1 callersMethodaddForwardOrder
(Node m, Node n)
Chp. 02 - Linked Lists/_2_5_Sum_Lists/SumLists.java:36
↓ 1 callersMethodaddNode
(String str)
Chp. 04 - Trees and Graphs/_4_07_Build_Order/Graph.java:17
↓ 1 callersMethodaddNum
(int n)
Chp. 17 - More Problems (Hard)/_17_20_Continuous_Median/ContinuousMedian.java:19
↓ 1 callersMethodaddParenthesis
(char[] expression, int index, int leftRem, int rightRem, List<String> solutions)
Chp. 08 - Recursion and Dynamic Programming/_8_09_Parens/Parens.java:14
↓ 1 callersMethodaddReverseOrder
(Node m, Node n)
Chp. 02 - Linked Lists/_2_5_Sum_Lists/SumLists.java:9
↓ 1 callersMethodadd_version2
(int a, int b)
Chp. 17 - More Problems (Hard)/_17_01_Add_Without_Plus/AddWithoutPlus.java:71
↓ 1 callersMethodallLengths
(int k, int shorter, int longer)
Chp. 16 - More Problems (Moderate)/_16_11_Diving_Board/DivingBoard.java:8
↓ 1 callersMethodallPaths
(boolean[][] maze, int row, int col)
Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/RobotInAGrid.java:85
↓ 1 callersMethodallSequences
(TreeNode node)
Chp. 04 - Trees and Graphs/_4_09_BST_Sequences/BSTSequences.java:9
↓ 1 callersMethodbasicCompression
(String str)
Chp. 01 - Arrays and Strings/_1_6_String_Compression/StringCompression.java:9
↓ 1 callersMethodbinarySearch
(Listy listy, int value, int start, int end)
Chp. 10 - Sorting and Searching/_10_04_Sorted_Search_No_Size/SortedSearchNoSize.java:14
↓ 1 callersMethodbitSetToInt
(BitSet bitset)
Chp. 17 - More Problems (Hard)/_17_04_Missing_Number/MissingNumber.java:64
↓ 1 callersMethodbitsRequired
(int A, int B)
Chp. 05 - Bit Manipulation/_5_6_Conversion/Conversion.java:8
↓ 1 callersMethodbubbleSort
(int[] array)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:18
↓ 1 callersMethodbuildList
(BiNode n)
Chp. 17 - More Problems (Hard)/_17_12_BiNode/Converter.java:23
↓ 1 callersMethodbuildMap
(String[] words)
Chp. 16 - More Problems (Moderate)/_16_20_T9__HashMap_Solution/T9.java:26
↓ 1 callersMethodbuildMaxHeap
(int[] A)
Chp. 10 - Sorting and Searching/__Intro_Sorts/Sorts.java:179
↓ 1 callersMethodbuildSet
(int[] array)
Chp. 16 - More Problems (Moderate)/_16_21_Sum_Swap/SumSwap.java:27
↓ 1 callersMethodbuildSolution
(HashMap<String, String> backtrackMap, String currWord)
Chp. 17 - More Problems (Hard)/_17_22_Word_Transformer/WordTransformer.java:77
↓ 1 callersMethodcalculateFactorial
(long num)
Chp. 16 - More Problems (Moderate)/_16_05_Factorial_Zeros/Tester.java:18
↓ 1 callersMethodcalculateSize
(Node head)
Common/common/ListFunctions.java:43
↓ 1 callersMethodcanBeAbove
(Box other)
Chp. 08 - Recursion and Dynamic Programming/_8_13_Stack_of_Boxes/Box.java:16
↓ 1 callersMethodcanBuildWord
(String word, boolean isOriginalWord, Map<String, Boolean> cache)
Chp. 17 - More Problems (Hard)/_17_15_Longest_Word/LongestWord.java:34
↓ 1 callersMethodcheckDuplicates
(int[] array)
Chp. 10 - Sorting and Searching/_10_08_Find_Duplicates/FindDuplicates.java:11
↓ 1 callersMethodcheckMatch
(String str, String pattern, int aLength, int bLength)
Chp. 16 - More Problems (Moderate)/_16_18_Pattern_Matching/PatternMatching.java:78
↓ 1 callersMethodcheckMatchRepeatingWord
(String str, String pattern)
Chp. 16 - More Problems (Moderate)/_16_18_Pattern_Matching/PatternMatching.java:67
↓ 1 callersMethodchew
()
Chp. 15 - Threads and Locks/_15_3_Dining_Philosophers/Philosopher.java:55
↓ 1 callersMethodcomputeHistogramVolume
(int[] height)
Chp. 17 - More Problems (Hard)/_17_21_Volume_of_Histogram/VolumeOfHistogram.java:9
↓ 1 callersMethodconnectNodes
(GraphNode node1, GraphNode node2)
Common/common/GraphFunctions.java:9
↓ 1 callersMethodconvert
(BiNode root)
Chp. 17 - More Problems (Hard)/_17_12_BiNode/Converter.java:35
↓ 1 callersMethodconvert
(String start, String end)
Chp. 17 - More Problems (Hard)/_17_22_Word_Transformer/WordTransformer.java:28
← previousnext →101–200 of 663, ranked by callers