MCPcopy Create free account

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

Functions314 in github.com/AlgorithmCrackers/Interview-Questions

⨍ Functions 314◇ Types & classes 80
↓ 1 callersMethodisBSTRecur
(TreeNode node, int min, int max)
04_Trees_and_Graphs/isBST/Solution.java:5
↓ 1 callersMethodisEmpty
(self)
03_Stacks_and_Queues/minElementInStack/Stack.py:33
↓ 1 callersFunctionisPalindrome
(str)
01_Strings/shortestPalindrome/Solution.py:1
↓ 1 callersFunctionisSameTree
(r, t)
04_Trees_and_Graphs/subtree-of-another-tree/solution.js:13
↓ 1 callersFunctionisValid
(node, min, max)
04_Trees_and_Graphs/isBST/solution.js:14
↓ 1 callersMethodisVowel
(char c, int i, int len)
13_Misc/TopCoder/src/poetry/Poetry.java:7
↓ 1 callersMethodis_empty
(self)
09_System_Design_and_Scalability/Heap/MinHeap.py:5
↓ 1 callersFunctionmain
()
08_Recursion_and_Dynamic_Programming/kthPermutation/kthPermutation.py:51
↓ 1 callersFunctionmain
(arg)
07_Object-Oriented_Design/Url_shortner/url_shortner.py:35
↓ 1 callersFunctionmain
()
03_Stacks_and_Queues/Has_redundats(s)/main.py:14
↓ 1 callersFunctionmain
()
03_Stacks_and_Queues/Stack/stack.py:37
↓ 1 callersFunctionmain
()
03_Stacks_and_Queues/minElementInStack/minStack.py:38
↓ 1 callersFunctionmain
()
03_Stacks_and_Queues/minElementInStack/Stack.py:37
↓ 1 callersFunctionmain
()
03_Stacks_and_Queues/Queue/queue.py:26
↓ 1 callersFunctionmain
()
01_Strings/isPalindrome/Solution.py:16
↓ 1 callersFunctionmain
()
01_Strings/shortestPalindrome/Solution.py:24
↓ 1 callersFunctionmain
()
01_Strings/checkForUniqueCharacters/Soultion.py:14
↓ 1 callersFunctionmain
()
01_Strings/Permutation/Solution.py:54
↓ 1 callersFunctionmain
()
01_Strings/FindTheFirstNonRepetitiveChar/Solution.py:22
↓ 1 callersFunctionmain
()
01_Strings/isAnagram/Solution.py:94
↓ 1 callersFunctionmain
()
00_Arrays/MostFrequentInteger/Solution.py:59
↓ 1 callersFunctionmain
()
13_Misc/LetterInOrder/Solution.py:17
↓ 1 callersFunctionmain
()
13_Misc/ReverseInteger/Solution.py:36
↓ 1 callersMethodmain
(String[] args)
00_Arrays/MaxMin/Solution.java:57
↓ 1 callersFunctionmaxCrossingSum
(nums, left, mid, right)
00_Arrays/MaximumSubArray/JS/DivideAndConquer.js:2
↓ 1 callersFunctionmaxSubArrayHelper
(nums, left, right)
00_Arrays/MaximumSubArray/JS/DivideAndConquer.js:22
↓ 1 callersMethodmemoizedTopDown
(int price[], int n)
08_Recursion_and_Dynamic_Programming/CuttingRod/cuttingRod.java:17
↓ 1 callersFunctionmerge
(intervals)
00_Arrays/merge-intervals/solution.js:5
↓ 1 callersMethodmerge
(ListNode l, ListNode r)
02_LinkedLists/SortList/Solution.java:26
↓ 1 callersFunctionmergeTwoLists
(list1, list2)
02_LinkedLists/merge-k-sorted-lists/solution.js:13
↓ 1 callersFunctionmerge_BitHack
05_Bit_Manipulation/Merge-Two-Sorted-Arrays/main.c:24
↓ 1 callersMethodmethodA
(String threadName)
13_Misc/ThreadExample.java:39
↓ 1 callersMethodmethodB
(String threadName)
13_Misc/ThreadExample.java:45
↓ 1 callersMethodminDistance
:type word1: str :type word2: str :rtype: int
08_Recursion_and_Dynamic_Programming/EditDistance/Solution.py:2
↓ 1 callersMethodminPresses
(String start, String finish, String[] forbid)
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:9
↓ 1 callersMethodmissingNumber
(Stack<Integer> st, Stack<Integer> st2)
03_Stacks_and_Queues/MissingNoFromStack/MissingNoFromStack.java:12
↓ 1 callersMethodnaive
(int price[], int n)
08_Recursion_and_Dynamic_Programming/CuttingRod/cuttingRod.java:7
↓ 1 callersMethodneighbors
Get all the neighbor words for the current node(word) @return A set of all the neighbor nodes
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:66
↓ 1 callersMethodperm1
(String s)
00_Arrays/Permutation/Permutation.java:14
↓ 1 callersMethodperm2
(String s)
00_Arrays/Permutation/Permutation.java:26
↓ 1 callersFunctionpermutation
(arr, cur, v, res)
08_Recursion_and_Dynamic_Programming/Permutations/permutations.py:5
↓ 1 callersMethodpermute
(self, prefix, str, result)
01_Strings/Permutation/Solution.py:42
↓ 1 callersMethodpermute
(String cur, String pend)
01_Strings/Permutation/Solution.java:8
↓ 1 callersMethodpermuteRec
(self, result, used, cur, nums)
01_Strings/Permutation/Solution.py:15
↓ 1 callersMethodpop
(self)
03_Stacks_and_Queues/minElementInStack/minStack.py:27
↓ 1 callersMethodprev
(char c)
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:117
↓ 1 callersFunctionprintArray
05_Bit_Manipulation/Merge-Two-Sorted-Arrays/main.c:50
↓ 1 callersFunctionproductExceptSelf2
(nums)
00_Arrays/product-of-array-except-self/solution.js:36
↓ 1 callersFunctionrecur
(node, sum, parents, allPaths)
04_Trees_and_Graphs/pathSum2/solution.js:19
↓ 1 callersMethodremoveDuplicates
(int[] A)
00_Arrays/RemoveDuplicatesFromSortedArray/Java/Solution.java:4
↓ 1 callersFunctionreverse
(head)
02_LinkedLists/isPalindrome/solution.js:14
↓ 1 callersMethodreverse
(char[] name, int len)
01_Strings/StringReverseInPlace/StringReverseInPlace.java:14
↓ 1 callersMethodreverse
:type x: int :rtype: int
13_Misc/ReverseInteger/Solution.py:2
↓ 1 callersFunctionreverseList
(head)
02_LinkedLists/reverse-linked-list/solution.js:27
↓ 1 callersMethodreverseString
(self, str)
13_Misc/ReverseInteger/Solution.py:22
↓ 1 callersMethodrhymeScheme
(String[] poem)
13_Misc/TopCoder/src/poetry/Poetry.java:36
↓ 1 callersMethodrun
(self, str)
01_Strings/Permutation/Solution.py:37
↓ 1 callersMethodsameLevelRecur
(TreeNode node, int curLevel)
04_Trees_and_Graphs/sameLevel/Solution.java:6
↓ 1 callersFunctionsetBit
05_Bit_Manipulation/Basics/main.cpp:4
↓ 1 callersFunctionshort_url_to_id
(short_url)
07_Object-Oriented_Design/Url_shortner/url_shortner.py:24
↓ 1 callersMethodsink
(int index)
00_Arrays/kLargestNumbers/Solution.java:46
↓ 1 callersMethodsol
(int n)
08_Recursion_and_Dynamic_Programming/WaysToWriteN/DynamicSolution.java:21
↓ 1 callersMethodsol
(int n)
08_Recursion_and_Dynamic_Programming/WaysToWriteN/RecusiveSolution.java:20
↓ 1 callersFunctionsubset
(arr, cur, res, ind)
08_Recursion_and_Dynamic_Programming/SubsetsGeneration/solution.py:2
↓ 1 callersMethodsubsets
(int[] S)
05_Bit_Manipulation/Subsets/Subsets.java:32
↓ 1 callersFunctionswap
05_Bit_Manipulation/Swap/main.cpp:7
↓ 1 callersFunctionswap
(i, j)
00_Arrays/SegregatePositiveAndNegativeNumbers/python/solution.py:6
↓ 1 callersMethodswim
(int index)
00_Arrays/kLargestNumbers/Solution.java:36
↓ 1 callersFunctiontest
(input, output)
00_Arrays/product-of-array-except-self/solution.js:59
↓ 1 callersMethodtoString
()
00_Arrays/MaxMin/Solution.java:13
↓ 1 callersFunctiontoggleBit
05_Bit_Manipulation/Basics/main.cpp:14
↓ 1 callersMethodtopologicalSort
(Graph g)
04_Trees_and_Graphs/projectDependencies/Solution.java:89
FunctionBuildOneToSixWithLoop
02_LinkedLists/LoopInList/helperFuncs.cpp:2
MethodDFS
()
04_Trees_and_Graphs/projectDependencies/Solution.java:59
MethodFoo
(String nm)
13_Misc/ThreadExample.java:23
MethodGraph
()
04_Trees_and_Graphs/projectDependencies/Solution.java:17
MethodListNode
(int data)
02_LinkedLists/delAtPosition/Solution.java:5
MethodMaxHeap
(int capacity)
00_Arrays/kLargestNumbers/Solution.java:5
MethodMyThread
(Foo f, String nm, String fM)
13_Misc/ThreadExample.java:6
MethodNode
(char[] word)
13_Misc/TopCoder/src/smartWordToy/SmartWordToy.java:39
MethodPair
()
00_Arrays/MaxMin/Solution.java:5
MethodQueueUsingStack
()
03_Stacks_and_Queues/QueueUsingStack/QueueUsingStack.java:11
MethodTreeNode
(int data, TreeNode left, TreeNode right)
04_Trees_and_Graphs/countTheLeaves/Solution.java:17
Method__init__
(self)
03_Stacks_and_Queues/Stack/stack.py:6
Method__init__
(self)
03_Stacks_and_Queues/minElementInStack/minStack.py:7
Method__init__
(self)
03_Stacks_and_Queues/minElementInStack/Stack.py:6
Method__init__
(self)
03_Stacks_and_Queues/Queue/queue.py:2
Method__init__
(self)
09_System_Design_and_Scalability/Heap/MinHeap.py:2
FunctionaddBinary
(a, b)
05_Bit_Manipulation/AddBinary/solution.js:6
MethodaddToAppropriateHeap
00_Arrays/MedianMaintenance/src/Main.kt:17
FunctionaddTwoNumbers
(l1, l2)
02_LinkedLists/add-two-numbers/solution.js:13
MethodchangeMaker
(self, inp_ele, arr)
08_Recursion_and_Dynamic_Programming/coinChanger/solution.py:19
FunctioncontainsDuplicate
(nums)
00_Arrays/ContainsDuplicate/JS/solution.js:19
FunctioncontainsDuplicateSort
(nums)
00_Arrays/ContainsDuplicate/JS/solution.js:7
MethodcontainsNearbyDuplicate
:type nums: List[int] :type k: int :rtype: bool < = k
00_Arrays/ContainsDuplicate/python/Solution.py:2
MethodcoupleSum
(int[] numbers, int target)
00_Arrays/coupleSum/Solution.java:3
MethoddelFirstOccurence
(LinkedListNode head, int data)
02_LinkedLists/doubleLinkDel/Solution.java:4
MethoddeleteAtPos
(ListNode head, int position)
02_LinkedLists/delAtPosition/Solution.java:8
Methoddisplay
(self)
03_Stacks_and_Queues/Stack/stack.py:30
Methoddisplay
(self)
03_Stacks_and_Queues/minElementInStack/Stack.py:30
← previousnext →101–200 of 314, ranked by callers