MCPcopy Create free account

hub / github.com/codingforinterviews/practice-problems / functions

Functions90 in github.com/codingforinterviews/practice-problems

↓ 5 callersMethodcountOptimal
(int[] coins, int amt)
coin_change/solutions/CoinChangeSolution.java:27
↓ 4 callersMethodcountRecursive
(int coins[], int c, int sum)
coin_change/solutions/CoinChangeSolution.java:41
↓ 3 callersFunctioncanMakeSum
(array, targetSum)
target_sum/solutions/solution.js:1
↓ 3 callersMethodcontainsCycle
()
linked_list_cycle/solutions/LinkedListCycle.java:8
↓ 3 callersMethodgetOrCreate
(Integer value, Map<Node<Integer>, Node<Integer>> map)
tree_zig_zag/solutions/TreeZigZag.java:93
↓ 3 callersMethodget_vertex
(cls, value, vertices)
tree_zig_zag/solutions/tree_zig_zag.py:32
↓ 3 callersFunctionisBalanced
(delimiterString)
balanced_delimiter/solutions/balanced_delimiter.js:21
↓ 3 callersMethodsolve
(set, n)
array_rotate/solutions/keppy.rb:3
↓ 2 callersMethodcanRansom
(String magazine, String ransom)
ransom/Ransom.java:5
↓ 2 callersMethodequals
(Object o)
tree_zig_zag/solutions/TreeZigZag.java:40
↓ 2 callersMethodgetLeft
()
tree_zig_zag/solutions/TreeZigZag.java:30
↓ 2 callersMethodgetRight
()
tree_zig_zag/solutions/TreeZigZag.java:32
↓ 1 callersMethodas_hackerrank_lines
(self)
tree_zig_zag/generator/generate_tree.py:34
↓ 1 callersMethodfactorial
(BigInteger n, BigInteger acc)
factorial/solutions/FactorialSolution.java:24
↓ 1 callersFunctionfib
Enter your code here. Read input from STDIN. Print output to STDOUT
fibonacci_lite/solutions/fibonacci.rb:2
↓ 1 callersFunctionfib
Naive implementation. We'll choose correctness over speed here.
fibonacci_lite/generator/gen_testcase.rb:2
↓ 1 callersFunctionfib
(n)
fibonacci_dynamic/solutions/fibonacci_dynamic.rb:4
↓ 1 callersFunctionfib
(n)
fibonacci_dynamic/generator/generate_cases.rb:2
↓ 1 callersMethodfind
(int[] nums)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:28
↓ 1 callersFunctionfindPermutations
(coins, n)
coin_change/solutions/coin_change_solution.js:14
↓ 1 callersMethodfindUncoupled
(int[] integers)
find_uncoupled_int/solutions/Solution.java:2
↓ 1 callersMethodfindUncoupledSet
(int[] integers)
find_uncoupled_int/solutions/Solution.java:10
↓ 1 callersFunctionfind_val
(side, depth)
tree_zig_zag/solutions/tree_zig_zag.rb:14
↓ 1 callersFunctionfind_val_r
(side, depth, node, level)
tree_zig_zag/solutions/tree_zig_zag.rb:18
↓ 1 callersFunctiongenerate_bst
(size, min_value=1, max_value=2 ** 31 - 1)
tree_zig_zag/generator/generate_tree.py:45
↓ 1 callersFunctiongenerate_pairs
This generates a valid delimiter string using a Markov chain-like process.
balanced_delimiter/generator/gen_testcase.rb:9
↓ 1 callersMethodgetCoins
(String line)
coin_change/solutions/CoinChangeSolution.java:58
↓ 1 callersMethodgetValue
()
tree_zig_zag/solutions/TreeZigZag.java:33
↓ 1 callersFunctionhashrand
Convenience function for picking a random value out of a hash.
balanced_delimiter/generator/gen_testcase.rb:4
↓ 1 callersFunctionisCloser
(character)
balanced_delimiter/solutions/balanced_delimiter.js:7
↓ 1 callersFunctionisOpener
(character)
balanced_delimiter/solutions/balanced_delimiter.js:11
↓ 1 callersFunctionis_bst
(node, min_value=1, max_value=2 ** 31 - 1)
tree_zig_zag/generator/generate_tree.py:69
↓ 1 callersFunctionmain
()
tree_zig_zag/solutions/tree_zig_zag.py:73
↓ 1 callersFunctionmain
()
tree_zig_zag/generator/generate_tree.py:77
↓ 1 callersFunctionmain
()
coin_change/solutions/coin_change_solution.py:31
↓ 1 callersFunctionmake_invalid
This randomly invalidates a delimiter string by introducing one of the following errors at a random position: - Delete a delimiter - Add a delimiter -
balanced_delimiter/generator/gen_testcase.rb:41
↓ 1 callersFunctionmatches
Some convenience functions for checking that delimiters are of the correct type for eachother. */
balanced_delimiter/solutions/balanced_delimiter.c:43
↓ 1 callersFunctionopener
balanced_delimiter/solutions/balanced_delimiter.c:56
↓ 1 callersFunctionpop
balanced_delimiter/solutions/balanced_delimiter.c:29
↓ 1 callersFunctionprocessData
(input)
coin_change/solutions/coin_change_solution.js:62
↓ 1 callersMethodprocessLevel
(List<Node<T>> level)
tree_zig_zag/solutions/TreeZigZag.java:85
↓ 1 callersFunctionpush
Stack methods. */
balanced_delimiter/solutions/balanced_delimiter.c:19
↓ 1 callersMethodreadTree
(InputStream in)
tree_zig_zag/solutions/TreeZigZag.java:107
↓ 1 callersMethodread_tree
(cls, stream)
tree_zig_zag/solutions/tree_zig_zag.py:41
↓ 1 callersMethodsearch
(Node<T> root)
tree_zig_zag/solutions/TreeZigZag.java:60
↓ 1 callersMethodsetLeft
(Node<T> left)
tree_zig_zag/solutions/TreeZigZag.java:29
↓ 1 callersMethodsetRight
(Node<T> right)
tree_zig_zag/solutions/TreeZigZag.java:31
↓ 1 callersFunctionsolve
(coins, amount)
coin_change/solutions/coin_change_solution.py:17
↓ 1 callersMethodtoIntArray
(String line)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:52
↓ 1 callersFunctionzig_zag_traverse
(root)
tree_zig_zag/solutions/tree_zig_zag.py:54
FunctionBSTNode
(value)
bst_count/solutions/solution.js:1
MethodNode
An empty constructor is used only for creating sentinels, which are useful in some algorithms. This is why a corresponding setValue() is not provided.
tree_zig_zag/solutions/TreeZigZag.java:22
FunctionStack
()
minimum_stack/solutions/solution.js:1
FunctionStaqueue
()
queue_two_stacks/solutions/solution.js:1
Method__eq__
(self, other)
tree_zig_zag/solutions/tree_zig_zag.py:18
Method__hash__
(self)
tree_zig_zag/solutions/tree_zig_zag.py:15
Method__init__
(self, value)
tree_zig_zag/solutions/tree_zig_zag.py:10
Method__init__
(self, value)
tree_zig_zag/generator/generate_tree.py:19
Method__repr__
(self)
tree_zig_zag/solutions/tree_zig_zag.py:26
Method__repr__
(self)
tree_zig_zag/generator/generate_tree.py:27
Method__str__
(self)
tree_zig_zag/solutions/tree_zig_zag.py:23
Method__str__
(self)
tree_zig_zag/generator/generate_tree.py:24
Methodchildren
(self)
tree_zig_zag/generator/generate_tree.py:31
FunctioncountNodes
(root)
bst_count/solutions/solution.js:7
MethodfindAll
(int[] nums)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:43
MethodhashCode
()
tree_zig_zag/solutions/TreeZigZag.java:48
Functionmain
balanced_delimiter/solutions/balanced_delimiter.c:67
Methodmain
(String args[])
tree_zig_zag/solutions/TreeZigZag.java:129
Methodmain
(String[] args)
factorial/solutions/FactorialSolution.java:10
Methodmain
(String[] args)
coin_change/solutions/CoinChangeSolution.java:8
Methodmain
(String[] args)
linked_list_cycle/solutions/LinkedListCycle.java:26
Methodmain
(String[] args)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:10
Methodmain
(String[] args)
find_uncoupled_int/solutions/Solution.java:29
Functionmemoize
(func)
coin_change/solutions/coin_change_solution.py:5
Methodprint
()
coin_change/solutions/CoinChangeSolution.java:54
Methodrotate_check_helper
(m)
array_rotate/solutions/rotate-solution.rb:34
Functionrotate_jump
(array, n)
array_rotate/solutions/rotate-solution.rb:1
Functionrotate_step
(array, n)
array_rotate/solutions/rotate-solution.rb:13
MethodtestCanRansom
()
ransom/RansomTest.java:6
MethodtestCoinChangeSolutionOptimal
()
coin_change/solutions/CoinChangeSolutionTest.java:22
MethodtestCoinChangeSolutionOptimalSpeed
()
coin_change/solutions/CoinChangeSolutionTest.java:43
MethodtestCoinChangeSolutionRecursive
()
coin_change/solutions/CoinChangeSolutionTest.java:9
MethodtestCoinChangeSolutionRecursiveSpeed
()
coin_change/solutions/CoinChangeSolutionTest.java:35
Methodtest_jump
()
array_rotate/solutions/rotate-solution.rb:30
Methodtest_odd_split
array_rotate/solutions/keppy_test.rb:13
Methodtest_one_step
array_rotate/solutions/keppy_test.rb:6
Methodtest_over_step
array_rotate/solutions/keppy_test.rb:20
Methodtest_step
()
array_rotate/solutions/rotate-solution.rb:26
MethodtoString
()
tree_zig_zag/solutions/TreeZigZag.java:35
Functionwrapper
(*args, **kwargs)
coin_change/solutions/coin_change_solution.py:8