MCPcopy Create free account

hub / github.com/anyulu/grokking-the-coding-interview / functions

Functions319 in github.com/anyulu/grokking-the-coding-interview

⨍ Functions 319◇ Types & classes 182
↓ 219 callersMethodadd
(int num)
TopKElements/KthLargestNumberInStream.java:15
↓ 88 callersMethodget
(int index)
ModifiedBinarySearch/SearchInfiniteSortedArray.java:8
↓ 47 callersMethodprint
(int[][] arr)
BitwiseXOR/PC1-FlipAndInvertImage.java:16
↓ 15 callersMethodprint
(int tasks, Map<Integer, Integer> map, Map<Integer, List<Integer>> requireMap, Q
TopologicalSort/AllTaskSchedulingOrders.java:24
↓ 14 callersMethodremove
(int[] arr)
TwoPointers/RemoveDuplicates.java:3
↓ 14 callersMethodsort
(int[] arr)
TwoPointers/DutchFlag.java:3
↓ 7 callersMethodpush
(int num)
TopKElements/PC3-FrequencyStack.java:27
↓ 6 callersMethodfindLRSLength
(String str)
GrokkingDP/LongestRepeatingSubsequence.java:3
↓ 6 callersMethodnext
(int[]nums, int curr)
Fast&SlowPointers/PC3-CircularArrayLoop.java:24
↓ 5 callersMethodfindMPPCuts
(String st)
GrokkingDP/PalindromicPartitioning.java:3
↓ 5 callersMethodfindMinimumMeetingRooms
(List<Meeting> intervals)
MergeIntervals/PC1-MinimumMeetingRooms.java:15
↓ 4 callersMethoddistFromOrigin
()
TopKElements/KClosestPointsToOrigin.java:12
↓ 4 callersMethodfindMax
(int[] arr)
ModifiedBinarySearch/MaxInBitonicArray.java:3
↓ 4 callersMethodinsertNum
(int num)
TwoHeaps/MedianOfAStream.java:10
↓ 4 callersMethodreorganizeString
(String str, int k)
TopKElements/PC1-RearrangeStringKDistanceApart.java:5
↓ 4 callersMethodsearch
(ArrayReader reader, int key)
ModifiedBinarySearch/SearchInfiniteSortedArray.java:17
↓ 4 callersMethodsearch
(int[] arr, int key)
ModifiedBinarySearch/BinarySearch.java:3
↓ 4 callersMethodsearch
(int[] arr, int key)
ModifiedBinarySearch/PC1-SearchBitonicArray.java:3
↓ 4 callersMethodsearchCeilingOfANumber
(int[] arr, int key)
ModifiedBinarySearch/CeilingOfANumber.java:3
↓ 4 callersMethodsearchMinDiffElement
(int[] arr, int key)
ModifiedBinarySearch/MinimumDifference.java:3
↓ 4 callersMethodsearchNextLetter
(char[] letters, char key)
ModifiedBinarySearch/NextLetter.java:3
↓ 3 callersMethodcanAttendAllAppointments
(Interval[] intervals)
MergeIntervals/ConflictingAppointments.java:15
↓ 3 callersMethodcanConstruct
(int[] originalSeq, int[][] sequences)
TopologicalSort/PC1-SequenceReconstruction.java:4
↓ 3 callersMethodcanPartition
(int[] num, int sum)
0-1Knapsack(DP)/SubsetSum.java:3
↓ 3 callersMethodcanPartition
(int[] num)
0-1Knapsack(DP)/PartitionSetDiff.java:3
↓ 3 callersMethodcountRotations
(int[] arr)
ModifiedBinarySearch/PC3-RotationCountOfRotatedArray.java:3
↓ 3 callersMethodfindClosestElements
(int[] arr, int K, Integer X)
TopKElements/KClosestElements.java:16
↓ 3 callersMethodfindCycleStart
(ListNode head)
Fast&SlowPointers/LinkedListCycleStart.java:12
↓ 3 callersMethodfindEmployeeFreeTime
(List<List<Interval>> schedule)
MergeIntervals/PC3-EmployeeFreeTime.java:15
↓ 3 callersMethodfindKthSmallestNumber
(int[] nums, int k)
TopKElements/KthSmallestNumber.java:5
↓ 3 callersMethodfindLPSLength
(String st)
GrokkingDP/LongestPalindromicSubsequence.java:3
↓ 3 callersMethodfindMaxCPULoad
(List<Job> jobs)
MergeIntervals/PC2-MaximumCPULoad.java:17
↓ 3 callersMethodfindMaximumDistinctElements
(int[] nums, int k)
TopKElements/MaximumDistinctElements.java:5
↓ 3 callersMethodfindMaximumPathSum
(TreeNode root)
TreeDepthFirstSearch/PC2-MaximumPathSum.java:13
↓ 3 callersMethodfindMedian
()
TwoHeaps/MedianOfAStream.java:16
↓ 3 callersMethodfindMiddle
(ListNode head)
Fast&SlowPointers/MiddleOfLinkedList.java:12
↓ 3 callersMethodfindMinOperations
(String s1, String s2)
GrokkingDP/EditDistance.java:3
↓ 3 callersMethodfindMinimumDeletions
(String st)
GrokkingDP/MinimumDeletionsPalindrome.java:3
↓ 3 callersMethodfindOrder
(String[] words)
TopologicalSort/AlienDictionary.java:4
↓ 3 callersMethodfindOrder
(int tasks, int[][] prerequisites)
TopologicalSort/TaskSchedulingOrder.java:4
↓ 3 callersMethodfindRange
(int[] arr, int key)
ModifiedBinarySearch/FindRange.java:3
↓ 3 callersMethodfindTrees
(int nodes, int[][] edges)
TopologicalSort/PC2-MinimumHeightTrees.java:4
↓ 3 callersMethodgetNext
(int num)
Fast&SlowPointers/HappyNumber.java:13
↓ 3 callersMethodhasCycle
(ListNode head)
Fast&SlowPointers/LinkedListCycle.java:12
↓ 3 callersMethodinsert
(List<Interval> intervals, Interval newInterval)
MergeIntervals/InsertInterval.java:15
↓ 3 callersMethodisSchedulingPossible
(int tasks, int[][] prerequisites)
TopologicalSort/TaskScheduling.java:4
↓ 3 callersMethodloopExists
(int[] nums)
Fast&SlowPointers/PC3-CircularArrayLoop.java:3
↓ 3 callersMethodmerge
(List<Interval> intervals)
MergeIntervals/MergeIntervals.java:15
↓ 3 callersMethodminimumCostToConnectRopes
(int[] ropeLengths)
TopKElements/ConnectRopes.java:5
↓ 3 callersMethodpop
()
TopKElements/PC3-FrequencyStack.java:33
↓ 3 callersMethodprintOrders
(int tasks, int[][] prerequisites)
TopologicalSort/AllTaskSchedulingOrders.java:4
↓ 3 callersMethodrearrangeString
(String str)
TopKElements/RearrangeString.java:5
↓ 3 callersMethodsort
(int vertices, int[][] edges)
TopologicalSort/TopologicalSort.java:4
↓ 2 callersMethodbitwiseComplement
(int n)
BitwiseXOR/CalculateComplement.java:4
↓ 2 callersMethodcountSubsets
(int[] num, int sum)
0-1Knapsack(DP)/PC1-SubsetSum.java:2
↓ 2 callersMethoddiffWaysToEvaluateExpression
(String input)
Subsets/PC1-EvaluateExpression.java:4
↓ 2 callersMethodfind
(int num)
Fast&SlowPointers/HappyNumber.java:3
↓ 2 callersMethodfindDepth
(TreeNode root)
TreeBreadthFirstSearch/MinimumBinaryTreeDepth.java:14
↓ 2 callersMethodfindDiameter
(TreeNode root)
TreeDepthFirstSearch/PC1-TreeDiameter.java:13
↓ 2 callersMethodfindKLargestNumbers
(int[] nums, int k)
TopKElements/KLargestNumbers.java:6
↓ 2 callersMethodfindKthSmallest
(int[][] matrix, int k)
K-WayMerge/KthSmallestInSortedMatrix.java:5
↓ 2 callersMethodfindLCSLength
(String s1, String s2)
GrokkingDP/LongestCommonSubsequence.java:3
↓ 2 callersMethodfindLISLength
(int[] nums)
GrokkingDP/LongestIncreasingSubsequence.java:3
↓ 2 callersMethodfindLetterCaseStringPermutations
(String str)
Subsets/LetterCaseStringPermutation.java:5
↓ 2 callersMethodfindMaximumCapital
(int[] capital, int[] profits, int numberOfProjects, int initialCapital)
TwoHeaps/MaximizeCapital.java:4
↓ 2 callersMethodfindNextInterval
(Interval[] intervals)
TwoHeaps/PC1-NextInterval.java:14
↓ 2 callersMethodfindPath
(TreeNode root, int[] sequence)
TreeDepthFirstSearch/PathWithGivenSequence.java:14
↓ 2 callersMethodfindPermutations
(int[] nums)
Subsets/Permutations.java:6
↓ 2 callersMethodfindSingleNumbers
(int[] nums)
BitwiseXOR/TwoSingleNumbers.java:5
↓ 2 callersMethodfindSlidingWindowMedian
(int[] nums, int k)
TwoHeaps/SlidingWindowMedian.java:19
↓ 2 callersMethodfindSubsets
(int[] nums)
Subsets/SubsetWithDuplicates.java:5
↓ 2 callersMethodfindSubsets
(int[] nums)
Subsets/Subsets.java:5
↓ 2 callersMethodfindSuccessor
(TreeNode root, int key)
TreeBreadthFirstSearch/LevelOrderSuccessor.java:14
↓ 2 callersMethodfindSumOfElements
(int[] nums, int k1, int k2)
TopKElements/SumOfElements.java:5
↓ 2 callersMethodfindTargetSubsets
(int[] num, int s)
0-1Knapsack(DP)/PC2-TargetSum.java:3
↓ 2 callersMethodfindTopKFrequentNumbers
(int[] nums, int k)
TopKElements/TopKFrequentNumbers.java:5
↓ 2 callersMethodflipAndInvertImage
(int[][] arr)
BitwiseXOR/PC1-FlipAndInvertImage.java:2
↓ 2 callersMethodgenerateGeneralizedAbbreviation
(String word)
Subsets/GeneralizedAbbreviation.java:5
↓ 2 callersMethodgenerateValidParentheses
(int num)
Subsets/GenerateParentheses.java:5
↓ 2 callersMethodhasPath
(TreeNode root, int sum)
TreeDepthFirstSearch/TreePathSum.java:14
↓ 2 callersMethodinsert
(int num)
TwoHeaps/SlidingWindowMedian.java:7
↓ 2 callersMethodisPalindrome
(ListNode head)
Fast&SlowPointers/PC1-PalindromicLinkedList.java:12
↓ 2 callersMethodmerge
(Interval[] arr1, Interval[] arr2)
MergeIntervals/IntervalsIntersection.java:15
↓ 2 callersMethodreverse
(ListNode head)
Fast&SlowPointers/PC1-PalindromicLinkedList.java:34
↓ 2 callersMethodscheduleTasks
(char[] tasks, int k)
TopKElements/PC2-TaskScheduler.java:5
↓ 2 callersMethodsearch
(int[] arr, int key)
ModifiedBinarySearch/PC2-SearchRotatedArray.java:3
↓ 2 callersMethodsolveKnapsack
(int[] profits, int[] weights, int capacity)
0-1Knapsack(DP)/Knapsack.java:2
↓ 2 callersMethodsolveRodCutting
(int[] lengths, int[] prices, int n)
GrokkingDP/RodCutting.java:3
↓ 2 callersMethodsortCharacterByFrequency
(String str)
TopKElements/FrequencySort.java:5
↓ 1 callersMethodclone
(Queue<Integer> queue)
TopologicalSort/AllTaskSchedulingOrders.java:48
↓ 1 callersMethodconnect
(TreeNode root)
TreeBreadthFirstSearch/PC1-ConnectAllSiblings.java:16
↓ 1 callersMethodconnect
(TreeNode root)
TreeBreadthFirstSearch/ConnectLevelOrderSiblings.java:36
↓ 1 callersMethodcount
(int[][] matrix, int mid, int[] pair)
K-WayMerge/KthSmallestInSortedMatrix.java:49
↓ 1 callersMethodcount
(int start, int end)
Subsets/PC3-CountUniqueTrees.java:20
↓ 1 callersMethodcountPaths
(TreeNode root, int S)
TreeDepthFirstSearch/CountAllPathSum.java:14
↓ 1 callersMethodcountTrees
(int n)
Subsets/PC3-CountUniqueTrees.java:14
↓ 1 callersMethoddfs
(TreeNode root, int sum, int currSum)
TreeDepthFirstSearch/TreePathSum.java:21
↓ 1 callersMethoddfs
(TreeNode root)
TreeDepthFirstSearch/PC2-MaximumPathSum.java:21
↓ 1 callersMethoddfs
(TreeNode root, int[] sequence, int index)
TreeDepthFirstSearch/PathWithGivenSequence.java:20
↓ 1 callersMethoddfs
(TreeNode root, int num)
TreeDepthFirstSearch/SumOfPathNumbers.java:23
next →1–100 of 319, ranked by callers