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
↓ 1 callersMethoddfs
(TreeNode root, int len)
TreeDepthFirstSearch/PC1-TreeDiameter.java:20
↓ 1 callersMethoddfs
(TreeNode root, int S, int count, boolean next)
TreeDepthFirstSearch/CountAllPathSum.java:18
↓ 1 callersMethoddfs
(TreeNode root, int sum, List<Integer> list, int currSum, List<List<Integer>> res)
TreeDepthFirstSearch/FindAllTreePaths.java:22
↓ 1 callersMethoddfs
(int[] nums, boolean[] used, List<Integer> list, List<List<Integer>> res)
Subsets/Permutations.java:13
↓ 1 callersMethoddfs
(List<String> result, String word, int index, String s, int num)
Subsets/GeneralizedAbbreviation.java:12
↓ 1 callersMethoddfs
(List<String> result, String s, int left, int right, int num)
Subsets/GenerateParentheses.java:12
↓ 1 callersMethoddfs
(List<String> permutations, String str, String s, int index)
Subsets/LetterCaseStringPermutation.java:12
↓ 1 callersMethoddp
(int[] profits, int[] weights, int capacity, int index, int res)
0-1Knapsack(DP)/Knapsack.java:7
↓ 1 callersMethodfind
(List<List<Integer>> quadruplets, int[] arr, int target, int curr)
TwoPointers/PC1-QuadrupleSumToTarget.java:17
↓ 1 callersMethodfindClosestPoints
(Point[] points, int k)
TopKElements/KClosestPointsToOrigin.java:20
↓ 1 callersMethodfindKLargestPairs
(int[] nums1, int[] nums2, int k)
K-WayMerge/PC1-LargestPairs.java:5
↓ 1 callersMethodfindKthSmallest
(List<Integer[]> lists, int k)
K-WayMerge/KthSmallestInMSortedArrays.java:5
↓ 1 callersMethodfindLCSLength
(String s1, String s2)
GrokkingDP/LongestCommonSubstring.java:3
↓ 1 callersMethodfindLRSLengthRecursive
(Integer[][] dp, String str, int i1, int i2)
GrokkingDP/LongestRepeatingSubsequence.java:8
↓ 1 callersMethodfindLevelAverages
(TreeNode root)
TreeBreadthFirstSearch/LevelAverage.java:14
↓ 1 callersMethodfindPaths
(TreeNode root, int sum)
TreeDepthFirstSearch/FindAllTreePaths.java:14
↓ 1 callersMethodfindSingleNumber
(int[] arr)
BitwiseXOR/SingleNumber.java:2
↓ 1 callersMethodfindSmallestRange
(List<Integer[]> lists)
K-WayMerge/SmallestRange.java:14
↓ 1 callersMethodfindSumOfPathNumbers
(TreeNode root)
TreeDepthFirstSearch/SumOfPathNumbers.java:15
↓ 1 callersMethodfindUniqueTrees
(int n)
Subsets/PC2-UniqueTrees.java:14
↓ 1 callersMethodgenerate
(int start, int end)
Subsets/PC2-UniqueTrees.java:20
↓ 1 callersMethodgetMedian
()
TwoHeaps/SlidingWindowMedian.java:14
↓ 1 callersMethodmerge
(ListNode[] lists)
K-WayMerge/MergeKSortedLists.java:14
↓ 1 callersMethodpermutation
(String s, String t)
SlidingWindow/PC1-StringPermutation.java:22
↓ 1 callersMethodprintLevelOrder
()
TreeBreadthFirstSearch/ConnectLevelOrderSiblings.java:15
↓ 1 callersMethodreorder
(ListNode head)
Fast&SlowPointers/PC2-RearrangeList.java:13
↓ 1 callersMethodreverse
(ListNode head, int p, int q)
In-PlaceReversalOfALinkedList/ReverseSubList.java:14
↓ 1 callersMethodreverse
(ListNode head)
In-PlaceReversalOfALinkedList/ReverseLinkedList.java:12
↓ 1 callersMethodreverse
(ListNode head, int k)
In-PlaceReversalOfALinkedList/PC1-ReverseEveryKElements.java:14
↓ 1 callersMethodreverse
(ListNode head, int k)
In-PlaceReversalOfALinkedList/ReverseEveryKElements.java:14
↓ 1 callersMethodreverse
(ListNode head)
Fast&SlowPointers/PC2-RearrangeList.java:40
↓ 1 callersMethodrotate
(ListNode head, int rotations)
In-PlaceReversalOfALinkedList/PC2-RotateList.java:14
↓ 1 callersMethodswap
(int[] arr, int i, int j)
TwoPointers/DutchFlag.java:15
↓ 1 callersMethodtraverse
(TreeNode root)
TreeBreadthFirstSearch/LevelOrderTraversal.java:14
↓ 1 callersMethodtraverse
(TreeNode root)
TreeBreadthFirstSearch/ReverseLevelOrderTraversal.java:14
↓ 1 callersMethodtraverse
(TreeNode root)
TreeBreadthFirstSearch/PC2-RightViewTree.java:14
↓ 1 callersMethodtraverse
(TreeNode root)
TreeBreadthFirstSearch/ZigzagTraversal.java:14
MethodArrayReader
(int[] arr)
ModifiedBinarySearch/SearchInfiniteSortedArray.java:4
MethodElement
(int index, int listIndex)
K-WayMerge/SmallestRange.java:7
MethodElement
(int num, int frequency, int sequence)
TopKElements/PC3-FrequencyStack.java:8
MethodEntry
(int key, int value)
TopKElements/KClosestElements.java:8
MethodInterval
(int start, int end)
MergeIntervals/PC3-EmployeeFreeTime.java:7
MethodInterval
(int start, int end)
MergeIntervals/IntervalsIntersection.java:7
MethodInterval
(int start, int end)
MergeIntervals/MergeIntervals.java:7
MethodInterval
(int start, int end)
MergeIntervals/ConflictingAppointments.java:7
MethodInterval
(int start, int end)
MergeIntervals/InsertInterval.java:7
MethodInterval
(int start, int end)
TwoHeaps/PC1-NextInterval.java:7
MethodJob
(int start, int end, int cpuLoad)
MergeIntervals/PC2-MaximumCPULoad.java:8
MethodKthLargestNumberInStream
(int[] nums, int k)
TopKElements/KthLargestNumberInStream.java:7
MethodListNode
(int value)
K-WayMerge/MergeKSortedLists.java:7
MethodListNode
(int value)
In-PlaceReversalOfALinkedList/PC2-RotateList.java:7
MethodListNode
(int value)
In-PlaceReversalOfALinkedList/ReverseSubList.java:7
MethodListNode
(int value)
In-PlaceReversalOfALinkedList/ReverseLinkedList.java:5
MethodListNode
(int value)
In-PlaceReversalOfALinkedList/PC1-ReverseEveryKElements.java:7
MethodListNode
(int value)
In-PlaceReversalOfALinkedList/ReverseEveryKElements.java:7
MethodListNode
(int value)
Fast&SlowPointers/PC1-PalindromicLinkedList.java:5
MethodListNode
(int value)
Fast&SlowPointers/LinkedListCycle.java:5
MethodListNode
(int value)
Fast&SlowPointers/PC2-RearrangeList.java:6
MethodListNode
(int value)
Fast&SlowPointers/LinkedListCycleStart.java:5
MethodListNode
(int value)
Fast&SlowPointers/MiddleOfLinkedList.java:5
MethodMedianOfAStream
()
TwoHeaps/MedianOfAStream.java:6
MethodMeeting
(int start, int end)
MergeIntervals/PC1-MinimumMeetingRooms.java:7
MethodPoint
(int x, int y)
TopKElements/KClosestPointsToOrigin.java:7
MethodTreeNode
(int x)
TreeDepthFirstSearch/TreePathSum.java:7
MethodTreeNode
(int x)
TreeDepthFirstSearch/PC2-MaximumPathSum.java:6
MethodTreeNode
(int x)
TreeDepthFirstSearch/PathWithGivenSequence.java:8
MethodTreeNode
(int x)
TreeDepthFirstSearch/SumOfPathNumbers.java:8
MethodTreeNode
(int x)
TreeDepthFirstSearch/PC1-TreeDiameter.java:6
MethodTreeNode
(int x)
TreeDepthFirstSearch/CountAllPathSum.java:8
MethodTreeNode
(int x)
TreeDepthFirstSearch/FindAllTreePaths.java:8
MethodTreeNode
(int x)
Subsets/PC3-CountUniqueTrees.java:8
MethodTreeNode
(int x)
Subsets/PC2-UniqueTrees.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/PC1-ConnectAllSiblings.java:9
MethodTreeNode
(int x)
TreeBreadthFirstSearch/LevelOrderTraversal.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/MinimumBinaryTreeDepth.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/LevelAverage.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/LevelOrderSuccessor.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/ReverseLevelOrderTraversal.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/ConnectLevelOrderSiblings.java:9
MethodTreeNode
(int x)
TreeBreadthFirstSearch/PC2-RightViewTree.java:8
MethodTreeNode
(int x)
TreeBreadthFirstSearch/ZigzagTraversal.java:8
MethodcanPartition
(int[] num)
0-1Knapsack(DP)/PartitionSet.java:3
MethodcanPartition
(int[] num)
GrokkingDP/PartitionSet.java:3
MethodcanPartition
(int[] num, int sum)
GrokkingDP/SubsetSum.java:3
Methodcompare
(String str1, String str2)
TwoPointers/PC2-BackspaceCompare.java:3
Methodcompare
(Element e1, Element e2)
TopKElements/PC3-FrequencyStack.java:16
MethodcountSubsets
(int[] num, int sum)
GrokkingDP/SubsetSumCount.java:2
MethodfindLength
(String str, int k)
SlidingWindow/CharacterReplacement.java:2
MethodfindLength
(int[] arr, int k)
SlidingWindow/ReplacingOnes.java:2
MethodfindLength
(char[] arr)
SlidingWindow/MaxFruitCountOf2Types.java:4
MethodfindLength
(String str)
SlidingWindow/NoRepeatSubstring.java:4
MethodfindLength
(String str, int k)
SlidingWindow/LongestSubstringKDistinct.java:4
MethodfindMaxSumSubArray
(int k, int[] arr)
SlidingWindow/MaxSumSubArrayOfSizeK.java:2
MethodfindMinSubArray
(int S, int[] arr)
SlidingWindow/MinSizeSubArraySum.java:2
MethodfindMissingNumber
(int[] nums)
CyclicSort/MissingNumber.java:3
MethodfindNumber
(int[] nums)
CyclicSort/FindDuplicate.java:3
MethodfindNumber
(int[] nums)
CyclicSort/PC2-FirstMissingPositive.java:3
MethodfindNumbers
(int[] nums)
CyclicSort/PC1-FindCorruptNums.java:3
MethodfindNumbers
(int[] nums, int k)
CyclicSort/PC3-FirstKMissingPositive.java:5
MethodfindNumbers
(int[] nums)
CyclicSort/FindAllDuplicate.java:5
← previousnext →101–200 of 319, ranked by callers