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 callersMethodgetLast
()
CodingBlocks Training/Day19/LinkedList.java:112
↓ 1 callersMethodgetMaxFrequencyCharacter
(String str)
Interview Prep/section16_Hashmap/MaxFrequencyCharacter.java:15
↓ 1 callersMethodgetMazePath
(int cr, int cc, int er, int ec)
Interview Prep/section7_GetRecursion/MazePathArrayList.java:14
↓ 1 callersMethodgetMazePathDiag
(int cr, int cc, int er, int ec)
Interview Prep/section7_GetRecursion/MazePathDiagonal.java:17
↓ 1 callersMethodgetMergeSortedList
(LinkedList list1, LinkedList list2)
CodingBlocks Training/Day19/mergeLinkedList.java:36
↓ 1 callersMethodgetMidNode
(LinkedList list)
CodingBlocks Training/Day19/mergeSortLinkedList.java:51
↓ 1 callersMethodgetNthFib
(int n)
Algoexpert/easy/NthFibonacci.java:5
↓ 1 callersMethodgetPermutation
(String s)
Interview Prep/section7_GetRecursion/GetPermutations2.java:12
↓ 1 callersMethodgetSS
(String s, String result, ArrayList<String> ans)
Interview Prep/section7_GetRecursion/SubsequencesArrayList.java:18
↓ 1 callersMethodgetSquareDigits
(int n)
Leetcode/MustDoEasyList/HappyNumber202.java:28
↓ 1 callersMethodgetSubsequences
(String s)
Interview Prep/section7_GetRecursion/SubsequencesArrayList.java:11
↓ 1 callersMethodgetSubsequences
(String s)
Interview Prep/section7_GetRecursion/Subsequences2.java:11
↓ 1 callersMethodgetTrimmedBSTRoot
(TreeNode root, int low, int high)
Leetcode/MustDoEasyList/TrimABinarySearchTree669.java:89
↓ 1 callersMethodhasCycle
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleUndirectedGraph.java:7
↓ 1 callersMethodhasCycleDirected
(ArrayList<ArrayList<Integer>> adjList)
GeeksForGeeks/Graph/DetectCycleDirectedGraph.java:46
↓ 1 callersMethodheight
()
CodingBlocks Training/Day20/heightOfBinaryTree.java:70
↓ 1 callersMethodheight
()
Interview Prep/section23_GenericTree/GenericTree.java:148
↓ 1 callersMethodheight
()
Interview Prep/section14_Tree/BinaryTree.java:93
↓ 1 callersMethodhelloGun
()
CodingBlocks Training/Day5/Functions.java:41
↓ 1 callersMethodinOrder
()
CodingBlocks Training/Day20/treeTraversals.java:104
↓ 1 callersMethodinOrderIterative
()
Interview Prep/section14_Tree/BinaryTree.java:229
↓ 1 callersMethodinOrderTraversal
()
Interview Prep/section14_Tree/BinaryTree.java:126
↓ 1 callersMethodinitEncoderDecoder
(Node node, String outputSoFar)
Interview Prep/section18_Tries/HuffmanEncoder.java:83
↓ 1 callersMethodinitializeMap
(HashMap<String, Integer> map)
Leetcode/MustDoEasyList/RomanToInteger13.java:42
↓ 1 callersMethodinorder
()
Interview Prep/section24_BinaryTree/BinaryTree.java:349
↓ 1 callersMethodinsertAtIndex
(int[] arr, int n, int capacity, int element, int pos)
GeeksForGeeks/Arrays/InsertInArray.java:20
↓ 1 callersMethodinsertionSort
(int[] arr)
CodingBlocks Training/Day6/InsertionSort.java:14
↓ 1 callersMethodinsertionSort
(int[] arr)
Interview Prep/section3_Function_1DArray/InsertionSort.java:15
↓ 1 callersMethodintersect
(int[] nums1, int[] nums2)
Leetcode/easy/IntersectionOfTwoArraysII_350.java:9
↓ 1 callersMethodintersectionArrays
(int[] arr1, int[] arr2)
Interview Prep/section16_Hashmap/ArrayIntersection.java:18
↓ 1 callersMethodisBST
()
Interview Prep/section14_Tree/BinaryTree.java:210
↓ 1 callersMethodisBalanced
()
Interview Prep/section24_BinaryTree/BinaryTree.java:270
↓ 1 callersMethodisBalanced3
()
Interview Prep/section24_BinaryTree/BinaryTree.java:301
↓ 1 callersMethodisBinaryTreeTheBST
()
Interview Prep/section14_Tree/BinaryTree.java:181
↓ 1 callersMethodisBinaryTreeTheBST2
(Node node, int min, int max)
Interview Prep/section14_Tree/BinaryTree.java:215
↓ 1 callersMethodisConnected
()
Interview Prep/section20_Graph/Graph.java:447
↓ 1 callersMethodisCyclic
()
Interview Prep/section20_Graph/Graph.java:383
↓ 1 callersMethodisGoodString
(String word, String chars)
Leetcode/MustDoEasyList/FindWordsThatCanBeFormedByCharacters1160.java:19
↓ 1 callersMethodisItSafeToPlaceKnight
(boolean[][] board, int row, int col)
Interview Prep/section12_Backtracking/NKnights.java:44
↓ 1 callersMethodisItSafeToPlaceQueen
(boolean[][] board, int row, int col)
Interview Prep/section12_Backtracking/QueenCombination2DKill.java:40
↓ 1 callersMethodisItSafeToPlaceQueen
(boolean[][] board, int row, int col)
Interview Prep/section12_Backtracking/NQueenGeneral.java:42
↓ 1 callersMethodisLarger
(int pi, int ci)
CodingBlocks Training/Day25/HeapsImplementation.java:44
↓ 1 callersMethodisOverlapping
(int start1, int end1, int start2, int end2)
Leetcode/easy/MeetingRooms252.java:43
↓ 1 callersMethodisPrime
(int n)
Leetcode/easy/CountPrimes204.java:19
↓ 1 callersMethodisPrime
(int n)
Basic programs/MS_CS_MIU/Frequent_Questions/BunkerArray.java:31
↓ 1 callersMethodisPrime
(int n)
Basic programs/MS_CS_MIU/Frequent_Questions/MinimumPrimeDistance.java:34
↓ 1 callersMethodisSafePosition
(boolean[][] board, int row, int col)
CodingBlocks Training/Day12/NQueen.java:29
↓ 1 callersMethodisSafeToPlace
(boolean[][] board, int row, int col)
Interview Prep/section8_PrintRecursion/PrintNQueens.java:31
↓ 1 callersMethodisSafeToPlace
(boolean[][] board, int row, int col)
Interview Prep/section8_PrintRecursion/CountNQueens.java:33
↓ 1 callersMethodisSafetoPlace
(int[][] board, int row, int col, int num, int boardLength)
CodingBlocks Training/Day13/sudukoSolver.java:73
↓ 1 callersMethodisSorted
(ArrayList<Integer> list)
Interview Prep/section14_Tree/BinaryTree.java:201
↓ 1 callersMethodisSortedArray
(int[] arr, int index)
CodingBlocks Training/Day10/isSorted.java:11
↓ 1 callersMethodisSquare
(int num)
Basic programs/codesignal/Test2.java:24
↓ 1 callersMethodisTwinPrime
(int n)
Basic programs/MS_CS_MIU/Frequent_Questions/TwinArray.java:76
↓ 1 callersMethodisValid
(int x, int y, int x2, int y2)
Leetcode/Study Plan/ProgrammingSkills/Skills1/Day3/FindNearestPoint1779.java:31
↓ 1 callersMethodisValidCharacter
(char ch)
Leetcode/DailyChallenges/MayChallenges/ValidNumber.java:74
↓ 1 callersMethodisbalanced
(binaryTree tree)
CodingBlocks Training/Day21/isBalancedTree.java:7
↓ 1 callersMethodkOrderedLCSBottomUpDP
(String s1, String s2, int K)
Interview Prep/section19_DynamicProgramming/KOrderedLCS.java:90
↓ 1 callersMethodkOrderedLCSRecursion
(String s1, String s2, int k, int vidx1, int vidx2)
Interview Prep/section19_DynamicProgramming/KOrderedLCS.java:35
↓ 1 callersMethodkOrderedLCSTopDownDP
(String s1, String s2, int k, int vidx1, int vidx2, int[][][] storage)
Interview Prep/section19_DynamicProgramming/KOrderedLCS.java:60
↓ 1 callersMethodknapsack01Rec
(int[] weight, int[] price, int capacity, int vidx)
Interview Prep/section19_DynamicProgramming/Knapsack.java:53
↓ 1 callersMethodknightMinHealthBottomUpDP
(int[][] dungeon)
Interview Prep/section19_DynamicProgramming/DungeonGame.java:85
↓ 1 callersMethodknightMinHealthRecursion
(int[][] dungeon, int cr, int cc, int er, int ec)
Interview Prep/section19_DynamicProgramming/DungeonGame.java:21
↓ 1 callersMethodknightMinHealthTopDownDP
(int[][] dungeon, int cr, int cc, int er, int ec, int[][] storage)
Interview Prep/section19_DynamicProgramming/DungeonGame.java:51
↓ 1 callersMethodlastIndex
(int[] arr, int si, int data)
CodingBlocks Training/Recursion/LastIndex.java:15
↓ 1 callersMethodlastIndex
(int[] arr, int si, int data, int ans)
Interview Prep/section6_Recursion/LastIndexInArray.java:21
↓ 1 callersMethodlcs
(String str1, String str2)
Interview Prep/section19_DynamicProgramming/LongestCommonSubsequence.java:13
↓ 1 callersMethodlcs3StrBottomUpDP
(String s1, String s2, String s3)
Interview Prep/section19_DynamicProgramming/LCS3Strings.java:85
↓ 1 callersMethodlcs3StrRecursion
(String s1, String s2, String s3, int vidx1, int vidx2, int vidx3)
Interview Prep/section19_DynamicProgramming/LCS3Strings.java:32
↓ 1 callersMethodlcs3StrTopDownDP
(String s1, String s2, String s3, int vidx1, int vidx2, int vidx3, int[][][] storage)
Interview Prep/section19_DynamicProgramming/LCS3Strings.java:55
↓ 1 callersMethodlcsIterative
(String str1, String str2)
Interview Prep/section19_DynamicProgramming/LongestCommonSubsequence.java:33
↓ 1 callersMethodleftView
(binaryTree tree)
CodingBlocks Training/Day21/leftViewOfTree.java:11
↓ 1 callersMethodlevelOrderTraversal
(Node node)
CodingBlocks Training/Day21/levelOrderTraversalOfTree.java:20
↓ 1 callersMethodlevelOrderTraversal
()
Interview Prep/section14_Tree/BinaryTree.java:155
↓ 1 callersMethodlinSearch
(int[] arr, int item)
Interview Prep/section3_Function_1DArray/LinearSearch.java:12
↓ 1 callersMethodlongestIncSubseq
(int[] arr)
Interview Prep/section19_DynamicProgramming/LongestIncSubsequenceOptimal.java:17
↓ 1 callersMethodlongestIncSubseq
(int[] arr)
Interview Prep/section19_DynamicProgramming/LongestIncreasingSubsequence.java:16
↓ 1 callersMethodmagicNo
(int index)
Interview Prep/section22_BitMasking/MagicNumber.java:12
↓ 1 callersMethodmajorityElement
(int[] nums)
Leetcode/leetcodeTags/array/MajorityElement169.java:10
↓ 1 callersMethodmajorityElement2
(int[] nums)
Leetcode/leetcodeTags/array/MajorityElement169.java:34
↓ 1 callersMethodmajorityElement3
(int[] nums)
Leetcode/leetcodeTags/array/MajorityElement169.java:40
↓ 1 callersMethodmakeLadder
(int n)
Basic programs/makePrimeLadder.java:11
↓ 1 callersMethodmakeLadder
(int n, boolean[] primes)
CodingBlocks Training/Day13/boardPathWithLadders.java:42
↓ 1 callersMethodmax
()
Interview Prep/section23_GenericTree/GenericTree.java:94
↓ 1 callersMethodmaxArray
(int[] arr)
Interview Prep/section3_Function_1DArray/MaxOfArray.java:10
↓ 1 callersMethodmaxInEveryWindow
(int[] arr, int windowSize)
Interview Prep/section11_Queue/MaxInEveryWindowOfSizeK.java:17
↓ 1 callersMethodmaxInEveryWindowOptimal
(int[] arr, int k)
Interview Prep/section11_Queue/MaxInEveryWindowOfSizeK.java:35
↓ 1 callersMethodmaxNodeData
(Node node)
CodingBlocks Training/Day20/maxDataInBinaryTree.java:64
↓ 1 callersMethodmaxProfit3
(int[] prices)
Leetcode/easy/BestTimeToBuyAndSellStock121.java:52
↓ 1 callersMethodmaxSubArraySum
(int[] arr)
CodingBlocks Training/Day6/MaxSubArraySum.java:11
↓ 1 callersMethodmaxSubarraySum
(int[] arr, int k)
GeeksForGeeks/SlidingWindow/MaximumSubarraySum.java:6
↓ 1 callersMethodmaxSubarraySum2
(int[] arr, int k)
GeeksForGeeks/SlidingWindow/MaximumSubarraySum.java:23
↓ 1 callersMethodmaxSubarraySumCircular
(int[] arr)
Leetcode/medium/918. MaximumSumCircularSubarray2.java:11
↓ 1 callersMethodmaxSubtreeSum1
()
Interview Prep/section24_BinaryTree/BinaryTree.java:480
↓ 1 callersMethodmaxSubtreeSum2
()
Interview Prep/section24_BinaryTree/BinaryTree.java:503
↓ 1 callersMethodmaxSubtreeSum3
()
Interview Prep/section24_BinaryTree/BinaryTree.java:534
↓ 1 callersMethodmaxValue
(int[] arr)
CodingBlocks Training/Day5/MaxInArrray.java:12
↓ 1 callersMethodmax_subarray_sum
(int[] arr)
CodingBlocks Training/Day9/MaxSubArraySum1.java:12
↓ 1 callersMethodmax_subarray_sum2
(int[] arr)
CodingBlocks Training/Day9/MaxSubArraySum2.java:10
↓ 1 callersMethodmax_subarray_sum3
(int[] arr)
CodingBlocks Training/Day9/Kadanes_MaxSubArraySum3.java:10
← previousnext →701–800 of 2,029, ranked by callers