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
↓ 1 callersMethodfizzBuzz
(int n)
01_Fizz Buzz/Ideal Solutions/fizzBuzz.java:8
↓ 1 callersFunctionfrequencyInSortedArray
33_Frequency in Sorted Array/Ideal Solutions/frequencyInSortedArray.cpp:3
↓ 1 callersMethodfrequencyInSortedArray
(int[] arr,int k)
33_Frequency in Sorted Array/Ideal Solutions/frequencyInSortedArray.java:42
↓ 1 callersFunctiongasStations
(gas, cost)
40_Gas Stations/Ideal Solutions/gasStations.py:1
↓ 1 callersFunctiongasStations
40_Gas Stations/Ideal Solutions/gasStations.cpp:3
↓ 1 callersMethodgasStations
(int[] gas,int[] cost)
40_Gas Stations/Ideal Solutions/gasStations.java:8
↓ 1 callersMethodgenerateSinglyLinkedList
(int[] arr)
21_Detect Loop in a Linked List/Ideal Solutions/detectLoopInLinkedList.java:43
↓ 1 callersMethodgenerateSinglyLinkedList
(int[] arr)
22_Palindrome Linked List/Ideal Solutions/palindromeLinkedList.java:47
↓ 1 callersMethodgenerateSinglyLinkedList
(int[] arr)
20_Reverse a Linked List/Ideal Solutions/reverseLinkedList.java:46
↓ 1 callersMethodgetLength
(self, head)
22_Palindrome Linked List/Ideal Solutions/palindromeList.py:35
↓ 1 callersMethodgetMin
(self)
13_Min Stack/Ideal Solutions/minStack.py:30
↓ 1 callersMethodgetReversed
(self, head)
22_Palindrome Linked List/Ideal Solutions/palindromeList.py:21
↓ 1 callersFunctiongreatestCommonDivisor
(N, M)
26_GCD/Ideal Solutions/greatestCommonDivisor.py:2
↓ 1 callersFunctiongreatestCommonDivisor
26_GCD/Ideal Solutions/greatestCommonDivisor.cpp:3
↓ 1 callersMethodgreatestCommonDivisor
(int n,int m)
26_GCD/Ideal Solutions/greatestCommonDivisor.java:8
↓ 1 callersFunctionhelper
(listNode1, listNode2, carry)
19_Add Two Linked List/Ideal Solutions/addTwoList.py:8
↓ 1 callersFunctioninfixPostfix
(expression)
12_Infix-Postfix/Ideal Solutions/infixPostfix.py:5
↓ 1 callersFunctioninfixPostfix
12_Infix-Postfix/Ideal Solutions/infixPostfix.cpp:14
↓ 1 callersMethodinfixPostfix
(String a)
12_Infix-Postfix/Ideal Solutions/infixPostfix.java:20
↓ 1 callersFunctionisAttack
31_N-Queens/Ideal Solutions/nQueens.cpp:10
↓ 1 callersMethodisCharacter
(char a)
12_Infix-Postfix/Ideal Solutions/infixPostfix.java:15
↓ 1 callersFunctionisPalindrome
Function to check if the linked list is palindrome or not
22_Palindrome Linked List/Ideal Solutions/palindromeLinkedList.cpp:15
↓ 1 callersFunctionisPowerOfTwo
07_Power of two/Ideal Solutions/powerOfTwo.cpp:6
↓ 1 callersFunctionisSafe
(row, column, board, size)
31_N-Queens/Ideal Solutions/nQueens.py:4
↓ 1 callersFunctionkMax
24_Sliding Window Maximum/Ideal Solutions/slidingWindowMaximum.cpp:6
↓ 1 callersFunctionkSum
25_Two Numbers in Sorted Array whose sum is K/Ideal Solutions/twoNumbersInSortedArraySumK.cpp:7
↓ 1 callersFunctionlongestCommonSubsequence
(sequenceFirst, sequenceSecond)
42_Longest Common Subsequence/Ideal Solutions/longestCommonSubsequence.py:3
↓ 1 callersFunctionlongestCommonSubsequence
42_Longest Common Subsequence/Ideal Solutions/longestCommonSubsequence.cpp:6
↓ 1 callersMethodlongestCommonSubsequence
( char[] arr1, char[] arr2)
42_Longest Common Subsequence/Ideal Solutions/longestCommonSubsequence.java:8
↓ 1 callersFunctionlongestIncreasingSubsequence
(array)
43_Longest Increasing Subsequence/Ideal Solutions/longestIncreasingSubsequence.py:1
↓ 1 callersFunctionlongestIncreasingSubsequence
43_Longest Increasing Subsequence/Ideal Solutions/longestIncreasingSubsequence.cpp:3
↓ 1 callersMethodlongestIncreasingSubsequence
(int[] arr,int n)
43_Longest Increasing Subsequence/Ideal Solutions/longestIncreasingSubsequence.java:8
↓ 1 callersFunctionlongestPalindromeSubstring
(str)
44_Longest Palindromic Substring/Ideal Solutions/longestPalindromeSubstring.py:8
↓ 1 callersFunctionlongestPalindromicSubstring
44_Longest Palindromic Substring/Ideal Solutions/longestPalindromicSubstring.cpp:4
↓ 1 callersMethodlongestPalindromicSubstring
(String str)
44_Longest Palindromic Substring/Ideal Solutions/longestPalindromicSubstring.java:8
↓ 1 callersMethodlowerBound
(int[] arr,int k)
33_Frequency in Sorted Array/Ideal Solutions/frequencyInSortedArray.java:25
↓ 1 callersFunctionmatrixRotation
(matrix)
18_Matrix rotation/Ideal Solutions/matrixRotation.py:2
↓ 1 callersFunctionmatrixRotation
18_Matrix rotation/Ideal Solutions/matrixRotation.cpp:5
↓ 1 callersMethodmatrixRotation
(int[][] matrix)
18_Matrix rotation/Ideal Solutions/matrixRotation.java:8
↓ 1 callersFunctionmaxProfit
39_Best Time to Buy and Sell Stock/Ideal Solutions/bestTimeToBuySellStock.cpp:3
↓ 1 callersFunctionmaximumSumSubArray
(array, size)
46_Maximum_Sum_Subarray/Ideal Solutions/maximumSumSubArray.py:4
↓ 1 callersFunctionmaximumSumSubarray
46_Maximum_Sum_Subarray/Ideal Solutions/maximumSumSubarray.cpp:3
↓ 1 callersMethodmaximumSumSubarray
(int[] arr)
46_Maximum_Sum_Subarray/Ideal Solutions/maximumSumSubarray.java:8
↓ 1 callersFunctionmeetingRooms
41_Meeting Rooms/Ideal Solutions/meetingRooms.cpp:3
↓ 1 callersFunctionmeetingRooms
(intervals)
41_Meeting Rooms/Ideal Solutions/meetingRooms.py:2
↓ 1 callersMethodmeetingRooms
(int[][] intervals)
41_Meeting Rooms/Ideal Solutions/meetingRooms.java:16
↓ 1 callersFunctionminJumpsToEnd
(jumps)
45_Minimum Jumps To Reach The End/Ideal Solutions/minJumpsToEnd.py:3
↓ 1 callersFunctionminJumpsToEnd
45_Minimum Jumps To Reach The End/Ideal Solutions/minJumpsToEnd.cpp:3
↓ 1 callersMethodminJumpsToEnd
(int[] array)
45_Minimum Jumps To Reach The End/Ideal Solutions/minJumpsToTheEnd.java:8
↓ 1 callersFunctionminRotatedSortedArray
36_Minimum in Rotated & Sorted Array/Ideal Solutions/minRotatedSortedArray.cpp:4
↓ 1 callersMethodminimumInSortedRotatedArray
(int[] arr)
36_Minimum in Rotated & Sorted Array/Ideal Solutions/minimumInSorted&RotatedArray.java:8
↓ 1 callersFunctionmoneyAndShopping
47_Money and Shopping/Ideal Solutions/moneyAndShopping.cpp:4
↓ 1 callersFunctionmoneyAndShopping
(arr, N)
47_Money and Shopping/Ideal Solutions/moneyAndShopping.py:3
↓ 1 callersMethodmoneyAndShopping
(int[][] arr,int n)
47_Money and Shopping/Ideal Solutions/money&Shopping.java:14
↓ 1 callersFunctionmostWaterContainer
(container)
23_Container With Most Water/Ideal Solutions/mostWaterContainer.py:3
↓ 1 callersFunctionmostWaterContainer
23_Container With Most Water/Ideal Solutions/mostWaterContainer.cpp:4
↓ 1 callersFunctionnQueens
31_N-Queens/Ideal Solutions/nQueens.cpp:35
↓ 1 callersFunctionnQueens
(board, size, row )
31_N-Queens/Ideal Solutions/nQueens.py:20
↓ 1 callersFunctionnearestSmallerNeighbour
16_Nearest smaller neighbour/Ideal Solutions/nearestSmallerNeighbour.cpp:6
↓ 1 callersMethodnearestSmallerNeighbour
(int[] arr,int n)
16_Nearest smaller neighbour/Ideal Solutions/nearestSmallerNeighbour.java:8
↓ 1 callersFunctionnearestSmallestNeighbour
(array)
16_Nearest smaller neighbour/Ideal Solutions/nearestSmallestNeighbour.py:2
↓ 1 callersFunctionnthFibonacci
(Number)
27_Nth Fibonacci/Ideal Solutions/nthFibonacci.py:2
↓ 1 callersMethodnthFibonacci
(int n)
27_Nth Fibonacci/Ideal Solutions/nthFibonacci.java:7
↓ 1 callersFunctionpainterPartition
(arr, noOfPainters)
38_Painter's Partition Problem/Ideal Solutions/painterPartition.py:14
↓ 1 callersMethodpaintersPartitionProblem
(long[] arr,long low,long high,int k)
38_Painter's Partition Problem/Ideal Solutions/paintersPartitionProblem.java:20
↓ 1 callersMethodpalindromeList
(self)
22_Palindrome Linked List/Ideal Solutions/palindromeList.py:42
↓ 1 callersFunctionpartition
09_Sort Array Using Quick Sort/Ideal Solutions/sortUsingQuicksort.cpp:6
↓ 1 callersFunctionpartition
(array, low, high)
09_Sort Array Using Quick Sort/Ideal Solutions/quickSort.py:3
↓ 1 callersFunctionpartition
38_Painter's Partition Problem/Ideal Solutions/painterPartitionProblem.cpp:26
↓ 1 callersMethodpartition
(int[] arr, int low, int high)
09_Sort Array Using Quick Sort/Ideal Solutions/quickSort.java:7
↓ 1 callersFunctionpermutationWithLargestSum
28_Permutations with Largest Sum/Ideal Solutions/permutationWithLargestSum.cpp:6
↓ 1 callersFunctionpermutationWithLargestSum
(arr, N)
28_Permutations with Largest Sum/Ideal Solutions/permutationWithLargestSum.py:2
↓ 1 callersMethodpermutationWithLargestSum
(int[] arr)
28_Permutations with Largest Sum/Ideal Solutions/permutationWithLargestSum.java:8
↓ 1 callersFunctionpermutations
29_Print All Permutations of an Array/Ideal Solutions/printAllPermutationsOfAnArray.cpp:6
↓ 1 callersFunctionpermutationsOfArray
(array, permutations , size, result)
29_Print All Permutations of an Array/Ideal Solutions/permutationsOfArray.py:3
↓ 1 callersMethodpermutationsOfArray
(int[] a,int l,int h)
29_Print All Permutations of an Array/Ideal Solutions/permutationsOfArray.java:17
↓ 1 callersMethodpop
13_Min Stack/Ideal Solutions/minStack.cpp:22
↓ 1 callersMethodpop
()
13_Min Stack/Ideal Solutions/minStack.java:23
↓ 1 callersFunctionpowerOfTwo
(Number)
07_Power of two/Ideal Solutions/powerOfTwo.py:3
↓ 1 callersMethodpowerOfTwo
(int n)
07_Power of two/Ideal Solutions/powerOfTwo.java:8
↓ 1 callersFunctionprintAllSubsequences
30_Print all Subsequences of a String/Ideal Solutions/allSubsequencesOfAString.cpp:5
↓ 1 callersMethodprintArr
(int arr[], int n)
17_Sort An Array of 0's. 1's and 2's/Ideal Solutions/sortAnArrayOf012.java:7
↓ 1 callersMethodprintArray
(int[] ans)
16_Nearest smaller neighbour/Ideal Solutions/nearestSmallerNeighbour.java:22
↓ 1 callersMethodprintArray
(int[] arr)
29_Print All Permutations of an Array/Ideal Solutions/permutationsOfArray.java:12
↓ 1 callersFunctionprintList
19_Add Two Linked List/Ideal Solutions/addTwoList.cpp:63
↓ 1 callersMethodprintList
(Node head)
19_Add Two Linked List/Ideal Solutions/addTwoLinkedList.java:54
↓ 1 callersMethodprintList
(Node head)
20_Reverse a Linked List/Ideal Solutions/reverseLinkedList.java:35
↓ 1 callersMethodprintMatrix
(int[][] matrix)
18_Matrix rotation/Ideal Solutions/matrixRotation.java:21
↓ 1 callersFunctionprintNode
(temp)
19_Add Two Linked List/Ideal Solutions/addTwoList.py:27
↓ 1 callersFunctionquickSort
09_Sort Array Using Quick Sort/Ideal Solutions/sortUsingQuicksort.cpp:29
↓ 1 callersFunctionquickSort
(array, low, high)
09_Sort Array Using Quick Sort/Ideal Solutions/quickSort.py:19
↓ 1 callersMethodquicksort
(int[] arr, int low, int high)
09_Sort Array Using Quick Sort/Ideal Solutions/quickSort.java:26
↓ 1 callersMethodreverse
20_Reverse a Linked List/Ideal Solutions/reverseALinkedList.cpp:47
↓ 1 callersMethodreverseLinkedList
(Node head)
20_Reverse a Linked List/Ideal Solutions/reverseLinkedList.java:20
↓ 1 callersMethodreverseList
(self)
20_Reverse a Linked List/Ideal Solutions/reverseList.py:14
↓ 1 callersFunctionrodCuttingProblem
(price, size)
51_Rod Cutting Problem/Ideal Solution/rodCuttingProblem.py:3
↓ 1 callersMethodrodCuttingProblem
(int price[],int n)
51_Rod Cutting Problem/Ideal Solution/rodCuttingProblem.java:8
↓ 1 callersFunctionrotatedSortedArraySearch
(nums, target)
35_Search in Rotated & Sorted Array/Ideal Solutions/rotatedSortedArraySearch.py:1
↓ 1 callersFunctionsearch
35_Search in Rotated & Sorted Array/Ideal Solutions/searchInRotatedAndSortedArray.cpp:6
↓ 1 callersMethodsizeStack
(self)
15_Stacksusing two Queues/Ideal Solutions/stackUsingQueues.py:41
← previousnext →101–200 of 354, ranked by callers