Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/NirmalSilwal/Data-Structure-and-Algorithm-Java-interview-kit
/ functions
Functions
2,029 in github.com/NirmalSilwal/Data-Structure-and-Algorithm-Java-interview-kit
⨍
Functions
2,029
◇
Types & classes
791
↓ 1 callers
Method
dequeue
()
CodingBlocks Training/Day17/QueueUsingStackEnqueueEfficient.java:29
↓ 1 callers
Method
dequeue
()
CodingBlocks Training/Day17/QueueUsingArray.java:28
↓ 1 callers
Method
dequeue
()
Interview Prep/section13_LinkedList/QueueUsingLinkedList.java:15
↓ 1 callers
Method
dequeue
()
Interview Prep/section11_Queue/QueueUsingStackEnqueueEfficient.java:21
↓ 1 callers
Method
dequeue
()
Interview Prep/section11_Queue/QueueUsingStackDequeueEfficient.java:16
↓ 1 callers
Method
detectCycle1
(ListNode head)
Leetcode/leetcodeTags/LinkedList/LinkedListCycleII142.java:53
↓ 1 callers
Method
dfsRecursion
(ArrayList<ArrayList<Integer>> adjList, int src, boolean[] visited, int parent)
GeeksForGeeks/Graph/DetectCycleUndirectedGraph.java:28
↓ 1 callers
Method
dfsRecursion
(ArrayList<ArrayList<Integer>> adjList, int src, boolean[] visited, boolean[] recursionStack)
GeeksForGeeks/Graph/DetectCycleDirectedGraph.java:69
↓ 1 callers
Method
dfsTraverse
(char[][] grid, int row, int col, boolean[][] visited)
Leetcode/leetcodeTags/array/NumberOfIslands200.java:38
↓ 1 callers
Method
dfsTraverse
(ArrayList<ArrayList<Integer>> adjList, int vertex, LinkedList<Integer> stack, boolean[] visited)
GeeksForGeeks/Graph/TopologicalSorting.java:62
↓ 1 callers
Method
diameter
(TreeNode node)
Leetcode/easy/DiameterOfBinaryTree543.java:94
↓ 1 callers
Method
diameter
()
Interview Prep/section24_BinaryTree/BinaryTree.java:192
↓ 1 callers
Method
diameter2
()
Interview Prep/section24_BinaryTree/BinaryTree.java:215
↓ 1 callers
Method
diameter3
()
Interview Prep/section24_BinaryTree/BinaryTree.java:243
↓ 1 callers
Method
dijkstraAlgorithm
(String src)
Interview Prep/section20_Graph/Graph.java:757
↓ 1 callers
Method
dispaly
()
Interview Prep/section20_Graph/Graph.java:93
↓ 1 callers
Method
display
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleUndirectedGraph.java:90
↓ 1 callers
Method
display
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/TopologicalSorting.java:38
↓ 1 callers
Method
display
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/NoOfIslands.java:62
↓ 1 callers
Method
display
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DFSTraversal.java:63
↓ 1 callers
Method
display
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleDirectedGraph.java:39
↓ 1 callers
Method
display
(int[] arr)
GeeksForGeeks/Arrays/InsertInArray.java:33
↓ 1 callers
Method
display
(int[] list)
Basic programs/makePrimeLadder.java:71
↓ 1 callers
Method
display
(int[] arr)
Basic programs/mergeSortedArray.java:45
↓ 1 callers
Method
display
(int[][] arr)
CodingBlocks Training/Day7/WavePrint.java:38
↓ 1 callers
Method
display
(int[][] arr)
CodingBlocks Training/Day7/SpiralPrint.java:77
↓ 1 callers
Method
display
()
CodingBlocks Training/Day20/treeTraversals.java:60
↓ 1 callers
Method
display
()
CodingBlocks Training/Day20/binaryTree.java:60
↓ 1 callers
Method
display
(int[] list)
CodingBlocks Training/Day13/boardPathWithLadders.java:86
↓ 1 callers
Method
display
(int[] arr)
CodingBlocks Training/Day14/mergeSort.java:60
↓ 1 callers
Method
display
(int[] arr)
CodingBlocks Training/Day14/quickSort.java:43
↓ 1 callers
Method
display
(char[] arr)
CodingBlocks Training/Day12/PermutationWithSwap.java:23
↓ 1 callers
Method
display
(int[] arr)
CodingBlocks Training/Day9/MergeSortedArray.java:47
↓ 1 callers
Method
display
()
Interview Prep/section23_GenericTree/GenericTree.java:54
↓ 1 callers
Method
display
(int[] arr)
Interview Prep/section9_Time_Space_Complexity/QuickSort.java:52
↓ 1 callers
Method
display
()
Interview Prep/section14_Tree/BinaryTree.java:64
↓ 1 callers
Method
display
()
Interview Prep/section14_Tree/GenericTree.java:47
↓ 1 callers
Method
display
(int[][] arr)
Interview Prep/section4_2DArray/SpiralWavePrint.java:68
↓ 1 callers
Method
display
(int[][] arr)
Interview Prep/section4_2DArray/WavePatternPrint.java:25
↓ 1 callers
Method
display2D
(int[][] grid)
Codechef/StartersSept2021/D.java:49
↓ 1 callers
Method
displayBoardPath
(int end, int current, String result)
CodingBlocks Training/Day11/printBoardPath.java:14
↓ 1 callers
Method
distinctCount
(int[] arr)
GeeksForGeeks/DistinctCountArrays.java:10
↓ 1 callers
Method
dogDetails
()
Basic programs/OOPS/Dog.java:13
↓ 1 callers
Method
downheapify
(int pi)
Interview Prep/section17_Heap/Heap.java:61
↓ 1 callers
Method
downheapify
(int pi)
Interview Prep/section18_Tries/HeapGeneric.java:85
↓ 1 callers
Method
editDistance
(String s1, String s2)
Interview Prep/section19_DynamicProgramming/EditDistance.java:16
↓ 1 callers
Method
editDistanceBottomUpDP
(String s1, String s2)
Interview Prep/section19_DynamicProgramming/EditDistanceDP.java:126
↓ 1 callers
Method
editDistanceIterative
(String s1, String s2)
Interview Prep/section19_DynamicProgramming/EditDistance.java:43
↓ 1 callers
Method
editDistanceTopDownDP
(String s1, String s2, int vidx1, int vidx2, int[][] storage)
Interview Prep/section19_DynamicProgramming/EditDistanceDP.java:92
↓ 1 callers
Method
encode
(String source)
Interview Prep/section18_Tries/HuffmanEncoder.java:96
↓ 1 callers
Method
enqueue
(int value)
CodingBlocks Training/Day16/QueuesUsingArray.java:15
↓ 1 callers
Method
enqueue
(int item)
CodingBlocks Training/Day17/QueueUsingStackEnqueueEfficient.java:24
↓ 1 callers
Method
enqueue
(int item)
Interview Prep/section11_Queue/QueueUsingLinkedList.java:13
↓ 1 callers
Method
evenFill
(int[][] grid)
Codechef/StartersSept2021/D.java:43
↓ 1 callers
Method
factorial
(int n)
Leetcode/easy/FactorialTrailingZeroes172.java:22
↓ 1 callers
Method
factorialRec
(int n)
Interview Prep/section6_Recursion/FactorialRecursive.java:10
↓ 1 callers
Method
fib
(int n)
Leetcode/leetcodeTags/array/FibonacciNumber509.java:8
↓ 1 callers
Method
fibBottomUpSpaceEfficient
(int n)
Interview Prep/section19_DynamicProgramming/Fibonacci.java:53
↓ 1 callers
Method
fibDP
(int n)
Leetcode/leetcodeTags/array/FibonacciNumber509.java:17
↓ 1 callers
Method
fibTopDown
(int n, int[] storage)
Leetcode/leetcodeTags/array/FibonacciNumber509.java:31
↓ 1 callers
Method
fibonacci
(int n)
Interview Prep/section6_Recursion/NthFibonacci.java:12
↓ 1 callers
Method
fibonacci
(int n, int[] storage)
Interview Prep/section19_DynamicProgramming/Fibonacci.java:17
↓ 1 callers
Method
fibonacciIterativeDP
(int n)
Interview Prep/section19_DynamicProgramming/Fibonacci.java:35
↓ 1 callers
Method
fibonacciNonOptimal
(int n)
CodingBlocks Training/Day27/fibonacciDynamicProg.java:62
↓ 1 callers
Method
fibonacciNormal
(int n)
Interview Prep/section19_DynamicProgramming/Fibonacci.java:68
↓ 1 callers
Method
fibonacciRecursiveOptimal
(int n)
CodingBlocks Training/Day27/fibonacciDynamicProg.java:36
↓ 1 callers
Method
find
(int data)
CodingBlocks Training/Day20/findElementinTree.java:72
↓ 1 callers
Method
findDiameter
(Node node)
CodingBlocks Training/Day21/diameterOfTree.java:20
↓ 1 callers
Method
findDisappearedNumbers
(int[] nums)
Leetcode/leetcodeTags/array/FindAllNumbersDisappearedInArray448.java:9
↓ 1 callers
Method
findDuplicates
(int[] arr)
Leetcode/DailyChallenges/Leetcode_August_Challenge/arrayDuplicates.java:14
↓ 1 callers
Method
findMaxConsecutiveOnes
(int[] nums)
Leetcode/Explore_cards/Arrays/MaxConsecutiveOnes.java:10
↓ 1 callers
Method
findMaxSubarray
(int left, int right)
Basic programs/revision/MaximumSubarrayLC53.java:52
↓ 1 callers
Method
findMissingFirst
(int[] arr)
UncodeYoutube/array/MissingFirstPositveNumber.java:8
↓ 1 callers
Method
findMissingTwoXORapproach
(int[] arr)
UncodeYoutube/array/TwoMissingNumberInArray.java:44
↓ 1 callers
Method
findPrefixSum
(int[] arr)
UncodeYoutube/array/PrefixSum.java:18
↓ 1 callers
Method
findSecret
(String key)
Codeforces/virtualContest/Div3/Round650/A.java:34
↓ 1 callers
Method
findSubarraySum
(int[] arr, int start, int end)
UncodeYoutube/array/SubarraySum.java:7
↓ 1 callers
Method
findSubsets
(ArrayList<Integer> arr, int index, int N, int currentSum, ArrayList<Integer> answer)
GeeksForGeeks/SubsetSums.java:17
↓ 1 callers
Method
findUniqueCount
(int[] arr)
Basic programs/MS_CS_MIU/Frequent_Questions/SingleMode.java:79
↓ 1 callers
Method
find_unique
(int[] arr)
CodingBlocks Training/Day8/UniqueElementArray.java:12
↓ 1 callers
Method
firstIndex
(int[] arr, int si, int data)
CodingBlocks Training/Recursion/FirstIndex.java:15
↓ 1 callers
Method
firstIndexSimple
(int[] arr, int si, int data)
CodingBlocks Training/Recursion/FirstIndexSimple.java:15
↓ 1 callers
Method
firstNegativeInSubarray
(int[] arr, int k)
Interview Prep/section11_Queue/FirstNegativeNumInEverySubarray.java:15
↓ 1 callers
Method
firstNonRepeatingCharInStream
()
Interview Prep/section11_Queue/FirstNonRepeatingCharacter.java:15
↓ 1 callers
Method
first_index
(int[] arr, int index, int data)
CodingBlocks Training/Day10/LinearSearchRecursively.java:19
↓ 1 callers
Method
flipEquivalent
(BinaryTree other)
Interview Prep/section24_BinaryTree/BinaryTree.java:583
↓ 1 callers
Method
front
()
CodingBlocks Training/Day19/queueUsingLinkedList.java:24
↓ 1 callers
Method
front
()
CodingBlocks Training/Day17/QueueUsingStackEnqueueEfficient.java:44
↓ 1 callers
Method
front
()
Interview Prep/section13_LinkedList/QueueUsingLinkedList.java:19
↓ 1 callers
Method
front
()
Interview Prep/section11_Queue/QueueUsingLinkedList.java:29
↓ 1 callers
Method
fun3
()
CodingBlocks Training/Day16/childAbstract.java:17
↓ 1 callers
Method
generate
(int numRows)
Leetcode/easy/PascalsTriangle118.java:8
↓ 1 callers
Method
getAt
(int index)
CodingBlocks Training/Day18/LinkedList.java:104
↓ 1 callers
Method
getBoardPath
(int start, int end)
Interview Prep/section7_GetRecursion/BoardPath.java:15
↓ 1 callers
Method
getCode
(char firstChar)
CodingBlocks Training/Day11/printKeypadCodes.java:30
↓ 1 callers
Method
getFirst
()
CodingBlocks Training/Day18/Question/LinkedList.java:94
↓ 1 callers
Method
getInOrder
(Node node, ArrayList<Integer> list)
Interview Prep/section14_Tree/BinaryTree.java:189
↓ 1 callers
Method
getIslands
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/NoOfIslands.java:35
↓ 1 callers
Method
getKthLastValue
(LinkedList list, int k)
CodingBlocks Training/Day19/KthNodeFromLast.java:27
↓ 1 callers
Method
getLast
()
CodingBlocks Training/Day18/Question/LinkedList.java:99
← previous
next →
601–700 of 2,029, ranked by callers