Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/codingforinterviews/practice-problems
/ functions
Functions
90 in github.com/codingforinterviews/practice-problems
⨍
Functions
90
◇
Types & classes
23
↓ 5 callers
Method
countOptimal
(int[] coins, int amt)
coin_change/solutions/CoinChangeSolution.java:27
↓ 4 callers
Method
countRecursive
(int coins[], int c, int sum)
coin_change/solutions/CoinChangeSolution.java:41
↓ 3 callers
Function
canMakeSum
(array, targetSum)
target_sum/solutions/solution.js:1
↓ 3 callers
Method
containsCycle
()
linked_list_cycle/solutions/LinkedListCycle.java:8
↓ 3 callers
Method
getOrCreate
(Integer value, Map<Node<Integer>, Node<Integer>> map)
tree_zig_zag/solutions/TreeZigZag.java:93
↓ 3 callers
Method
get_vertex
(cls, value, vertices)
tree_zig_zag/solutions/tree_zig_zag.py:32
↓ 3 callers
Function
isBalanced
(delimiterString)
balanced_delimiter/solutions/balanced_delimiter.js:21
↓ 3 callers
Method
solve
(set, n)
array_rotate/solutions/keppy.rb:3
↓ 2 callers
Method
canRansom
(String magazine, String ransom)
ransom/Ransom.java:5
↓ 2 callers
Method
equals
(Object o)
tree_zig_zag/solutions/TreeZigZag.java:40
↓ 2 callers
Method
getLeft
()
tree_zig_zag/solutions/TreeZigZag.java:30
↓ 2 callers
Method
getRight
()
tree_zig_zag/solutions/TreeZigZag.java:32
↓ 1 callers
Method
as_hackerrank_lines
(self)
tree_zig_zag/generator/generate_tree.py:34
↓ 1 callers
Method
factorial
(BigInteger n, BigInteger acc)
factorial/solutions/FactorialSolution.java:24
↓ 1 callers
Function
fib
Enter your code here. Read input from STDIN. Print output to STDOUT
fibonacci_lite/solutions/fibonacci.rb:2
↓ 1 callers
Function
fib
Naive implementation. We'll choose correctness over speed here.
fibonacci_lite/generator/gen_testcase.rb:2
↓ 1 callers
Function
fib
(n)
fibonacci_dynamic/solutions/fibonacci_dynamic.rb:4
↓ 1 callers
Function
fib
(n)
fibonacci_dynamic/generator/generate_cases.rb:2
↓ 1 callers
Method
find
(int[] nums)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:28
↓ 1 callers
Function
findPermutations
(coins, n)
coin_change/solutions/coin_change_solution.js:14
↓ 1 callers
Method
findUncoupled
(int[] integers)
find_uncoupled_int/solutions/Solution.java:2
↓ 1 callers
Method
findUncoupledSet
(int[] integers)
find_uncoupled_int/solutions/Solution.java:10
↓ 1 callers
Function
find_val
(side, depth)
tree_zig_zag/solutions/tree_zig_zag.rb:14
↓ 1 callers
Function
find_val_r
(side, depth, node, level)
tree_zig_zag/solutions/tree_zig_zag.rb:18
↓ 1 callers
Function
generate_bst
(size, min_value=1, max_value=2 ** 31 - 1)
tree_zig_zag/generator/generate_tree.py:45
↓ 1 callers
Function
generate_pairs
This generates a valid delimiter string using a Markov chain-like process.
balanced_delimiter/generator/gen_testcase.rb:9
↓ 1 callers
Method
getCoins
(String line)
coin_change/solutions/CoinChangeSolution.java:58
↓ 1 callers
Method
getValue
()
tree_zig_zag/solutions/TreeZigZag.java:33
↓ 1 callers
Function
hashrand
Convenience function for picking a random value out of a hash.
balanced_delimiter/generator/gen_testcase.rb:4
↓ 1 callers
Function
isCloser
(character)
balanced_delimiter/solutions/balanced_delimiter.js:7
↓ 1 callers
Function
isOpener
(character)
balanced_delimiter/solutions/balanced_delimiter.js:11
↓ 1 callers
Function
is_bst
(node, min_value=1, max_value=2 ** 31 - 1)
tree_zig_zag/generator/generate_tree.py:69
↓ 1 callers
Function
main
()
tree_zig_zag/solutions/tree_zig_zag.py:73
↓ 1 callers
Function
main
()
tree_zig_zag/generator/generate_tree.py:77
↓ 1 callers
Function
main
()
coin_change/solutions/coin_change_solution.py:31
↓ 1 callers
Function
make_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 callers
Function
matches
Some convenience functions for checking that delimiters are of the correct type for eachother. */
balanced_delimiter/solutions/balanced_delimiter.c:43
↓ 1 callers
Function
opener
balanced_delimiter/solutions/balanced_delimiter.c:56
↓ 1 callers
Function
pop
balanced_delimiter/solutions/balanced_delimiter.c:29
↓ 1 callers
Function
processData
(input)
coin_change/solutions/coin_change_solution.js:62
↓ 1 callers
Method
processLevel
(List<Node<T>> level)
tree_zig_zag/solutions/TreeZigZag.java:85
↓ 1 callers
Function
push
Stack methods. */
balanced_delimiter/solutions/balanced_delimiter.c:19
↓ 1 callers
Method
readTree
(InputStream in)
tree_zig_zag/solutions/TreeZigZag.java:107
↓ 1 callers
Method
read_tree
(cls, stream)
tree_zig_zag/solutions/tree_zig_zag.py:41
↓ 1 callers
Method
search
(Node<T> root)
tree_zig_zag/solutions/TreeZigZag.java:60
↓ 1 callers
Method
setLeft
(Node<T> left)
tree_zig_zag/solutions/TreeZigZag.java:29
↓ 1 callers
Method
setRight
(Node<T> right)
tree_zig_zag/solutions/TreeZigZag.java:31
↓ 1 callers
Function
solve
(coins, amount)
coin_change/solutions/coin_change_solution.py:17
↓ 1 callers
Method
toIntArray
(String line)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:52
↓ 1 callers
Function
zig_zag_traverse
(root)
tree_zig_zag/solutions/tree_zig_zag.py:54
Function
BSTNode
(value)
bst_count/solutions/solution.js:1
Method
Node
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
Function
Stack
()
minimum_stack/solutions/solution.js:1
Function
Staqueue
()
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
Method
children
(self)
tree_zig_zag/generator/generate_tree.py:31
Function
countNodes
(root)
bst_count/solutions/solution.js:7
Method
findAll
(int[] nums)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:43
Method
hashCode
()
tree_zig_zag/solutions/TreeZigZag.java:48
Function
main
balanced_delimiter/solutions/balanced_delimiter.c:67
Method
main
(String args[])
tree_zig_zag/solutions/TreeZigZag.java:129
Method
main
(String[] args)
factorial/solutions/FactorialSolution.java:10
Method
main
(String[] args)
coin_change/solutions/CoinChangeSolution.java:8
Method
main
(String[] args)
linked_list_cycle/solutions/LinkedListCycle.java:26
Method
main
(String[] args)
find_uncoupled_int/solutions/FindUncoupledIntSolution.java:10
Method
main
(String[] args)
find_uncoupled_int/solutions/Solution.java:29
Function
memoize
(func)
coin_change/solutions/coin_change_solution.py:5
Method
print
()
coin_change/solutions/CoinChangeSolution.java:54
Method
rotate_check_helper
(m)
array_rotate/solutions/rotate-solution.rb:34
Function
rotate_jump
(array, n)
array_rotate/solutions/rotate-solution.rb:1
Function
rotate_step
(array, n)
array_rotate/solutions/rotate-solution.rb:13
Method
testCanRansom
()
ransom/RansomTest.java:6
Method
testCoinChangeSolutionOptimal
()
coin_change/solutions/CoinChangeSolutionTest.java:22
Method
testCoinChangeSolutionOptimalSpeed
()
coin_change/solutions/CoinChangeSolutionTest.java:43
Method
testCoinChangeSolutionRecursive
()
coin_change/solutions/CoinChangeSolutionTest.java:9
Method
testCoinChangeSolutionRecursiveSpeed
()
coin_change/solutions/CoinChangeSolutionTest.java:35
Method
test_jump
()
array_rotate/solutions/rotate-solution.rb:30
Method
test_odd_split
array_rotate/solutions/keppy_test.rb:13
Method
test_one_step
array_rotate/solutions/keppy_test.rb:6
Method
test_over_step
array_rotate/solutions/keppy_test.rb:20
Method
test_step
()
array_rotate/solutions/rotate-solution.rb:26
Method
toString
()
tree_zig_zag/solutions/TreeZigZag.java:35
Function
wrapper
(*args, **kwargs)
coin_change/solutions/coin_change_solution.py:8