MCPcopy Create free account

hub / github.com/ankushchimnani/DSA-Must-Do-Questions / functions

Functions354 in github.com/ankushchimnani/DSA-Must-Do-Questions

⨍ Functions 354◇ Types & classes 81
↓ 26 callersMethodpop
(self)
13_Min Stack/Ideal Solutions/minStack.py:17
↓ 18 callersMethodtop
(self)
13_Min Stack/Ideal Solutions/minStack.py:26
↓ 15 callersMethodprint
(self)
21_Detect Loop in a Linked List/Ideal Solutions/detectLoop.py:21
↓ 14 callersMethodpush
(self, x: int)
13_Min Stack/Ideal Solutions/minStack.py:11
↓ 12 callersMethodadd
(int[][] matrix)
31_N-Queens/Ideal Solutions/nQueens.java:54
↓ 8 callersMethodpop
(self)
15_Stacksusing two Queues/Ideal Solutions/stackUsingQueues.py:29
↓ 8 callersMethodpush
(self, element)
15_Stacksusing two Queues/Ideal Solutions/stackUsingQueues.py:14
↓ 8 callersFunctionswap
(arr, first, second)
08_Bubble sort/Ideal Solutions/bubbleSort.py:3
↓ 6 callersMethodinsert
(self, value)
19_Add Two Linked List/Ideal Solutions/addTwoList.py:40
↓ 6 callersFunctionpush
19_Add Two Linked List/Ideal Solutions/addTwoList.cpp:15
↓ 6 callersMethodsize
()
15_Stacksusing two Queues/Ideal Solutions/stackUsingTwoQueues.java:41
↓ 4 callersMethodenqueue
(self, element)
14_Queue Using Two Stacks/Ideal Solutions/queueUsingStacks.py:11
↓ 4 callersMethodinsert
(self, value)
21_Detect Loop in a Linked List/Ideal Solutions/detectLoop.py:15
↓ 4 callersFunctionpush
21_Detect Loop in a Linked List/Ideal Solutions/detectLoop.cpp:11
↓ 4 callersMethodpush
(self, data)
22_Palindrome Linked List/Ideal Solutions/palindromeList.py:15
↓ 4 callersMethodpush
20_Reverse a Linked List/Ideal Solutions/reverseALinkedList.cpp:24
↓ 4 callersMethodpush
15_Stacksusing two Queues/Ideal Solutions/stackUsingTwoQueues.cpp:40
↓ 3 callersFunctionfrequencyInSortedArray
(array, N, Q)
33_Frequency in Sorted Array/Ideal Solutions/frequencyInSortedArray.py:15
↓ 3 callersMethodinsertNode
(self, dataItem)
20_Reverse a Linked List/Ideal Solutions/reverseList.py:27
↓ 3 callersFunctionnewNode
19_Add Two Linked List/Ideal Solutions/addTwoList.cpp:8
↓ 3 callersMethodpush
13_Min Stack/Ideal Solutions/minStack.cpp:12
↓ 3 callersMethodpush
(int x)
13_Min Stack/Ideal Solutions/minStack.java:16
↓ 3 callersMethodpush
(int x)
15_Stacksusing two Queues/Ideal Solutions/stackUsingTwoQueues.java:17
↓ 2 callersFunctioncalculateSum
(arr, intial, final)
38_Painter's Partition Problem/Ideal Solutions/painterPartition.py:4
↓ 2 callersMethoddequeue
(self)
14_Queue Using Two Stacks/Ideal Solutions/queueUsingStacks.py:24
↓ 2 callersFunctionexpandAroundCenter
(left, right, lengthOfString, str)
44_Longest Palindromic Substring/Ideal Solutions/longestPalindromeSubstring.py:1
↓ 2 callersMethodgenerateSinglyLinkedList
(int[] arr)
19_Add Two Linked List/Ideal Solutions/addTwoLinkedList.java:64
↓ 2 callersMethodgetMin
13_Min Stack/Ideal Solutions/minStack.cpp:37
↓ 2 callersMethodgetMin
()
13_Min Stack/Ideal Solutions/minStack.java:36
↓ 2 callersMethodpop
()
15_Stacksusing two Queues/Ideal Solutions/stackUsingTwoQueues.java:28
↓ 2 callersMethodpop
15_Stacksusing two Queues/Ideal Solutions/stackUsingTwoQueues.cpp:17
↓ 2 callersFunctionprecedence
12_Infix-Postfix/Ideal Solutions/infixPostfix.cpp:3
↓ 2 callersMethodprint
20_Reverse a Linked List/Ideal Solutions/reverseALinkedList.cpp:67
↓ 2 callersMethodprintLinkedList
(self)
20_Reverse a Linked List/Ideal Solutions/reverseList.py:32
↓ 2 callersMethodpriority
(char a)
12_Infix-Postfix/Ideal Solutions/infixPostfix.java:8
↓ 2 callersMethodsearchInRotatedSortedArray
(int[] arr,int low,int high,int k)
35_Search in Rotated & Sorted Array/Ideal Solutions/searchInRotatedSortedArray.java:7
↓ 2 callersMethodswap
(int[] a,int i,int j)
29_Print All Permutations of an Array/Ideal Solutions/permutationsOfArray.java:7
↓ 2 callersMethodtop
(self)
15_Stacksusing two Queues/Ideal Solutions/stackUsingQueues.py:36
↓ 1 callersFunctionSqrt
37_Square Root of an Integer/Ideal Solution/squareRootOfAnInteger.cpp:6
↓ 1 callersMethodaddTwoLinkedList
(Node head1, Node head2)
19_Add Two Linked List/Ideal Solutions/addTwoLinkedList.java:19
↓ 1 callersFunctionaddTwoList
19_Add Two Linked List/Ideal Solutions/addTwoList.cpp:22
↓ 1 callersFunctionallSubsequenceOfString
(input, subsequenceString="")
30_Print all Subsequences of a String/Ideal Solutions/allSbsequenceOfString.py:1
↓ 1 callersMethodarrayToString
(int[] arr)
03_Binary Representation of a Number/Ideal Solutions/binaryRepresentation.java:8
↓ 1 callersFunctionbalancedParanthesis
(S)
10_Balanced Parenthesis/Ideal Solutions/balancedParanthesis.py:3
↓ 1 callersFunctionbalancedParenthesis
10_Balanced Parenthesis/Ideal Solutions/balancedParenthesis.cpp:3
↓ 1 callersMethodbalancedParenthesis
(String a)
10_Balanced Parenthesis/Ideal Solutions/balancedParanthesis.java:7
↓ 1 callersFunctionbestTimeToBuySellStock
(prices)
39_Best Time to Buy and Sell Stock/Ideal Solutions/bestTimeToBuySellStock.py:1
↓ 1 callersMethodbestTimeToBuySellStock
(int[] prices)
39_Best Time to Buy and Sell Stock/Ideal Solutions/bestTimeToBuySellStock.java:9
↓ 1 callersFunctionbinaryRepresentation
(Number)
03_Binary Representation of a Number/Ideal Solutions/binaryRepresentation.py:3
↓ 1 callersFunctionbinaryRepresentation
03_Binary Representation of a Number/Ideal Solutions/binaryRepresentation.cpp:3
↓ 1 callersMethodbinaryRepresentation
(int n)
03_Binary Representation of a Number/Ideal Solutions/binaryRepresentation.java:14
↓ 1 callersFunctionbinarySearch
32_Binary Search/Ideal Solutions/binarySearch.cpp:3
↓ 1 callersFunctionbinarySearch
(arr, N, target)
32_Binary Search/Ideal Solutions/binarySearch.py:2
↓ 1 callersFunctionbinarySearch
(array, low, high, element)
33_Frequency in Sorted Array/Ideal Solutions/frequencyInSortedArray.py:2
↓ 1 callersMethodbinarySearch
(int[] arr,int n,int k)
32_Binary Search/Ideal Solutions/binarySearch.java:8
↓ 1 callersFunctionbinaryToNumber
(nums)
04_Binary Representation to Number/Ideal Solutions/binaryToNumber.py:3
↓ 1 callersFunctionbinaryToNumber
04_Binary Representation to Number/Ideal Solutions/binaryToNumber.cpp:4
↓ 1 callersMethodbinaryToNumber
(int[] arr)
04_Binary Representation to Number/Ideal Solutions/binaryToNumber.java:16
↓ 1 callersFunctionbubbleSort
(arr, N)
08_Bubble sort/Ideal Solutions/bubbleSort.py:10
↓ 1 callersFunctionbubbleSort
08_Bubble sort/Ideal Solutions/bubbleSort.cpp:3
↓ 1 callersMethodbubbleSort
(int[] arr,int n)
08_Bubble sort/Ideal Solutions/bubbleSort.java:13
↓ 1 callersFunctioncheckAnagram
(X, Y)
05_Check for anagram/Ideal Solutions/anagram.py:2
↓ 1 callersFunctioncheckAnagram
05_Check for anagram/Ideal Solutions/checkAnagram.cpp:3
↓ 1 callersMethodcheckAnagram
(String a,String b)
05_Check for anagram/Ideal Solutions/checkAnagram.java:17
↓ 1 callersMethodcheckForAttack
(int[][] matrix,HashSet<Integer> d1,HashSet<Integer> d2,HashSet<Integer> v,int row)
31_N-Queens/Ideal Solutions/nQueens.java:31
↓ 1 callersMethodcheckIfPossible
(long[] a,int k,long val)
38_Painter's Partition Problem/Ideal Solutions/paintersPartitionProblem.java:7
↓ 1 callersFunctioncheckPalindrome
06_Check for palindrome/Ideal Solutions/checkPalindrome.cpp:3
↓ 1 callersFunctioncheckPalindrome
(inputString)
06_Check for palindrome/Ideal Solutions/checkPalindrome.py:2
↓ 1 callersMethodcheckPalindrome
(String a)
06_Check for palindrome/Ideal Solutions/checkPalindrome.java:9
↓ 1 callersFunctioncheckPrime
02_Check for prime/Ideal Solutions/checkPrime.cpp:3
↓ 1 callersFunctioncheckPrime
(Number)
02_Check for prime/Ideal Solutions/checkPrime.py:5
↓ 1 callersMethodcheckPrime
(int n)
02_Check for prime/Ideal Solutions/checkPrime.java:8
↓ 1 callersFunctioncoinChange
49_Coin Change Problem/Ideal Solutions/coinChange.cpp:3
↓ 1 callersFunctioncoinChange
(coins, amount)
49_Coin Change Problem/Ideal Solutions/coinChange.py:2
↓ 1 callersMethodcoinChange
(int[] coins,int amount)
49_Coin Change Problem/Ideal Solutions/coinChange.java:8
↓ 1 callersMethodcontainerWithMostWater
(int[] container)
23_Container With Most Water/Ideal Solutions/containerWithMostWater.java:8
↓ 1 callersFunctioncutRod
51_Rod Cutting Problem/Ideal Solution/rodCuttingProblem.cpp:6
↓ 1 callersMethoddeQueue
Dequeue an item from the queue
14_Queue Using Two Stacks/Ideal Solutions/queueUsingTwoStacks.cpp:17
↓ 1 callersMethoddequeue
()
14_Queue Using Two Stacks/Ideal Solutions/queueUsingTwoStacks.java:22
↓ 1 callersFunctiondetectLoop
21_Detect Loop in a Linked List/Ideal Solutions/detectLoop.cpp:22
↓ 1 callersMethoddetectLoop
(self)
21_Detect Loop in a Linked List/Ideal Solutions/detectLoop.py:29
↓ 1 callersMethoddetectLoop
(Node head)
21_Detect Loop in a Linked List/Ideal Solutions/detectLoopInLinkedList.java:20
↓ 1 callersMethoddetectPalindromeLinkedList
(Node head)
22_Palindrome Linked List/Ideal Solutions/palindromeLinkedList.java:20
↓ 1 callersMethodenQueue
Enqueue an item to the queue
14_Queue Using Two Stacks/Ideal Solutions/queueUsingTwoStacks.cpp:10
↓ 1 callersMethodenqueue
(int x)
14_Queue Using Two Stacks/Ideal Solutions/queueUsingTwoStacks.java:11
↓ 1 callersMethodequalArrays
(char[] arr1, char[] arr2)
05_Check for anagram/Ideal Solutions/checkAnagram.java:9
↓ 1 callersFunctionfibonacci
27_Nth Fibonacci/Ideal Solutions/nthFibonacci.cpp:6
↓ 1 callersFunctionfindDuplicateInArray
11_Find Duplicates in array/Ideal Solutions/findDuplicatesInArray.cpp:3
↓ 1 callersFunctionfindDuplicatesInArray
(array, N)
11_Find Duplicates in array/Ideal Solutions/findDuplicatesInArray.py:3
↓ 1 callersMethodfindDuplicatesInArray
(int[] arr,int n)
11_Find Duplicates in array/Ideal Solutions/findDuplicatesInArray.java:12
↓ 1 callersFunctionfindMin
(array)
36_Minimum in Rotated & Sorted Array/Ideal Solutions/minRotatedSortedArray.py:3
↓ 1 callersMethodfindMin
(int a,int b,int c)
47_Money and Shopping/Ideal Solutions/money&Shopping.java:8
↓ 1 callersFunctionfindPainters
38_Painter's Partition Problem/Ideal Solutions/painterPartitionProblem.cpp:6
↓ 1 callersFunctionfindPeakElement
(array, N)
34_Find Peak Element/Ideal Solutions/findPeakElement.py:1
↓ 1 callersFunctionfindPeakElement
34_Find Peak Element/Ideal Solutions/findPeakElement.cpp:3
↓ 1 callersMethodfindPeakElement
(int n,int[] arr)
34_Find Peak Element/Ideal Solutions/findPeakElement.java:9
↓ 1 callersMethodfindPivotIndex
(int[] arr)
35_Search in Rotated & Sorted Array/Ideal Solutions/searchInRotatedSortedArray.java:19
↓ 1 callersMethodfindsubsequences
(String s,String ans)
30_Print all Subsequences of a String/Ideal Solutions/allSubsequencesOfAString.java:15
↓ 1 callersFunctionfizzBuzz
01_Fizz Buzz/Ideal Solutions/fizzBuzz.cpp:3
↓ 1 callersFunctionfizzBuzz
(N)
01_Fizz Buzz/Ideal Solutions/fizzBuzz.py:2
next →1–100 of 354, ranked by callers