MCPcopy Create free account

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

Functions2,047 in github.com/careercup/CtCI-6th-Edition

↓ 2 callersMethodcomputeSimilarities
(HashMap<Integer, Document> documents)
Java/Ch 17. Hard/Q17_26_Sparse_Similarity/QuestionB.java:13
↓ 2 callersMethodconcat
(BiNode x, BiNode y)
Java/Ch 17. Hard/Q17_12_BiNode/QuestionA.java:33
↓ 2 callersMethodconcat
(BiNode x, BiNode y)
Java/Ch 17. Hard/Q17_12_BiNode/QuestionB.java:35
↓ 2 callersMethodcontainsTree
(TreeNode t1, TreeNode t2)
Java/Ch 04. Trees and Graphs/Q4_10_Check_Subtree/QuestionA.java:8
↓ 2 callersMethodcontainsTree
(TreeNode t1, TreeNode t2)
Java/Ch 04. Trees and Graphs/Q4_10_Check_Subtree/QuestionB.java:8
↓ 2 callersMethodconvertFromBase
(String number, int base)
Java/Introduction/CompareBinaryToHex/CompareBinaryToHex.java:16
↓ 2 callersMethodcountDP
(String exp, boolean result, int start, int end, HashMap<String, Integer> cache)
Java/Ch 08. Recursion and Dynamic Programming/Q8_14_Boolean_Evaluation/Others.java:211
↓ 2 callersMethodcountDPEff
(String exp, boolean result, int start, int end, HashMap<String, Integer> cache)
Java/Ch 08. Recursion and Dynamic Programming/Q8_14_Boolean_Evaluation/Others.java:276
↓ 2 callersMethodcountEval
(String s, boolean result)
Java/Ch 08. Recursion and Dynamic Programming/Q8_14_Boolean_Evaluation/QuestionA.java:9
↓ 2 callersMethodcountEval
(String s, boolean result, HashMap<String, Integer> memo)
Java/Ch 08. Recursion and Dynamic Programming/Q8_14_Boolean_Evaluation/QuestionB.java:12
↓ 2 callersMethodcountR
(String exp, boolean result, int start, int end)
Java/Ch 08. Recursion and Dynamic Programming/Q8_14_Boolean_Evaluation/Others.java:169
↓ 2 callersMethodcountWays
(int n)
Java/Ch 08. Recursion and Dynamic Programming/Q8_01_Triple_Step/QuestionA.java:5
↓ 2 callersMethodcountWays
(int n)
Java/Ch 08. Recursion and Dynamic Programming/Q8_01_Triple_Step/QuestionB.java:7
↓ 2 callersMethodcovers
(TreeNode root, TreeNode p, TreeNode q)
Java/Ch 04. Trees and Graphs/Q4_08_First_Common_Ancestor/Question.java:11
↓ 2 callersMethodcreateRandomEdge
(String code)
Java/Ch 07. Object-Oriented Design/Q7_06_Jigsaw/Question.java:9
↓ 2 callersMethodcreateStack
(ArrayList<Box> boxes)
Java/Ch 08. Recursion and Dynamic Programming/Q8_13_Stack_of_Boxes/QuestionA.java:7
↓ 2 callersMethoddeposit
(int value)
Java/Ch 15. Threads and Locks/IntroductionLocks/NoLockATM.java:20
↓ 2 callersMethoddepth
(TreeNode node)
Java/Ch 04. Trees and Graphs/Q4_08_First_Common_Ancestor/QuestionB.java:26
↓ 2 callersMethoddivide
(int a, int b)
Java/Ch 16. Moderate/Q16_09_Operations/Question.java:66
↓ 2 callersMethoddoTest
(Square s1, Square s2, Point start, Point end)
Java/Ch 16. Moderate/Q16_13_Bisect_Squares/Question.java:30
↓ 2 callersMethoddoesMatch
(String pattern, String value)
Java/Ch 16. Moderate/Q16_18_Pattern_Matcher/QuestionA.java:6
↓ 2 callersMethoddoesMatch
(String pattern, String value)
Java/Ch 16. Moderate/Q16_18_Pattern_Matcher/QuestionC.java:28
↓ 2 callersMethoddoesMatch
(String pattern, String value)
Java/Ch 16. Moderate/Q16_18_Pattern_Matcher/QuestionB.java:45
↓ 2 callersMethoddoesMatch
(String pattern, String value)
Java/Ch 16. Moderate/Q16_18_Pattern_Matcher/QuestionD.java:4
↓ 2 callersMethoddrawLine
()
Java/Ch 08. Recursion and Dynamic Programming/Q8_12_Eight_Queens/Question.java:70
↓ 2 callersMethodencodeEnd
(StringBuilder sb)
Java/Ch 16. Moderate/Q16_12_XML_Encoding/QuestionOO.java:12
↓ 2 callersMethodestimate
(String guess, String solution)
Java/Ch 16. Moderate/Q16_15_Master_Mind/Question.java:36
↓ 2 callersMethodfindClosest
(String[] words, String word1, String word2)
Java/Ch 17. Hard/Q17_11_Word_Distance/QuestionA.java:7
↓ 2 callersMethodfindClosest
(String word1, String word2, HashMapList<String, Integer> locations)
Java/Ch 17. Hard/Q17_11_Word_Distance/QuestionB.java:42
↓ 2 callersMethodfindLongestSubarray
(char[] array)
Java/Ch 17. Hard/Q17_05_Letters_and_Numbers/QuestionA.java:25
↓ 2 callersMethodfindLongestSubarray
(char[] array)
Java/Ch 17. Hard/Q17_05_Letters_and_Numbers/QuestionB.java:54
↓ 2 callersMethodfindPathBFS
(HashMap<Integer, Person> people, int source, int destination)
Java/Ch 09. Scalability and Memory Limits/Q9_02_Social_Network/QuestionA.java:10
↓ 2 callersMethodfindPathBiBFS
(HashMap<Integer, Person> people, int source, int destination)
Java/Ch 09. Scalability and Memory Limits/Q9_02_Social_Network/QuestionB.java:51
↓ 2 callersMethodfindSwapValues
(int[] array1, int[] array2)
Java/Ch 16. Moderate/Q16_21_Sum_Swap/QuestionA.java:13
↓ 2 callersMethodfindSwapValues
(int[] array1, int[] array2)
Java/Ch 16. Moderate/Q16_21_Sum_Swap/QuestionC.java:15
↓ 2 callersMethodfindSwapValues
(int[] array1, int[] array2)
Java/Ch 16. Moderate/Q16_21_Sum_Swap/QuestionB.java:4
↓ 2 callersMethodfindSwapValues
(int[] array1, int[] array2)
Java/Ch 16. Moderate/Q16_21_Sum_Swap/QuestionD.java:24
↓ 2 callersMethodflipCell
(Cell cell)
Java/Ch 07. Object-Oriented Design/Q7_10_Minesweeper/Board.java:122
↓ 2 callersMethodfloorToNearestEpsilon
(double d)
Java/Ch 16. Moderate/Q16_14_Best_Line/Line.java:28
↓ 2 callersMethodgenerateRandomArray
(int size)
Java/Ch 17. Hard/Q17_16_The_Masseuse/Tester.java:6
↓ 2 callersMethodgetChild
(char c)
Java/CtCILibrary/CtCILibrary/TrieNode.java:61
↓ 2 callersMethodgetChild
(char c)
Java/Ch 17. Hard/Q17_17_Multi_Search/TrieNode.java:52
↓ 2 callersMethodgetColumn
()
Java/Ch 07. Object-Oriented Design/Q7_08_Othello/Location.java:19
↓ 2 callersMethodgetColumn
(int i)
Java/Ch 17. Hard/Q17_25_Word_Rectangle/Rectangle.java:34
↓ 2 callersMethodgetFriends
()
Java/Ch 09. Scalability and Memory Limits/Q9_02_Social_Network/Person.java:15
↓ 2 callersMethodgetHeight
(TreeNode root)
Java/Ch 04. Trees and Graphs/Q4_04_Check_Balanced/QuestionBrute.java:8
↓ 2 callersMethodgetID
()
Java/Ch 07. Object-Oriented Design/Q7_05_Online_Book_Reader/User.java:17
↓ 2 callersMethodgetInstance
()
Java/Ch 07. Object-Oriented Design/Q7_08_Othello/Automator.java:23
↓ 2 callersMethodgetMax
(int a, int b)
Java/Ch 16. Moderate/Q16_07_Number_Max/Question.java:20
↓ 2 callersMethodgetMaxMatrix
(int[][] matrix)
Java/Ch 17. Hard/Q17_24_Max_Submatrix/QuestionA.java:6
↓ 2 callersMethodgetMaxMatrix
(int[][] matrix)
Java/Ch 17. Hard/Q17_24_Max_Submatrix/QuestionC.java:6
↓ 2 callersMethodgetMaxMatrix
(int[][] matrix)
Java/Ch 17. Hard/Q17_24_Max_Submatrix/QuestionB.java:6
↓ 2 callersMethodgetMaxNaive
(int a, int b)
Java/Ch 16. Moderate/Q16_07_Number_Max/Question.java:14
↓ 2 callersMethodgetMaxSequence
(int[] sequences)
Java/Ch 05. Bit Manipulation/Q5_03_Flip_Bit_to_Win/QuestionC.java:9
↓ 2 callersMethodgetName
()
Java/Ch 07. Object-Oriented Design/Q7_12_Hash_Table/Dummy.java:20
↓ 2 callersMethodgetNext
(int n)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionB.java:5
↓ 2 callersMethodgetNextArith
(int n)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionC.java:4
↓ 2 callersMethodgetNextSlow
(int i)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionA.java:49
↓ 2 callersMethodgetNodes
()
Java/Ch 04. Trees and Graphs/Q4_01_Route_Between_Nodes/Graph.java:21
↓ 2 callersMethodgetNumber
()
Java/Ch 15. Threads and Locks/Q15_03_Dining_Philosophers/QuestionB/Chopstick.java:23
↓ 2 callersMethodgetOrCreateNode
(String name)
Java/Ch 04. Trees and Graphs/Q4_07_Build_Order/DFS/Graph.java:10
↓ 2 callersMethodgetOrderString
(TreeNode node, StringBuilder sb)
Java/Ch 04. Trees and Graphs/Q4_10_Check_Subtree/QuestionA.java:18
↓ 2 callersMethodgetPath
(boolean[][] maze)
Java/Ch 08. Recursion and Dynamic Programming/Q8_02_Robot_in_a_Grid/QuestionA.java:9
↓ 2 callersMethodgetPath
(boolean[][] maze)
Java/Ch 08. Recursion and Dynamic Programming/Q8_02_Robot_in_a_Grid/QuestionB.java:10
↓ 2 callersMethodgetPopulation
(List<Country> countries, String continent)
Java/Ch 13. Java/Q13_07_Lambda_Expressions/QuestionA.java:8
↓ 2 callersMethodgetPopulation
(List<Country> countries, String continent)
Java/Ch 13. Java/Q13_07_Lambda_Expressions/QuestionC.java:8
↓ 2 callersMethodgetPopulation
(List<Country> countries, String continent)
Java/Ch 13. Java/Q13_07_Lambda_Expressions/QuestionB.java:8
↓ 2 callersMethodgetPrev
(int n)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionB.java:50
↓ 2 callersMethodgetPrevArith
(int n)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionC.java:34
↓ 2 callersMethodgetPrevSlow
(int i)
Java/Ch 05. Bit Manipulation/Q5_04_Next_Number/QuestionA.java:61
↓ 2 callersMethodgetRank
(int d)
Java/Ch 10. Sorting and Searching/Q10_10_Rank_from_Stream/RankNode.java:29
↓ 2 callersMethodgetRightMaxIndex
()
Java/Ch 17. Hard/Q17_21_Volume_of_Histogram/HistogramData.java:16
↓ 2 callersMethodgetRoot
()
Java/Ch 17. Hard/Q17_17_Multi_Search/Trie.java:16
↓ 2 callersMethodgetRow
()
Java/Ch 07. Object-Oriented Design/Q7_08_Othello/Location.java:15
↓ 2 callersMethodgetSibling
(TreeNode node)
Java/Ch 04. Trees and Graphs/Q4_08_First_Common_Ancestor/QuestionC.java:31
↓ 2 callersMethodgetSortedYears
(Person[] people, boolean copyBirthYear)
Java/Ch 16. Moderate/Q16_10_Living_People/QuestionC.java:37
↓ 2 callersMethodgetSpotsNeeded
()
Java/Ch 07. Object-Oriented Design/Q7_04_Parking_Lot/Vehicle.java:11
↓ 2 callersMethodgetTagCode
(String tag)
Java/Ch 16. Moderate/Q16_12_XML_Encoding/QuestionString.java:158
↓ 2 callersMethodgetTailAndSize
(LinkedListNode list)
Java/Ch 02. Linked Lists/Q2_07_Intersection/Question.java:17
↓ 2 callersMethodgetWildcardRoots
(String word)
Java/Ch 17. Hard/Q17_22_Word_Transformer/QuestionC.java:72
↓ 2 callersMethodgetWildcardRoots
(String w)
Java/Ch 17. Hard/Q17_22_Word_Transformer/QuestionB.java:56
↓ 2 callersMethodgetWord
()
Java/Ch 17. Hard/Q17_22_Word_Transformer/PathNode.java:13
↓ 2 callersMethodgetWordLocations
(String[] words)
Java/Ch 17. Hard/Q17_11_Word_Distance/QuestionB.java:11
↓ 2 callersMethodgetYFromX
(double x)
Java/Ch 16. Moderate/Q16_03_Intersection/Line.java:29
↓ 2 callersMethodhasNext
()
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/PositionIterator.java:16
↓ 2 callersMethodhasNext
()
Java/Ch 07. Object-Oriented Design/Q7_09_Circular_Array/CircularArray.java:44
↓ 2 callersMethodhasWon
(Piece[][] board)
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/QuestionC.java:13
↓ 2 callersMethodhasWon
(Piece[][] board, int row, int column)
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/QuestionB.java:7
↓ 2 callersMethodhasWon
(Piece[][] board)
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/QuestionD.java:13
↓ 2 callersMethodhasWonB
(Piece[][] board)
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/Tester.java:19
↓ 2 callersMethodhasWonDiagonal
(Piece[][] board, int direction)
Java/Ch 16. Moderate/Q16_04_Tic_Tac_Win/QuestionB.java:46
↓ 2 callersMethodinbounds
(int[][] matrix)
Java/Ch 10. Sorting and Searching/Q10_09_Sorted_Matrix_Search/Coordinate.java:11
↓ 2 callersMethodincrementHashTable
(HashMap<Integer, Integer> hashTable, int key, int delta)
Java/Ch 04. Trees and Graphs/Q4_12_Paths_with_Sum/QuestionB.java:37
↓ 2 callersMethodincrementIfFound
(int v)
Java/Ch 17. Hard/Q17_18_Shortest_Supersequence/QuestionE.java:23
↓ 2 callersMethodinitialize
()
Java/Ch 07. Object-Oriented Design/Q7_08_Othello/Board.java:12
↓ 2 callersMethodinitialize
()
Java/Ch 07. Object-Oriented Design/Q7_10_Minesweeper/Game.java:23
↓ 2 callersMethodinsertAtFrontOfLinkedList
(LinkedListNode node)
Java/Ch 16. Moderate/Q16_25_LRU_Cache/Cache.java:51
↓ 2 callersMethodinsertString
(String str, int location)
Java/Ch 17. Hard/Q17_17_Multi_Search/Trie.java:12
↓ 2 callersMethodintersection
(Point start1, Point end1, Point start2, Point end2)
Java/Ch 16. Moderate/Q16_03_Intersection/Question.java:19
↓ 2 callersMethodisBalanced
(TreeNode root)
Java/Ch 04. Trees and Graphs/Q4_04_Check_Balanced/QuestionImproved.java:24
← previousnext →301–400 of 2,047, ranked by callers