MCPcopy Create free account

hub / github.com/AlgorithmCrackers/Interview-Questions / functions

Functions314 in github.com/AlgorithmCrackers/Interview-Questions

⨍ Functions 314◇ Types & classes 80
↓ 28 callersMethodmax
(int a, int b)
00_Arrays/kLargestNumbers/Solution.java:29
↓ 14 callersMethodpop
(self)
03_Stacks_and_Queues/Stack/stack.py:14
↓ 12 callersMethodpush
(self, item)
03_Stacks_and_Queues/Stack/stack.py:10
↓ 11 callersMethodmin
(self)
03_Stacks_and_Queues/minElementInStack/minStack.py:33
↓ 8 callersMethodaddDirectedEdge
(Object from, Object to)
04_Trees_and_Graphs/projectDependencies/Solution.java:20
↓ 8 callersMethodlongestStraight
(final int[] cards)
13_Misc/TopCoder/src/cardStraights/CardStraights.java:27
↓ 7 callersMethodmarketCost
(int minCustomers, int[] customers, int[] cost)
13_Misc/TopCoder/src/hotel/Hotel.java:23
↓ 7 callersFunctiontestAll
(str1, str2, res)
01_Strings/isAnagram/Solution.py:88
↓ 6 callersMethodtoString
()
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:121
↓ 5 callersMethodchangeMakerNew
(self, inp_ele, arr = [10, 25, 1, 5])
08_Recursion_and_Dynamic_Programming/coinChanger/solution.py:50
↓ 5 callersMethodisEmpty
(self)
03_Stacks_and_Queues/Stack/stack.py:33
↓ 5 callersMethodpeek
(self)
03_Stacks_and_Queues/Stack/stack.py:22
↓ 5 callersMethodpop
()
03_Stacks_and_Queues/Stack/Stack.java:20
↓ 5 callersFunctionshortestPalindrome
(str)
01_Strings/shortestPalindrome/Solution.py:15
↓ 4 callersMethodgetTask
(String[] list, int n)
13_Misc/TopCoder/src/businessTasks/BusinessTasks.java:8
↓ 4 callersFunctionhas_redundant
(s)
03_Stacks_and_Queues/Has_redundats(s)/has_redundant(s).py:1
↓ 4 callersFunctionhas_redundant
(s)
03_Stacks_and_Queues/Has_redundats(s)/main.py:1
↓ 4 callersMethodisEmpty
(self)
03_Stacks_and_Queues/Queue/queue.py:20
↓ 4 callersFunctionisPalindrome
(str)
01_Strings/isPalindrome/Solution.py:2
↓ 4 callersFunctionisUnique
(str)
01_Strings/checkForUniqueCharacters/Soultion.py:2
↓ 4 callersMethodpush
(self, item)
03_Stacks_and_Queues/minElementInStack/minStack.py:11
↓ 3 callersMethodchangeMakerHelper
(self, inp_ele, arr, res_arr, index)
08_Recursion_and_Dynamic_Programming/coinChanger/solution.py:4
↓ 3 callersMethoddeleteMax
()
00_Arrays/kLargestNumbers/Solution.java:15
↓ 3 callersMethoddequeue
(self)
03_Stacks_and_Queues/Queue/queue.py:12
↓ 3 callersMethodenqueue
(Integer data)
03_Stacks_and_Queues/QueueUsingStack/QueueUsingStack.java:15
↓ 3 callersMethodenqueue
(self, item)
03_Stacks_and_Queues/Queue/queue.py:7
↓ 3 callersFunctionfirst_char
(str)
01_Strings/FindTheFirstNonRepetitiveChar/Solution.py:1
↓ 3 callersMethodgetAdj
(Object v)
04_Trees_and_Graphs/projectDependencies/Solution.java:34
↓ 3 callersMethodgetMostFreqInteger
(self, arr)
00_Arrays/MostFrequentInteger/Solution.py:6
↓ 3 callersMethodgetMostFreqInteger_2
(self, arr)
00_Arrays/MostFrequentInteger/Solution.py:26
↓ 3 callersMethodpop
(self)
03_Stacks_and_Queues/minElementInStack/Stack.py:14
↓ 3 callersMethodpush
(Integer data)
03_Stacks_and_Queues/Stack/Stack.java:14
↓ 3 callersMethodpush
(self, item)
03_Stacks_and_Queues/minElementInStack/Stack.py:10
↓ 3 callersMethodreverseInt
(int x)
13_Misc/ReverseInteger/Solution.java:9
↓ 3 callersMethodswap
(int index1, int index2, int[] arr)
00_Arrays/kLargestNumbers/Solution.java:62
↓ 3 callersFunctiontest
(input, expected_output)
00_Arrays/find-minimum-in-rotated-sorted-array/solution.js:70
↓ 3 callersFunctiontest
(input, output)
00_Arrays/merge-intervals/solution.js:25
↓ 2 callersMethodStack
()
03_Stacks_and_Queues/Stack/Stack.java:10
↓ 2 callersFunctionbinarySearch
00_Arrays/Count-the-number-of-occurrences-in-a-sorted-array/solution_divideAndConquer.c:39
↓ 2 callersFunctioncontainsDuplicate
00_Arrays/ContainsDuplicate/C++/main.cc:5
↓ 2 callersMethodconvertToBase10
(char[] chArr, int base)
13_Misc/BasicArithmetic.java:78
↓ 2 callersMethoddequeue
()
03_Stacks_and_Queues/QueueUsingStack/QueueUsingStack.java:25
↓ 2 callersMethoddisplay
()
03_Stacks_and_Queues/Stack/Stack.java:30
↓ 2 callersMethodgetVertices
()
04_Trees_and_Graphs/projectDependencies/Solution.java:37
↓ 2 callersMethodgetWord
Get the previous or next word @param prevOrNext @param index @return word
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:98
↓ 2 callersFunctionhasSum
00_Arrays/containsSum/C++/main.cc:5
↓ 2 callersMethodisForbidden
Is the word forbidden? @param wrd @return boolean
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:89
↓ 2 callersFunctionletterInOrder
(str)
13_Misc/LetterInOrder/Solution.py:2
↓ 2 callersMethodmissingHelper
(Stack<Integer> st)
03_Stacks_and_Queues/MissingNoFromStack/MissingNoFromStack.java:22
↓ 2 callersFunctionmodAdd_Naive
05_Bit_Manipulation/Modular-Addition/main.cpp:4
↓ 2 callersFunctionmodAdd_Optimal
05_Bit_Manipulation/Modular-Addition/main.cpp:9
↓ 2 callersMethodnext
(char c)
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:112
↓ 2 callersMethodpause
()
13_Misc/ThreadExample.java:31
↓ 2 callersMethodpeek
(self)
03_Stacks_and_Queues/minElementInStack/Stack.py:22
↓ 2 callersMethodreverse
(ListNode head)
02_LinkedLists/isPalindrome/Solution.java:11
↓ 2 callersMethodswap
(char[] a, int i, int j)
00_Arrays/Permutation/Permutation.java:47
↓ 1 callersMethodDfs_visit
(Graph g, Object v, DFS results, Object parent)
04_Trees_and_Graphs/projectDependencies/Solution.java:76
↓ 1 callersFunctionFindMin_BitHack
05_Bit_Manipulation/Minimum-Of-Two-Integers/main.cpp:9
↓ 1 callersFunctionFindMin_Naive
05_Bit_Manipulation/Minimum-Of-Two-Integers/main.cpp:4
↓ 1 callersMethod__sink
(self, idx)
09_System_Design_and_Scalability/Heap/MinHeap.py:27
↓ 1 callersMethod__swim
(self, idx)
09_System_Design_and_Scalability/Heap/MinHeap.py:21
↓ 1 callersMethod_getPermutation_helper
(self, result, char_list, used, cur, k)
08_Recursion_and_Dynamic_Programming/kthPermutation/kthPermutation.py:15
↓ 1 callersMethod_helper
(self, arr, n, k)
00_Arrays/MostFrequentInteger/Solution.py:34
↓ 1 callersMethodbfs
(Node s, String finish)
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:15
↓ 1 callersMethodbrute
(final int[] a, final int start, final int end)
00_Arrays/MaximumSubArray/Java/MaximumSubArray.java:4
↓ 1 callersMethodbruteOptimal
(final int[] a, final int start, final int end)
00_Arrays/MaximumSubArray/Java/MaximumSubArray.java:19
↓ 1 callersMethodchangeMakerNewHelper
(self, inp_ele, arr, res_arr, index)
08_Recursion_and_Dynamic_Programming/coinChanger/solution.py:25
↓ 1 callersFunctioncheckBit
05_Bit_Manipulation/Basics/main.cpp:19
↓ 1 callersFunctionclearBit
05_Bit_Manipulation/Basics/main.cpp:9
↓ 1 callersMethodcoinChange
(int[] s, int n, int i)
08_Recursion_and_Dynamic_Programming/coinChanger/Solution.java:4
↓ 1 callersFunctioncount
(N)
08_Recursion_and_Dynamic_Programming/MobileNumericKeypadProblem/solution.py:11
↓ 1 callersFunctioncount
if x is present in arr[] then returns the count of occurrences of x, otherwise returns -1. */
00_Arrays/Count-the-number-of-occurrences-in-a-sorted-array/solution_divideAndConquer.c:20
↓ 1 callersMethoddfs
(int i, int j, int l, int b, char[][] grid)
04_Trees_and_Graphs/numberOfIslands/Solution.java:20
↓ 1 callersMethoddfs
(Graph g)
04_Trees_and_Graphs/projectDependencies/Solution.java:63
↓ 1 callersMethoddisplay
(self)
03_Stacks_and_Queues/Queue/queue.py:23
↓ 1 callersMethoddivideAndConquer
(final int[] a, final int start, final int end)
00_Arrays/MaximumSubArray/Java/MaximumSubArray.java:32
↓ 1 callersFunctionequalArrays
05_Bit_Manipulation/Merge-Two-Sorted-Arrays/main.c:43
↓ 1 callersMethodfindMid
(ListNode head)
02_LinkedLists/SortList/Solution.java:47
↓ 1 callersFunctionfindMin
(nums)
00_Arrays/find-minimum-in-rotated-sorted-array/solution.js:5
↓ 1 callersMethodfindMinMax
(int[] a, int left, int right)
00_Arrays/MaxMin/Solution.java:29
↓ 1 callersFunctionfindTheTwoSmallest
(arr)
00_Arrays/FirstAndSecondSmallest/Solution.py:3
↓ 1 callersFunctionfindTheTwoSmallestIndex
(arr)
00_Arrays/FirstAndSecondSmallest/Solution.py:16
↓ 1 callersMethodgetBackPtrn
(String word)
13_Misc/TopCoder/src/poetry/Poetry.java:15
↓ 1 callersFunctiongetFib
(n)
08_Recursion_and_Dynamic_Programming/Fibonacci_Number/fib.py:1
↓ 1 callersMethodgetHeight
(TreeNode node)
04_Trees_and_Graphs/isBalanced/Solution.java:8
↓ 1 callersMethodgetMedian
00_Arrays/MedianMaintenance/src/Main.kt:33
↓ 1 callersMethodgetPeople
(String[] people)
13_Misc/TopCoder/src/tallPeople/TallPeople.java:6
↓ 1 callersMethodgetPerm
(self, n, k)
08_Recursion_and_Dynamic_Programming/kthPermutation/kthPermutation.py:41
↓ 1 callersMethodgetPermutation
(self, n, k)
08_Recursion_and_Dynamic_Programming/kthPermutation/kthPermutation.py:6
↓ 1 callersFunctiongetUglyNumber
(n)
08_Recursion_and_Dynamic_Programming/Ugly_Numbers/uglynumbers.py:13
↓ 1 callersMethodhanoi
(int height, int first, int temp, int final1)
08_Recursion_and_Dynamic_Programming/Hanoi/Solution.java:10
↓ 1 callersMethodheappop
(self)
09_System_Design_and_Scalability/Heap/MinHeap.py:13
↓ 1 callersMethodheappush
(self, val)
09_System_Design_and_Scalability/Heap/MinHeap.py:8
↓ 1 callersFunctionid_to_short_url
(db_id)
07_Object-Oriented_Design/Url_shortner/url_shortner.py:10
↓ 1 callersMethodinitForbidden
Find the forbidden words and set them to true in the corresponding forbidden matrix position @param forbid
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:46
↓ 1 callersMethodinsert
(int value)
00_Arrays/kLargestNumbers/Solution.java:10
↓ 1 callersFunctionisAnagram
(str1, str2)
01_Strings/isAnagram/Solution.py:1
↓ 1 callersFunctionisAnagram_2
:type s: str :type t: str :rtype: bool
01_Strings/isAnagram/Solution.py:22
↓ 1 callersFunctionisAnagram_3
(s, t)
01_Strings/isAnagram/Solution.py:49
↓ 1 callersFunctionisAnagram_4
:type s: str :type t: str :rtype: bool
01_Strings/isAnagram/Solution.py:63
next →1–100 of 314, ranked by callers