Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/camilamaia/jornada-big-tech
/ functions
Functions
93 in github.com/camilamaia/jornada-big-tech
⨍
Functions
93
◇
Types & classes
30
↓ 43 callers
Method
compare
(String command, Object result, Object expected)
coursera-algorithms-part-1/queues/Deque.java:338
↓ 31 callers
Method
enqueue
@param item to be added
coursera-algorithms-part-1/queues/RandomizedQueue.java:70
↓ 19 callers
Method
isEmpty
Is the deque empty? @return true if deque is empty, false otherwise
coursera-algorithms-part-1/queues/Deque.java:52
↓ 15 callers
Method
dequeue
Removes and returns a random item @return a random item
coursera-algorithms-part-1/queues/RandomizedQueue.java:85
↓ 14 callers
Method
size
@return the number of items on the deque
coursera-algorithms-part-1/queues/Deque.java:60
↓ 13 callers
Method
compare
(String command, Object result, Object expected)
coursera-algorithms-part-1/queues/RandomizedQueue.java:337
↓ 13 callers
Method
iterator
@return an iterator over items in order from front to back
coursera-algorithms-part-1/queues/Deque.java:150
↓ 10 callers
Method
addLast
Adds the item to the back of the deque
coursera-algorithms-part-1/queues/Deque.java:87
↓ 9 callers
Method
size
@return the number of items on the randomized queue
coursera-algorithms-part-1/queues/RandomizedQueue.java:63
↓ 8 callers
Method
removeFirst
Removes and returns the item from the front @return the first item
coursera-algorithms-part-1/queues/Deque.java:109
↓ 7 callers
Method
hasNext
()
coursera-algorithms-part-1/queues/Deque.java:30
↓ 7 callers
Method
next
()
coursera-algorithms-part-1/queues/Deque.java:34
↓ 5 callers
Method
removeLast
Removes and returns the item from the back @return the last item
coursera-algorithms-part-1/queues/Deque.java:131
↓ 4 callers
Method
addFirst
Adds the item to the front of the deque
coursera-algorithms-part-1/queues/Deque.java:67
↓ 4 callers
Method
connect
(int openSiteConnectionIndex, int siteRow, int siteCol)
coursera-algorithms-part-1/percolation/Percolation.java:129
↓ 4 callers
Method
connectionsIndex
(int row, int col)
coursera-algorithms-part-1/percolation/Percolation.java:112
↓ 4 callers
Method
draw
(Percolation perc, int n)
coursera-algorithms-part-1/percolation/PercolationVisualizer.java:30
↓ 4 callers
Method
isEmpty
@return true if the randomized queue is empty, false otherwise
coursera-algorithms-part-1/queues/RandomizedQueue.java:56
↓ 4 callers
Method
isOpen
Check if the site (row, col) is open @param row: the number of the site's row @param col: the number of the site's column @return: true if it is open
coursera-algorithms-part-1/percolation/Percolation.java:80
↓ 3 callers
Method
mean
@return: the sample mean of percolation threshold
coursera-algorithms-part-1/percolation/PercolationStats.java:48
↓ 3 callers
Method
open
Opens the site (row, col) if it is not open already @param row: the number of the site's row @param col: the number of the site's column @throws Ille
coursera-algorithms-part-1/percolation/Percolation.java:39
↓ 3 callers
Method
sample
Returns a random item (but do not remove it) @return a random item
coursera-algorithms-part-1/queues/RandomizedQueue.java:101
↓ 3 callers
Method
stddev
@return: sample standard deviation of percolation threshold
coursera-algorithms-part-1/percolation/PercolationStats.java:55
↓ 3 callers
Method
validateSite
(int row, int col)
coursera-algorithms-part-1/percolation/Percolation.java:116
↓ 2 callers
Method
hasNext
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:29
↓ 2 callers
Method
isOnGrid
(int row, int col)
coursera-algorithms-part-1/percolation/Percolation.java:122
↓ 2 callers
Method
iterator
@return an independent iterator over items in random order
coursera-algorithms-part-1/queues/RandomizedQueue.java:109
↓ 2 callers
Method
percolates
@return: true if the system percolates, false otherwise.
coursera-algorithms-part-1/percolation/Percolation.java:108
↓ 2 callers
Method
resize
(int newCapacity)
coursera-algorithms-part-1/queues/RandomizedQueue.java:122
↓ 2 callers
Method
reverse
(int[] nums, int start)
leetcode/src/NextPermutation.java:33
↓ 2 callers
Method
swap
(int[] nums, int i, int j)
leetcode/src/NextPermutationLeetCodeSolution.java:27
↓ 2 callers
Method
swap
(int[] nums, int position1, int position2)
leetcode/src/NextPermutation.java:43
↓ 1 callers
Method
area
(int x1, int y1, int x2, int y2)
leetcode/src/ContainerWithMostWater.java:35
↓ 1 callers
Method
confidenceHi
@return: high endpoint of 95% confidence interval
coursera-algorithms-part-1/percolation/PercolationStats.java:65
↓ 1 callers
Method
confidenceLo
@return: low endpoint of 95% confidence interval
coursera-algorithms-part-1/percolation/PercolationStats.java:60
↓ 1 callers
Method
findNextGreaterIndex
(int[] nums, int currentIndex)
leetcode/src/NextPermutation.java:24
↓ 1 callers
Method
isFull
Checks if the site (row, col) is full @param row: the number of the site's row @param col: the number of the site's column @return: true if it is ful
coursera-algorithms-part-1/percolation/Percolation.java:93
↓ 1 callers
Method
next
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:33
↓ 1 callers
Method
nextEvenJump
(int currentIndex, int[] arr)
leetcode/src/OddEvenJump1stAttempt.java:51
↓ 1 callers
Method
nextIndex
(int currentIndex, int jump, int[] arr)
leetcode/src/OddEvenJump1stAttempt.java:28
↓ 1 callers
Method
nextOddJump
(int currentIndex, int[] arr)
leetcode/src/OddEvenJump1stAttempt.java:36
↓ 1 callers
Method
numberOfOpenSites
@return: the number of open sites in the system
coursera-algorithms-part-1/percolation/Percolation.java:103
↓ 1 callers
Method
remove
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:41
↓ 1 callers
Method
reverse
(int[] nums, int start)
leetcode/src/NextPermutationLeetCodeSolution.java:18
↓ 1 callers
Method
runTests
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:129
↓ 1 callers
Method
runTests
()
coursera-algorithms-part-1/queues/Deque.java:163
↓ 1 callers
Method
test
()
coursera-algorithms-part-1/queues/Deque.java:251
↓ 1 callers
Method
testAddFirstRemoveFirst
()
coursera-algorithms-part-1/queues/Deque.java:189
↓ 1 callers
Method
testAddFirstRemoveLast
()
coursera-algorithms-part-1/queues/Deque.java:204
↓ 1 callers
Method
testAddLastRemoveFirst
()
coursera-algorithms-part-1/queues/Deque.java:219
↓ 1 callers
Method
testAddLastRemoveLast
()
coursera-algorithms-part-1/queues/Deque.java:235
↓ 1 callers
Method
testCourseraCase1
()
coursera-algorithms-part-1/queues/Deque.java:308
↓ 1 callers
Method
testCourseraCase2
()
coursera-algorithms-part-1/queues/Deque.java:319
↓ 1 callers
Method
testCourseraCase3
()
coursera-algorithms-part-1/queues/Deque.java:329
↓ 1 callers
Method
testDequeue
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:200
↓ 1 callers
Method
testEmpty
()
coursera-algorithms-part-1/queues/Deque.java:175
↓ 1 callers
Method
testEnqueue
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:167
↓ 1 callers
Method
testIsEmpty
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:139
↓ 1 callers
Method
testIterator
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:297
↓ 1 callers
Method
testSample
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:274
↓ 1 callers
Method
testSize
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:153
↓ 1 callers
Method
twoSum
(int i, int[] nums, List<List<Integer>> results)
leetcode/src/ThreeSum.java:18
Method
Percolation
Creates n-by-n grid, with all sites initially blocked @param n: the size of the system Throws: @throws IllegalArgumentException: if n <= 0
coursera-algorithms-part-1/percolation/Percolation.java:19
Method
PercolationStats
Performs independent trials on an n-by-n grid @param n: grid size (n-by-n) @param trials: number of trials @throws IllegalArgumentException: if n <=
coursera-algorithms-part-1/percolation/PercolationStats.java:18
Method
RandomizedQueue
Constructs an empty randomized queue
coursera-algorithms-part-1/queues/RandomizedQueue.java:49
Method
RandomizedQueueIterator
()
coursera-algorithms-part-1/queues/RandomizedQueue.java:22
Method
lengthOfLongestSubstring
(String s)
leetcode/src/LongestSubstringWithoutRepeatingCharacters.java:3
Method
lengthOfLongestSubstring
(String s)
leetcode/src/LongestSubstringWithoutRepeatingCharactersLeetCodeSolution.java:2
Method
licenseKeyFormatting
(String s, int k)
leetcode/src/LicenseKeyFormatting.java:3
Method
main
(String[] args)
coursera-algorithms-part-1/percolation/PercolationVisualizer.java:64
Method
main
Runs x percolation trials for n-by-n grids @param args: grid size for each percolation and the total number of trials
coursera-algorithms-part-1/percolation/PercolationStats.java:74
Method
main
(String[] args)
coursera-algorithms-part-1/percolation/InteractivePercolationVisualizer.java:19
Method
main
unit testing (required) @param args
coursera-algorithms-part-1/queues/RandomizedQueue.java:118
Method
main
(String[] args)
coursera-algorithms-part-1/queues/Permutation.java:12
Method
main
unit testing (required) @param args
coursera-algorithms-part-1/queues/Deque.java:159
Method
main
Prints "Hello, World" @param args user inputs - not used
coursera-algorithms-part-1/hello/HelloWorld.java:14
Method
main
Prints greeting and goodbye to the two names @param args sequence of names
coursera-algorithms-part-1/hello/HelloGoodbye.java:15
Method
main
Reads a sequence of words from standard input and prints one of those words uniformly at random @param args sequence of words
coursera-algorithms-part-1/hello/RandomWord.java:19
Method
maxArea
(int[] height)
leetcode/src/ContainerWithMostWaterLeetCodeSolution.java:3
Method
maxArea
(int[] height)
leetcode/src/ContainerWithMostWater.java:3
Method
nextPermutation
(int[] nums)
leetcode/src/NextPermutationLeetCodeSolution.java:3
Method
nextPermutation
(int[] nums)
leetcode/src/NextPermutation.java:6
Method
numUniqueEmails
(String[] emails)
leetcode/src/UniqueEmailAddresses.java:6
Method
numUniqueEmails
(String[] emails)
leetcode/src/UniqueEmailAddressesLeetCodeSolution.java:2
Method
oddEvenJumps
(int[] arr)
leetcode/src/OddEvenJump1stAttempt.java:4
Method
oddEvenJumps
(int[] arr)
leetcode/src/OddEvenJump2ndAttempt.java:7
Method
remove
()
coursera-algorithms-part-1/queues/Deque.java:42
Method
threeSum
(int[] nums)
leetcode/src/ThreeSum.java:3
Method
totalFruit
(int[] fruits)
leetcode/src/FruitIntoBaskets3rdAttempt.java:6
Method
totalFruit
(int[] fruits)
leetcode/src/FruitIntoBaskets1stAttempt.java:6
Method
totalFruit
(int[] fruits)
leetcode/src/FruitIntoBaskets2ndAttempt.java:47
Method
twoSum
(int[] nums, int target)
leetcode/src/TwoSumLeetCodeSolution.java:3
Method
twoSum
(int[] numbers, int target)
leetcode/src/TwoSumII.java:3