MCPcopy Create free account

hub / github.com/NirmalSilwal/Data-Structure-and-Algorithm-Java-interview-kit / functions

Functions2,029 in github.com/NirmalSilwal/Data-Structure-and-Algorithm-Java-interview-kit

⨍ Functions 2,029◇ Types & classes 791
↓ 1 callersMethodmaximumProduction
(int d, int x, int y, int z)
Codechef/JulyLongChallenge2021/A.java:26
↓ 1 callersMethodmaximumSubarrySum
(int[] arr)
UncodeYoutube/array/MaximumSubarraySumKadanes.java:5
↓ 1 callersMethodmazePathBlocked
(int[][] maze, int row, int col, String ans, boolean[][] visited)
Interview Prep/section12_Backtracking/BlockedMazePathMove4Directions.java:15
↓ 1 callersMethodmazePathBottomUpDP
(int er, int ec)
Interview Prep/section19_DynamicProgramming/MazePath.java:62
↓ 1 callersMethodmazePathBottomUpSpaceEfficient
(int er, int ec)
Interview Prep/section19_DynamicProgramming/MazePath.java:82
↓ 1 callersMethodmazePathDiagBottomUpDP
(int er, int ec)
Interview Prep/section19_DynamicProgramming/MazePathDiagonal.java:62
↓ 1 callersMethodmazePathDiagBottomUpSpaceEfficient
(int er, int ec)
Interview Prep/section19_DynamicProgramming/MazePathDiagonal.java:82
↓ 1 callersMethodmazePathDiagonalTopDownDP
(int cr, int cc, int er, int ec, int[][] storage)
Interview Prep/section19_DynamicProgramming/MazePathDiagonal.java:38
↓ 1 callersMethodmerge
(int[] nums1, int m, int[] nums2, int n)
Leetcode/easy/MergeSortedArray88.java:7
↓ 1 callersMethodmerge
(ListNode list1, ListNode list2)
Leetcode/leetcodeTags/LinkedList/MergeTwoSortedLists21.java:28
↓ 1 callersMethodmerge
(int[][] intervals)
Leetcode/leetcodeTags/array/MergeIntervals56.java:10
↓ 1 callersMethodmerge
(int[] arr1, int[] arr2)
Basic programs/mergeSortedArray.java:14
↓ 1 callersMethodmerge
(LinkedList firstList, LinkedList secondList)
CodingBlocks Training/Day19/mergeSortLinkedList.java:66
↓ 1 callersMethodmergeArray
(int[] arr1, int[] arr2)
CodingBlocks Training/Day14/mergeSort.java:29
↓ 1 callersMethodmergeArray
(int[] arr1, int[] arr2)
CodingBlocks Training/Day9/MergeSortedArray.java:16
↓ 1 callersMethodmergeArray
(int[] arr1, int[] arr2)
Interview Prep/section9_Time_Space_Complexity/MergeSort.java:33
↓ 1 callersMethodmergeIntervals
(ArrayList<Pair> allpairs)
Top Questions/Facebook/mergeOverlappingIntervals.java:19
↓ 1 callersMethodmergeSort
(int[] arr, int start, int end)
Interview Prep/section9_Time_Space_Complexity/MergeSort.java:15
↓ 1 callersMethodmergeSortLL
(LinkedList list)
CodingBlocks Training/Day19/mergeSortLinkedList.java:27
↓ 1 callersMethodmergeSorting
(int[] arr, int start, int end)
CodingBlocks Training/Day14/mergeSort.java:15
↓ 1 callersMethodminDistance
(int n)
Basic programs/MS_CS_MIU/Frequent_Questions/MinimumDistance.java:13
↓ 1 callersMethodminDistanceDP
(String word1, String word2, int vid1, int vid2, int[][] storage)
Leetcode/hard/EditDistance72.java:48
↓ 1 callersMethodminDistanceDP
(String word1, String word2, int vid1, int vid2, int[][] storage)
Leetcode/DailyChallenges/MayChallenges/DeleteOperationTwoStrings.java:40
↓ 1 callersMethodminNodeData
(Node node)
CodingBlocks Training/Day20/minDatainBinaryTree.java:64
↓ 1 callersMethodmirror
()
CodingBlocks Training/Day20/mirrorBinaryTree.java:88
↓ 1 callersMethodmissingElement
(int[] arr)
UncodeYoutube/array/FindMissingElement.java:5
↓ 1 callersMethodmissingNumber
(int[] nums)
Leetcode/seanPrashadList/MissingNumber268.java:13
↓ 1 callersMethodmissingNumber
(int[] nums)
Leetcode/easy/MissingNumber.java:7
↓ 1 callersMethodmixtureTopDownDP
(int[] colors, int si, int ei, int[][] storage)
Interview Prep/section19_DynamicProgramming/MixutureColors.java:66
↓ 1 callersMethodmoveAllXatEnd
(String str)
CodingBlocks Training/Day10/MoveAllXAtEndRecursively.java:12
↓ 1 callersMethodmoveZeroLeft
(int[] arr)
Top Questions/Facebook/moveZerosToLeft.java:18
↓ 1 callersMethodmoveZeroes
(int[] nums)
Leetcode/leetcodeTags/array/MoveZeroes283.java:7
↓ 1 callersMethodmoveZerosToLeft
(int[] arr)
GeeksForGeeks/Arrays/MoveZerosToFront.java:18
↓ 1 callersMethodmoveZerosToRight
(int[] arr)
GeeksForGeeks/Arrays/MoveZerosToEnd2.java:19
↓ 1 callersMethodmoveZerosToRight
(int[] arr)
GeeksForGeeks/Arrays/MoveZerosToEnd.java:19
↓ 1 callersMethodmySqrt
(int x)
Leetcode/easy/SquareRootX69.java:6
↓ 1 callersMethodnKnights
(boolean[][] board, int row, int col, int placedKnights, String ans)
Interview Prep/section12_Backtracking/NKnights.java:17
↓ 1 callersMethodnQueenCombinations
(boolean[][] board, int row, int queensPlaced, int queens, String ans)
Interview Prep/section12_Backtracking/NQueen2.java:11
↓ 1 callersMethodnQueens
(boolean[][] board, int row, int col, int placedQueens, String ans)
Interview Prep/section12_Backtracking/NQueenGeneral.java:15
↓ 1 callersMethodnearestValidPoint
(int x, int y, int[][] points)
Leetcode/Study Plan/ProgrammingSkills/Skills1/Day3/FindNearestPoint1779.java:5
↓ 1 callersMethodnextGreaterElement
(int[] arr)
CodingBlocks Training/Day17/nextGreaterElementArray.java:13
↓ 1 callersMethodnextGreaterElement
(int[] arr)
CodingBlocks Training/Day17/nextGreaterOptimal.java:15
↓ 1 callersMethodnextGreaterElement
(int[] arr)
Interview Prep/section10_Stacks/NextGreaterElementUsingStack.java:14
↓ 1 callersMethodnextInt
()
Codeforces/virtualContest/Div3/Round650/A.java:61
↓ 1 callersMethodnextInt
()
Codeforces/problemset/rating800/Watermelon4A.java:46
↓ 1 callersMethodnextLine
()
Codechef/StartersSept2021/C.java:67
↓ 1 callersMethodnumIslands
(char[][] grid)
Leetcode/leetcodeTags/array/NumberOfIslands200.java:15
↓ 1 callersMethododdFill
(int[][] grid)
Codechef/StartersSept2021/D.java:36
↓ 1 callersMethodpairDiameter
(binaryTree tree)
CodingBlocks Training/Day21/diameterOfTree2.java:19
↓ 1 callersMethodpairSummingToFullSquare
(int[] numbers)
Basic programs/codesignal/Test2.java:12
↓ 1 callersMethodpalindromeStorage
(String str)
Interview Prep/section19_DynamicProgramming/PalindromePartitioning.java:147
↓ 1 callersMethodpartition
(int[] arr, int start, int end)
UncodeYoutube/sorting/QuickSort.java:19
↓ 1 callersMethodpartition
(int[] arr, int si, int ei)
CodingBlocks Training/Day14/quickSort.java:23
↓ 1 callersMethodpartition
(int[] arr, int low, int high)
Interview Prep/section9_Time_Space_Complexity/QuickSort2.java:25
↓ 1 callersMethodpascalTriangleSum
(int totalRows)
Interview Prep/section22_BitMasking/PascalSum.java:10
↓ 1 callersMethodpatternMatchRecursionVid
(String src, String pattern, int vidxSrc, int vidxPat)
Interview Prep/section19_DynamicProgramming/WildcardPatternMatching.java:81
↓ 1 callersMethodpermute
(int[] nums)
Leetcode/medium/Permutations46.java:35
↓ 1 callersMethodpivotIndex
(int[] nums)
Leetcode/leetcodeTags/array/FindPivotIndex724.java:44
↓ 1 callersMethodpop
()
CodingBlocks Training/Day15/stackUsingArrays.java:21
↓ 1 callersMethodpop
()
Interview Prep/section13_LinkedList/StackUsingLinkedList.java:15
↓ 1 callersMethodpop
()
Interview Prep/section11_Queue/StackUsingQueuePushEfficient.java:22
↓ 1 callersMethodpostOrder
()
CodingBlocks Training/Day20/treeTraversals.java:117
↓ 1 callersMethodpostOrderTraversal
()
Interview Prep/section14_Tree/BinaryTree.java:141
↓ 1 callersMethodpostorder
()
Interview Prep/section24_BinaryTree/BinaryTree.java:363
↓ 1 callersMethodpower
(int x, int n)
Interview Prep/section6_Recursion/PowerRecursive.java:9
↓ 1 callersMethodpowerBetter
(int n, int pow)
CodingBlocks Training/Day10/PowerOfNOptimized.java:15
↓ 1 callersMethodpowerCheck2
(int n)
CodingBlocks Training/Day8/PowerOf2Check.java:16
↓ 1 callersMethodpreOrder
()
CodingBlocks Training/Day20/treeTraversals.java:91
↓ 1 callersMethodpreOrderTraversal
()
Interview Prep/section14_Tree/BinaryTree.java:112
↓ 1 callersMethodpreorder
()
Interview Prep/section24_BinaryTree/BinaryTree.java:335
↓ 1 callersMethodpreorderIterative
()
Interview Prep/section24_BinaryTree/BinaryTree.java:385
↓ 1 callersMethodprintAllChars
(String str)
CodingBlocks Training/Day7/StringQuestions.java:13
↓ 1 callersMethodprintAllKeypadCodes
(String str, String result)
CodingBlocks Training/Day11/printKeypadCodes.java:13
↓ 1 callersMethodprintAllSubStrings
(String str)
CodingBlocks Training/Day7/StringQuestions.java:19
↓ 1 callersMethodprintBoard
(int[][] board)
CodingBlocks Training/Day13/sudukoSolver.java:100
↓ 1 callersMethodprintBoardpath
(int start, int end, String ans)
Interview Prep/section8_PrintRecursion/PrintBoardPath.java:11
↓ 1 callersMethodprintChars
(String s)
Interview Prep/section5_Strings/PrintCharacterInString.java:18
↓ 1 callersMethodprintCodesOfString
(String str, String result)
CodingBlocks Training/Day11/codesOfString.java:11
↓ 1 callersMethodprintDec
(int n)
CodingBlocks Training/Recursion/printDecreasing.java:11
↓ 1 callersMethodprintDecInc
(int n)
CodingBlocks Training/Recursion/printDecreasingIncreasing.java:11
↓ 1 callersMethodprintDecInc
(int n)
CodingBlocks Training/Day10/PrintDecreasingIncreasing.java:12
↓ 1 callersMethodprintDecIncRecursive
(int n)
Interview Prep/section6_Recursion/PrintDecreasingIncreasing.java:11
↓ 1 callersMethodprintDecIncSkip
(int n)
CodingBlocks Training/Recursion/PrintSkipDecInc.java:19
↓ 1 callersMethodprintDecIncSkipRecursive
(int n)
Interview Prep/section6_Recursion/PrintDecIncSkip.java:10
↓ 1 callersMethodprintDecreasingRecursive
(int n)
Interview Prep/section6_Recursion/PrintDecreasing.java:11
↓ 1 callersMethodprintFiboncacci
(int n)
Interview Prep/section1_basic/FibonacciSeries.java:18
↓ 1 callersMethodprintGrid
(int er, int ec, int cr, int cc, String result)
CodingBlocks Training/Day11/printMazePath.java:16
↓ 1 callersMethodprintInc
(int n)
CodingBlocks Training/Recursion/printIncreasing.java:11
↓ 1 callersMethodprintIncDecSkip
(int n)
CodingBlocks Training/Day10/PrintNumSkip.java:12
↓ 1 callersMethodprintIncreasing
(int n)
CodingBlocks Training/Day10/PrintIncreasing.java:12
↓ 1 callersMethodprintIncreasingRecursive
(int n)
Interview Prep/section6_Recursion/PrintIncreasing.java:11
↓ 1 callersMethodprintLexico
(int end, int current)
CodingBlocks Training/Day12/PrintLexicographicalOrder.java:11
↓ 1 callersMethodprintMazePathHurdle
(int[][] arr, int endRow, int endCol, int currentRow, int currentCol)
CodingBlocks Training/Day12/mazePathWithHurdles.java:18
↓ 1 callersMethodprintMazepath
(int cr, int cc, int er, int ec, String ans)
Interview Prep/section8_PrintRecursion/PrintMazePath.java:12
↓ 1 callersMethodprintMazepathDiagonal
(int cr, int cc, int er, int ec, String ans)
Interview Prep/section8_PrintRecursion/PrintMazePathDiagonal.java:12
↓ 1 callersMethodprintNQueens
(boolean[][] board, int row, String ans)
Interview Prep/section8_PrintRecursion/PrintNQueens.java:14
↓ 1 callersMethodprintNum
(int n)
CodingNinja/recursion/printNumbers1toN.java:5
↓ 1 callersMethodprintPairs
(int[] arr)
Basic programs/complexityAnalysis2.java:14
↓ 1 callersMethodprintPatternRec
(int n, int row, int col)
Interview Prep/section6_Recursion/PatternRecursive.java:11
↓ 1 callersMethodprintPermutation
(char[] arr, int front, int back)
CodingBlocks Training/Day12/PermutationWithSwap.java:12
← previousnext →801–900 of 2,029, ranked by callers