MCPcopy Create free account

hub / github.com/careercup/ctci / functions

Functions1,645 in github.com/careercup/ctci

↓ 1 callersMethodisUniqueChars
(String str)
java/Chapter 1/Question1_1/Question.java:5
↓ 1 callersFunctionisUniqueChars2
using a boolean array
Go/Chapter 1/Question1_1/Question.go:20
↓ 1 callersMethodisUniqueChars2
(String str)
java/Chapter 1/Question1_1/Question.java:18
↓ 1 callersMethodisWithinStack
(int index, int total_size)
java/Chapter 3/Question3_1/StackData.java:14
↓ 1 callersMethodis_allowed
Check whether (row, column) is a valid spot. Return True if (row, column) is inside the bounds of the grid and has not been marked a
python/Chapter 9/Question9_02/robot_paths.py:44
↓ 1 callersMethodis_free
Check whether (row, column) is a valid square for a new queen. Returns False in case there already is a queen placed on the same row,
python/Chapter 9/Question9_09/queens_problem.py:50
↓ 1 callersMethoditerator
()
java/Chapter 14/Question14_6/CircularArray.java:35
↓ 1 callersMethodjoinTo
(LockNode node)
java/Chapter 16/Question16_4/LockNode.java:25
↓ 1 callersFunctionkth_to_last
(linkedlist, k)
python/Chapter 2/Question2_2.py:5
↓ 1 callersFunctionleftMostChild
(treenode)
python/Chapter 4/Question4_6/ChapQ4.6.py:119
↓ 1 callersMethodleftMostChild
(TreeNode n)
java/Chapter 4/Question4_6/Question.java:25
↓ 1 callersMethodleftOf
(int i)
java/Chapter 16/Question16_3/Question.java:6
↓ 1 callersMethodleftShift
(int index, boolean removeTop)
java/Chapter 3/Question3_3/SetOfStacks.java:44
↓ 1 callersMethodlem
()
java/Chapter 14/Introduction/Introduction.java:4
↓ 1 callersMethodlength
(self)
python/Chapter 3/Question3_5/ChapQ3.5.py:15
↓ 1 callersFunctionlengthOfLinkedlist
(linkedlist)
python/Chapter 2/Question2_7.py:52
↓ 1 callersMethodletterFromCode
TEST CODE
java/Chapter 17/Question17_5/Question.java:73
↓ 1 callersMethodlongestIncreasingSubsequence
(ArrayList<HtWt> array, ArrayList<HtWt>[] solutions, int current_index)
java/Chapter 11/Question11_7/Question.java:18
↓ 1 callersMethodmagicFast
(int[] array, int start, int end)
java/Chapter 9/Question9_3/Question.java:18
↓ 1 callersMethodmagicFast
(int[] array, int start, int end)
java/Chapter 9/Question9_3/QuestionB.java:18
↓ 1 callersFunctionmain
()
python/Chapter 4/Question4_7/Q4_7.py:80
↓ 1 callersFunctionmain
()
python/Chapter 4/Question4_9/Q4_9.py:49
↓ 1 callersMethodmakeChange1
(int n)
java/Chapter 9/Question9_8/Question.java:17
↓ 1 callersMethodmakeChange2
(int n)
java/Chapter 9/Question9_8/Question.java:22
↓ 1 callersFunctionmakeColRowAsNull
Function to make the entire row or column as 0 if any row or col val is 0
go/chapter01/question1.7/question1_7.go:34
↓ 1 callersMethodmakePartialRectangle
(int l, int h, Rectangle rectangle)
java/Chapter 18/Question18_13/Question.java:79
↓ 1 callersMethodmakeRectangle
(int length, int height)
java/Chapter 18/Question18_13/Question.java:57
↓ 1 callersFunctionmake_random_balanced_tree
(depth)
python/Chapter 4/Question4_1/ChapQ4.1.py:65
↓ 1 callersFunctionmake_random_balanced_tree
(depth)
python/Chapter 4/Question4_4/ChapQ4.4.py:56
↓ 1 callersFunctionmake_random_bsearch_tree
(depth = 3, l = -10, r = 10)
python/Chapter 4/Question4_5/ChapQ4.5.py:38
↓ 1 callersFunctionmake_random_bsearch_tree
(depth = 2, l = -10, r = 10, parent = None)
python/Chapter 4/Question4_6/ChapQ4.6.py:45
↓ 1 callersFunctionmake_random_btree
(depth = 3)
python/Chapter 4/Question4_5/ChapQ4.5.py:31
↓ 1 callersMethodmarkUnavailable
()
java/Chapter 8/Question8_1/Card.java:28
↓ 1 callersFunctionmatchTree
(r1,r2)
python/Chapter 4/Question4_8/ChapQ4.8.py:157
↓ 1 callersMethodmatchTree
(TreeNode r1, TreeNode r2)
java/Chapter 4/Question4_8/Question.java:32
↓ 1 callersMethodmatricesAreEqual
(int[][] m1, int[][] m2)
java/Chapter 1/Question1_7/Question.java:102
↓ 1 callersMethodmaxLevel
(TreeNode node)
java/CtCILibrary/CtCILibrary/BTreePrinter.java:76
↓ 1 callersMethodmaxRectangle
()
java/Chapter 18/Question18_13/Question.java:26
↓ 1 callersMethodmaxSubArray
(int array[], int N)
java/Chapter 18/Question18_12/QuestionC.java:37
↓ 1 callersMethodmaxSubMatrix
(int[][] matrix)
java/Chapter 18/Question18_12/QuestionC.java:13
↓ 1 callersMethodmerge
(int[] array, int[] helper, int low, int middle, int high)
java/Chapter 11/Introduction/MergeSort.java:20
↓ 1 callersMethodmerge
Merges array @param a first array @param b second array @param lastA number of "real" elements in a @param lastB number of "real" elements in b
java/Chapter 11/Question11_1/Question.java:14
↓ 1 callersMethodmergesort
(Stack<Integer> inStack)
java/Chapter 3/Question3_6/Question.java:9
↓ 1 callersMethodmergesort
(int[] array)
java/Chapter 11/Introduction/MergeSort.java:6
↓ 1 callersMethodmethodA
(String threadName)
java/Chapter 16/Question16_6/Foo.java:22
↓ 1 callersMethodmethodB
(String threadName)
java/Chapter 16/Question16_6/Foo.java:28
↓ 1 callersMethodminus
(int a, int b)
java/Chapter 7/Question7_4/Question.java:16
↓ 1 callersMethodmoveDisk
(self, size, fr, helper, to)
python/Chapter 3/Question3_4/Q3_4.py:13
↓ 1 callersMethodmoveDisks
(int n, Tower destination, Tower buffer)
java/Chapter 3/Question3_4/Tower.java:34
↓ 1 callersMethodmoveTopTo
(Tower t)
java/Chapter 3/Question3_4/Tower.java:25
↓ 1 callersFunctionnewTower
(i int)
Go/Chapter 3/Question3_4/Question.go:44
↓ 1 callersFunctionno_duplicates
Determine if str_ has all unique characters
python/Chapter 1/Question1_1/1-unique.py:11
↓ 1 callersFunctionno_duplicates_no_structures
Now without using additional data structures
python/Chapter 1/Question1_1/1-unique.py:15
↓ 1 callersFunctionnthToLast
if n = 2, find the 2nd element from the last node
Go/Chapter 2/Question2_2/Question.go:29
↓ 1 callersFunctionnthToLastHelper
* The algorithm is for single linked lists and can be used for doubly linkedlist too */ * Recursive helper function for the algorithm */
Go/Chapter 2/Question2_2/Question.go:17
↓ 1 callersMethodnthToLastR1
(LinkedListNode head, int n)
java/Chapter 2/Question2_2/Question.java:7
↓ 1 callersMethodnthToLastR3
(LinkedListNode head, int k)
java/Chapter 2/Question2_2/Question.java:44
↓ 1 callersMethodnthToLastR3Helper
(LinkedListNode head, int k)
java/Chapter 2/Question2_2/Question.java:30
↓ 1 callersMethodnumToString100
(int number)
java/Chapter 17/Question17_7/Question.java:33
↓ 1 callersMethodnumberOf2s
(int n)
java/Chapter 18/Question18_4/QuestionBrute.java:5
↓ 1 callersMethodnumberOf2sInRange
(int n)
java/Chapter 18/Question18_4/QuestionBrute.java:16
↓ 1 callersMethodnumberOfElements
()
java/Chapter 3/Question3_1/QuestionB.java:43
↓ 1 callersMethodnumberOfFiles
()
java/Chapter 8/Question8_9/Directory.java:25
↓ 1 callersFunctionpairs
(seq)
python/Chapter 1/Question1_1/alluniq.py:9
↓ 1 callersFunctionparentheses
Return a generator of all the combinations of n-pairs of parentheses.
python/Chapter 9/Question9_06/parentheses.py:16
↓ 1 callersMethodpark
(Vehicle v)
java/Chapter 8/Question8_4/ParkingSpot.java:28
↓ 1 callersMethodparkInSpot
(ParkingSpot spot)
java/Chapter 8/Question8_4/Vehicle.java:20
↓ 1 callersMethodparkStartingAtSpot
(int spotNumber, Vehicle vehicle)
java/Chapter 8/Question8_4/Level.java:46
↓ 1 callersMethodparkVehicle
(Vehicle vehicle)
java/Chapter 8/Question8_4/ParkingLot.java:15
↓ 1 callersMethodparseOptimized
(int wordStart, int wordEnd, Hashtable<Integer, Integer> cache)
java/Chapter 17/Question17_14/Question.java:46
↓ 1 callersFunctionpartition
(linkedlist, x)
python/Chapter 2/Question2_4.py:3
↓ 1 callersMethodpartition
(LinkedListNode node, int x)
java/Chapter 2/Question2_4/QuestionC.java:7
↓ 1 callersMethodpartition
(LinkedListNode node, int x)
java/Chapter 2/Question2_4/Question.java:7
↓ 1 callersMethodpartition
(LinkedListNode node, int x)
java/Chapter 2/Question2_4/QuestionB.java:7
↓ 1 callersMethodpartition
(int arr[], int left, int right)
java/Chapter 11/Introduction/Quicksort.java:12
↓ 1 callersMethodpartitionAndSearch
(int[][] matrix, Coordinate origin, Coordinate dest, Coordinate pivot, int elem)
java/Chapter 11/Question11_6/QuestionB.java:6
↓ 1 callersFunctionpeek
(stackNum int)
Go/Chapter 3/Question3_1/Question.go:44
↓ 1 callersMethodpeek_front
(self)
python/Chapter 3/Question3_5/3_5.py:24
↓ 1 callersFunctionpermutation
* Given two strings, decide if one is a permutation of the other */
Go/Chapter 1/Question1_3/Question.go:26
↓ 1 callersMethodpermutation
(String s, String t)
java/Chapter 1/Question1_3/Question.java:10
↓ 1 callersMethodpermutation
(String s, String t)
java/Chapter 1/Question1_3/QuestionB.java:4
↓ 1 callersFunctionpermutations
Return a generator of all the permutations of the string.
python/Chapter 9/Question9_05/permutations.py:15
↓ 1 callersMethodpickMIteratively
(int[] original, int m)
java/Chapter 18/Question18_3/QuestionAlternate.java:33
↓ 1 callersMethodpickMRandomly
(int[] original, int m)
java/Chapter 18/Question18_3/Question.java:14
↓ 1 callersMethodpickUp
()
java/Chapter 16/Question16_3/Philosopher.java:29
↓ 1 callersMethodplace
Place a queen on square (row, column).
python/Chapter 9/Question9_09/queens_problem.py:46
↓ 1 callersMethodplaceColor
(int row, int column, Color color)
java/Chapter 8/Question8_8/Board.java:27
↓ 1 callersMethodplaceQueens
(int row, Integer[] columns, ArrayList<Integer[]> results)
java/Chapter 9/Question9_9/Question.java:35
↓ 1 callersMethodplayAllHands
()
java/Chapter 8/Question8_1/BlackJackGameAutomator.java:56
↓ 1 callersMethodplayHand
(int i)
java/Chapter 8/Question8_1/BlackJackGameAutomator.java:40
↓ 1 callersMethodplayHanoi
(self)
python/Chapter 3/Question3_4/Q3_4.py:8
↓ 1 callersMethodplayPiece
(int row, int column)
java/Chapter 8/Question8_8/Player.java:13
↓ 1 callersMethodplayRandom
()
java/Chapter 8/Question8_8/Automator.java:58
↓ 1 callersFunctionpop
( stackNum int )
Go/Chapter 3/Question3_1/Question.go:35
↓ 1 callersMethodpop
()
java/Chapter 3/Question3_2/StackWithMin2.java:19
↓ 1 callersMethodpop
()
java/Chapter 3/Question3_3/SetOfStacks.java:31
↓ 1 callersMethodpopAt
(self, index)
python/Chapter 3/Question3_3/Q3_3.py:22
↓ 1 callersMethodpossibleScores
()
java/Chapter 8/Question8_1/BlackJackHand.java:24
↓ 1 callersFunctionpotentialCompressString
Function to compress the string [potential]
go/chapter01/question1.5/question1_5.go:75
↓ 1 callersMethodprecomputeMatrix
(int[][] matrix)
java/Chapter 18/Question18_12/QuestionB.java:28
← previousnext →701–800 of 1,645, ranked by callers