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
↓ 2 callersMethodsortedSquares
(int[] nums)
Leetcode/leetcodeTags/array/SquaresOfASortedArray977.java:9
↓ 2 callersMethodstart
()
Interview Prep/section19_DynamicProgramming/MatrixChainMultiplication.java:6
↓ 2 callersMethodstartAlgo
()
CodingBlocks Training/Day27/fibonacciDynamicProg.java:11
↓ 2 callersMethodsubArrayZero
(int[] arr)
Interview Prep/section16_Hashmap/SubarraySumZero.java:17
↓ 2 callersMethodsubtractProductAndSum
(int n)
Leetcode/Study Plan/ProgrammingSkills/Skills1/Day2/SubtractProductSumDigitsInteger1281.java:5
↓ 2 callersMethodsum
()
Interview Prep/section24_BinaryTree/BinaryTree.java:436
↓ 2 callersMethodsumIsPower2
(int[] arr)
Basic programs/MS_CS_MIU/Frequent_Questions/SumIsPower.java:38
↓ 2 callersMethodswap
(int[] arr, int i, int j)
UncodeYoutube/sorting/DutchNationalFlagProblem.java:31
↓ 2 callersMethodswap
(int[] arr, int i, int j)
UncodeYoutube/sorting/QuickSort.java:32
↓ 2 callersMethodswap
(int[] arr, int i, int j)
GeeksForGeeks/SortBinaryArray.java:24
↓ 2 callersMethodswap
(int[] arr, int i, int j)
Codeforces/livecontest/Round728Div2/A.java:47
↓ 2 callersMethodswap
(int[] arr, int i, int j)
CodingBlocks Training/Day14/quickSort.java:37
↓ 2 callersMethodswap
(char[] arr, int index1, int index2)
CodingBlocks Training/Day12/PermutationWithSwap.java:30
↓ 2 callersMethodswap
(int[] arr, int i, int j)
Interview Prep/section9_Time_Space_Complexity/QuickSort2.java:48
↓ 2 callersMethodswap
(int[] arr, int i, int j)
Interview Prep/section9_Time_Space_Complexity/Sorting_DutchNationalFlag.java:36
↓ 2 callersMethodtop
()
CodingBlocks Training/Day17/stackUsingArray.java:43
↓ 2 callersMethoduniqueBSTsBottomUpDP
(int n)
Interview Prep/section19_DynamicProgramming/UniqueBSTsCount.java:63
↓ 2 callersMethodupdatePriority
(T pair)
Interview Prep/section18_Tries/HeapGeneric.java:108
↓ 2 callersMethodupheapify
(int childIndex)
Interview Prep/section18_Tries/HeapGeneric.java:47
↓ 2 callersMethodupperIndexOfItem
(int[] arr, int item)
Interview Prep/section3_Function_1DArray/UpperBound.java:12
↓ 1 callersMethodDFSTraverse
(ArrayList<ArrayList<Integer>> adjList, int src, boolean[] visited)
GeeksForGeeks/Graph/NoOfIslands.java:51
↓ 1 callersMethodDFSTraverseDisconnected
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DFSTraversal.java:87
↓ 1 callersMethodLCSBottomUpDP
(String s1, String s2)
Interview Prep/section19_DynamicProgramming/LCS.java:106
↓ 1 callersMethodLCSTopDownDP
(String s1, String s2, int vidx1, int vidx2, int[][] storage)
Interview Prep/section19_DynamicProgramming/LCS.java:79
↓ 1 callersMethodLPSBottomUpDP
(String str)
Interview Prep/section19_DynamicProgramming/LongestPalindromicSubsequence.java:77
↓ 1 callersMethodLPSTopDownDP
(String str, int si, int ei, int[][] storage)
Interview Prep/section19_DynamicProgramming/LongestPalindromicSubsequence.java:51
↓ 1 callersMethodMCMRecursion
(int[] matrices, int si, int ei)
Interview Prep/section19_DynamicProgramming/MatrixChainMultiplication.java:59
↓ 1 callersMethodSumProduct
(int[] arr)
Basic programs/complexityAnaysis1.java:14
↓ 1 callersMethodTOH
(int n, String source, String destination, String helper)
CodingBlocks Training/Day12/TowerOfHanoi.java:11
↓ 1 callersMethodaddFirst
(T item)
Interview Prep/section16_Hashmap/GenericLinkedList.java:48
↓ 1 callersMethodaddItem
(int item)
Interview Prep/section14_Tree/BinarySearchTree.java:115
↓ 1 callersMethodaddTwoInteger
(LinkedList<Integer> list1, LinkedList<Integer> list2)
Top Questions/Facebook/LinkedListAdd2Integer.java:7
↓ 1 callersMethodallIndices
(int[] arr, int si, int data, int count)
Interview Prep/section6_Recursion/SearchAllIndices.java:17
↓ 1 callersMethodbacktrack
(int[] nums, boolean[] visited, ArrayList<Integer> permutations, List<List<Integer>> result)
Leetcode/medium/Permutations46.java:45
↓ 1 callersMethodbaseConversion5To10
(int n)
Interview Prep/section3_Function_1DArray/NumberConversionBase5To10.java:9
↓ 1 callersMethodbfsDisconnectedGraph
(ArrayList<ArrayList<Integer>> adj)
GeeksForGeeks/Graph/BFSTraversal.java:101
↓ 1 callersMethodbinSearch
(int[] arr, int item)
Interview Prep/section3_Function_1DArray/BinarySearch.java:10
↓ 1 callersMethodbinSearchRecursive
(int[] arr, int key)
DSAOneAnujBhaiya/dsaLecture/BinarySearch.java:25
↓ 1 callersMethodbinarySearch
(ArrayList<Integer> sublist, int curr)
Leetcode/DailyChallenges/JulyChallenges/LongestIncreasingSubsequence.java:54
↓ 1 callersMethodbinarySearch
(int[] arr, int key)
DSAOneAnujBhaiya/dsaLecture/BinarySearch.java:5
↓ 1 callersMethodbinarySearch
(int[] arr, int si, int ei, int item)
Interview Prep/section19_DynamicProgramming/LongestIncSubsequenceOptimal.java:48
↓ 1 callersMethodbinarySearchElement
(int[] arr, int key, int start, int end)
CodingBlocks Training/Day14/binarySearch.java:19
↓ 1 callersMethodbinarySearchFirstIndex
(int[] arr, int key)
CodingBlocks Training/Day14/firstIndexSearch.java:13
↓ 1 callersMethodbinarySearchLastIndex
(int[] arr, int key)
CodingBlocks Training/Day14/lastIndexSearch.java:13
↓ 1 callersMethodboardPath
(int[] ladder, int curr, int end, String result)
CodingBlocks Training/Day13/boardPathWithLadders.java:67
↓ 1 callersMethodboardPathBottomUp
(int end)
Interview Prep/section19_DynamicProgramming/BoardPath.java:60
↓ 1 callersMethodboardPathBottomUpSpaceEfficient
(int end)
Interview Prep/section19_DynamicProgramming/BoardPath.java:74
↓ 1 callersMethodbreadthFirstSearchTraverse
(ArrayList<ArrayList<Integer>> adj, int src, boolean[] visited)
GeeksForGeeks/Graph/BFSTraversal.java:73
↓ 1 callersMethodbubbleSort
(int[] arr)
CodingBlocks Training/Day6/BubbleSort.java:14
↓ 1 callersMethodbubbleSort
(int[] arr, int si, int li)
CodingBlocks Training/Recursion/BubbleSort.java:15
↓ 1 callersMethodbubbleSort
(T[] arr)
Interview Prep/section15_InterfaceAndGenerics/bubble sort generic/BubbleSort.java:29
↓ 1 callersMethodbubbleSort
(int[] arr, int si, int li)
Interview Prep/section6_Recursion/BubbleSortRecursive.java:18
↓ 1 callersMethodbubbleSort
(int[] arr)
Interview Prep/section3_Function_1DArray/BubbleSort.java:15
↓ 1 callersMethodbuildArray
(int[] nums)
Leetcode/leetcodeTags/array/BuildArrayFromPermutation1920.java:18
↓ 1 callersMethodcanAttendMeetings
(int[][] intervals)
Leetcode/easy/MeetingRooms252.java:62
↓ 1 callersMethodcanAttendMeetings1
(int[][] intervals)
Leetcode/easy/MeetingRooms252.java:21
↓ 1 callersMethodcheckDeletion
(String s, int low, int high, int deletioncount)
Leetcode/DailyChallenges/April2022/Day2ValidPalindromeII680.java:12
↓ 1 callersMethodcheckEvenCount
(int n)
Leetcode/Explore_cards/Arrays/CountEvenDigitsRevise.java:25
↓ 1 callersMethodcheckPowerOf2
(int n)
CodingBlocks Training/Day8/PowerOf2Check.java:32
↓ 1 callersMethodcheckPrime
(int n)
Basic programs/makePrimeLadder.java:59
↓ 1 callersMethodcheckPrime
(int index)
CodingBlocks Training/Day13/boardPathWithLadders.java:29
↓ 1 callersMethodcheckTwoWords
(String current, String next, String order)
Leetcode/easy/VerifyingAlienDictionary953.java:32
↓ 1 callersMethodclimbStairsDP
(int n, int[] storage)
Leetcode/easy/ClimbingStairs70.java:25
↓ 1 callersMethodcoinChange
(int[] coins, int amount, String ans, int coinIndex)
Interview Prep/section12_Backtracking/CoinChangeCoinRespect.java:15
↓ 1 callersMethodcoinCombinations
(int[] coins, int amount, String ans, int currentSum, int lastCoinIdx)
Interview Prep/section12_Backtracking/CoinCombinations.java:17
↓ 1 callersMethodcoinPermutation
(int[] coins, int amount, String ans, int currentSum)
Interview Prep/section12_Backtracking/CoinChangePermutations.java:11
↓ 1 callersMethodcompare
(Car2 thisCar, Car2 otherCar)
Interview Prep/section15_InterfaceAndGenerics/comparator demo using Bubble sort/carPriceComparator.java:10
↓ 1 callersMethodcompareTo
(Node other)
Interview Prep/section18_Tries/HuffmanEncoder.java:30
↓ 1 callersMethodconstruct
(Node parent, int ith)
Interview Prep/section23_GenericTree/GenericTree.java:23
↓ 1 callersMethodconstruct
(int[] pre, int plow, int phigh, int[] in, int ilow, int ihigh)
Interview Prep/section24_BinaryTree/BinaryTree.java:555
↓ 1 callersMethodconstructBST
(int[] arr, int low, int high)
Interview Prep/section14_Tree/BinarySearchTree.java:18
↓ 1 callersMethodconstructTree
(int[] arr, int si, int ei)
Interview Prep/section21_SegmentTrees/SegmentTree.java:19
↓ 1 callersMethodcontains
(int key)
Leetcode/leetcodeTags/LinkedList/DesignHashSet705.java:78
↓ 1 callersMethodcontainsDuplicate
(int[] nums)
Leetcode/easy/ContainsDuplicate217.java:22
↓ 1 callersMethodcountBinaryOnes
(int num)
Leetcode/easy/CountingBits338.java:16
↓ 1 callersMethodcountBits
(int n)
Leetcode/DailyChallenges/March2022/Day1CountingBitsLC338.java:8
↓ 1 callersMethodcountBoardPath
(int end, int current, int[] storage)
Interview Prep/section19_DynamicProgramming/CountBoardPathDP.java:13
↓ 1 callersMethodcountBoardPathIterative
(int n)
Interview Prep/section19_DynamicProgramming/CountBoardPathDP.java:33
↓ 1 callersMethodcountBoardpath
(int start, int end)
Interview Prep/section8_PrintRecursion/CountBoardPath.java:10
↓ 1 callersMethodcountCharacters
(String[] words, String chars)
Leetcode/MustDoEasyList/FindWordsThatCanBeFormedByCharacters1160.java:7
↓ 1 callersMethodcountCurrentDigit
(int d, int n)
Basic programs/MS_CS_MIU/Frequent_Questions/MaxOccuringDigit2.java:37
↓ 1 callersMethodcountDigits
(int num)
CodingNinja/recursion/NumberOfDigitsInNumber.java:5
↓ 1 callersMethodcountGridPath
(int er, int ec, int cr, int cc, String result)
CodingBlocks Training/Day11/CountMazePath.java:16
↓ 1 callersMethodcountMazepath
(int cr, int cc, int er, int ec)
Interview Prep/section8_PrintRecursion/CountMazePath.java:13
↓ 1 callersMethodcountMazepathDiag
(int cr, int cc, int er, int ec)
Interview Prep/section8_PrintRecursion/CountMazePathDiagonal.java:13
↓ 1 callersMethodcountNQueens
(boolean[][] board, int row)
CodingBlocks Training/Day12/NQueen.java:13
↓ 1 callersMethodcountNQueens
(boolean[][] board, int row)
Interview Prep/section8_PrintRecursion/CountNQueens.java:15
↓ 1 callersMethodcountOdds2
(int low, int high)
Leetcode/Study Plan/ProgrammingSkills/Skills1/Day1/CountOddNumbers1523.java:19
↓ 1 callersMethodcountOverlappingIntervals
(int[][] range)
UncodeYoutube/array/MaximumOverlappingIntervals.java:5
↓ 1 callersMethodcountPrimes
(int n)
Leetcode/easy/CountPrimes204.java:5
↓ 1 callersMethoddecimalToAnyBase
(int n, int sourceBase, int destBase)
Interview Prep/section3_Function_1DArray/NumberConversionBase10To5.java:12
↓ 1 callersMethoddecode
(String codedString)
Interview Prep/section18_Tries/HuffmanEncoder.java:106
↓ 1 callersMethoddeleteAndEarn
(int[] nums)
Leetcode/DailyChallenges/March2022/Day5DeleteAndEarnLC740.java:24
↓ 1 callersMethoddeleteElement
(int[] arr, int element)
GeeksForGeeks/Arrays/DeleteInArray.java:17
↓ 1 callersMethoddemo
(int[] myarr)
CodingBlocks Training/Day5/ArrayDemo.java:28
↓ 1 callersMethoddemo2
(int[] myarr)
CodingBlocks Training/Day5/ArrayDemo.java:32
↓ 1 callersMethoddemo3
(int[] arr)
CodingBlocks Training/Day5/ArrayDemo.java:39
↓ 1 callersMethoddepthFirstTraverse
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleUndirectedGraph.java:11
↓ 1 callersMethoddepthFirstTraverse
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleDirectedGraph.java:50
↓ 1 callersMethoddequeue
()
CodingBlocks Training/Day16/QueuesUsingArray.java:25
← previousnext →501–600 of 2,029, ranked by callers