MCPcopy Create free account

hub / github.com/apna-college/Alpha / functions

Functions384 in github.com/apna-college/Alpha

↓ 78 callersMethodprint
()
12_LinkedList.java/LL.java:36
↓ 72 callersMethodadd
(int idx, int data)
12_LinkedList.java/LL.java:45
↓ 38 callersMethodisEmpty
()
13_Stacks/StackLL.java:26
↓ 30 callersMethodpush
(int data)
13_Stacks/StackLL.java:15
↓ 27 callersMethodadd
(int idx, int data)
12_LinkedList.java/LinkedList.java:50
↓ 18 callersMethodpeek
()
13_Stacks/StackLL.java:39
↓ 18 callersMethodpop
()
13_Stacks/StackLL.java:30
↓ 18 callersMethodremove
()
14_Queues/Classroom.java:27
↓ 13 callersMethodaddLast
(int data)
12_LinkedList.java/LinkedList.java:30
↓ 6 callersMethodadd
(int data)
14_Queues/Classroom.java:23
↓ 6 callersMethodaddLast
(int data)
12_LinkedList.java/LL.java:25
↓ 4 callersMethodaddFirst
(int data)
12_LinkedList.java/DLL.java:18
↓ 4 callersMethodprint
()
12_LinkedList.java/DLL.java:31
↓ 4 callersMethodpush
(int data)
13_Stacks/StackAL.java:7
↓ 3 callersMethodaddFirst
(int data)
12_LinkedList.java/DoubleLL.java:18
↓ 3 callersMethodisEmpty
()
13_Stacks/StackAL.java:11
↓ 2 callersMethodaddFirst
(int data)
12_LinkedList.java/LinkedList.java:15
↓ 2 callersMethodfindMidNode
(Node head)
12_LinkedList.java/LL.java:176
↓ 2 callersMethodfindSubsets
(String str, int i, StringBuilder ans)
10_Backtracking/FindSubsets.java:3
↓ 2 callersMethodgetDist
(Node root, int n)
16_BinaryTrees/MinDistanceBtwNodes.java:34
↓ 2 callersMethodgetInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/Classroom.java:15
↓ 2 callersMethodgetInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/MergeBSTs.java:25
↓ 2 callersMethodgetPath
(Node root, int n, ArrayList<Node> path)
16_BinaryTrees/Classroom.java:174
↓ 2 callersMethodheight
(Node root)
16_BinaryTrees/Diameter.java:13
↓ 2 callersMethodinorder
(Node root)
17_Binary Search Trees (1)/BST.java:31
↓ 2 callersMethodisSafe
(char board[][], int row, int col)
10_Backtracking/NQueens.java:2
↓ 2 callersMethodlcaDist
(Node root, int n)
16_BinaryTrees/Classroom.java:235
↓ 2 callersMethodpeek
()
14_Queues/Classroom.java:15
↓ 2 callersMethodprint
(int arr[])
13_Stacks/NextGreater.java:4
↓ 2 callersMethodprint
()
12_LinkedList.java/DoubleLL.java:32
↓ 2 callersMethodprint
()
12_LinkedList.java/LinkedList.java:41
↓ 2 callersMethodprintArr
(int arr[])
10_Backtracking/BacktrackOnArrays.java:2
↓ 2 callersMethodprintArray
(int arr[])
1_Arrays/ReverseArray.java:20
↓ 2 callersMethodprintBoard
(char board[][])
10_Backtracking/NQueens.java:42
↓ 2 callersMethodprintRoot2Leaf
(Node root, ArrayList<Integer> path)
17_Binary Search Trees (1)/RootToLeaf.java:38
↓ 2 callersMethodremoveLast
()
12_LinkedList.java/LinkedList.java:86
↓ 2 callersMethodrootToNodePath
(Node root, int node, ArrayList<Node> path)
16_BinaryTrees/LowestCommonAncestor.java:15
↓ 2 callersMethodtopView
(Node root)
16_BinaryTrees/TopView.java:25
↓ 1 callersMethodFMWC
(ArrayList<Integer> height)
11_ArrayLists/ContainerWithMostWater.java:4
↓ 1 callersMethodKthAncestor
(Node root, int n, int k)
16_BinaryTrees/KAncestor.java:13
↓ 1 callersMethodKthLevel
(Node root, int k, int level)
16_BinaryTrees/KLevel.java:13
↓ 1 callersMethodaddFirst
(int data)
12_LinkedList.java/LL.java:14
↓ 1 callersMethodbalanceBST
(Node root)
17_Binary Search Trees (2)/BSTToBalancedBST.java:46
↓ 1 callersMethodbinSearch
(int arr[], int key)
1_Arrays/BinarySearch.java:5
↓ 1 callersMethodbubbleSortDescending
(int arr[])
2_Basic Sorting/BubbleSort.java:37
↓ 1 callersMethodbutterfly
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:68
↓ 1 callersMethodbuyAndSellStocks
(int prices[])
1_Arrays/ArraysCC.java:5
↓ 1 callersMethodcalcSum
(int matrix[][])
4_2DArrays/DiagonalSum.java:6
↓ 1 callersMethodchangeArr
(int arr[], int i, int val)
10_Backtracking/BacktrackOnArrays.java:9
↓ 1 callersMethodchangeStr
(String str, int i, char val, int n)
10_Backtracking/BacktrackonStrings.java:4
↓ 1 callersMethodcheckDuplicate
(String str)
13_Stacks/DuplicateParanthesis.java:4
↓ 1 callersMethodcheckNQueens
(char board[][], int row)
10_Backtracking/NQueens.java:52
↓ 1 callersMethodclearIthBit
(int n, int i)
5_Bit Manipulation/BitOperations.java:15
↓ 1 callersMethodcompressString
(String str)
3_Strings/StringCompression.java:5
↓ 1 callersMethodconstructBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/MergeBSTs.java:34
↓ 1 callersMethodconvertToBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/BSTToBalancedBST.java:25
↓ 1 callersMethodconvertToBST
(int arr[], int st, int end)
17_Binary Search Trees (2)/ArrayToBST.java:23
↓ 1 callersMethodconvertToSumTree
(Node root)
16_BinaryTrees/SumTree.java:13
↓ 1 callersMethodcountGridWays
(int i, int j, int n, int m)
10_Backtracking/GridWays.java:2
↓ 1 callersMethodcountSetBits
(int n)
5_Bit Manipulation/BitOperations.java:55
↓ 1 callersMethodcountingSortDescending
(int arr[])
2_Basic Sorting/CountingSort.java:26
↓ 1 callersMethodcreateBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/Classroom.java:25
↓ 1 callersMethoddelete
(Node root, int val)
17_Binary Search Trees (1)/BST.java:41
↓ 1 callersMethoddiameter1
(Node root)
16_BinaryTrees/Diameter.java:22
↓ 1 callersMethoddiameter2
(Node root)
16_BinaryTrees/Diameter.java:44
↓ 1 callersMethoddiamond
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:146
↓ 1 callersMethodfindInorderSuccessor
(Node root)
17_Binary Search Trees (2)/BST.java:86
↓ 1 callersMethodfindMaxWaterContainer
(ArrayList<Integer> height)
11_ArrayLists/ContainerWithMostWater.java:19
↓ 1 callersMethodfindMid
(Node head)
12_LinkedList.java/LinkedList.java:187
↓ 1 callersMethodfindPermutation
(String str, String ans)
10_Backtracking/FindPermutations.java:3
↓ 1 callersMethodfindSum1
(ArrayList<Integer> list, int target)
11_ArrayLists/PairSum.java:4
↓ 1 callersMethodfloyds_triangle
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:41
↓ 1 callersMethodgetInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/BSTToBalancedBST.java:37
↓ 1 callersMethodgetMid
(Node head)
12_LinkedList.java/LinkedList.java:276
↓ 1 callersMethodgetUppercase
(String str)
3_Strings/ConvertToUppercase.java:5
↓ 1 callersMethodheight
(Node root)
16_BinaryTrees/Height.java:13
↓ 1 callersMethodhelper
(Node head, int key)
12_LinkedList.java/LinkedList.java:125
↓ 1 callersMethodhollowRectangle
(int n, int m)
0_JavaProgrammingBasics/Patterns/Patterns.java:3
↓ 1 callersMethodhollow_rhombus
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:126
↓ 1 callersMethodinorder
(Node root)
17_Binary Search Trees (2)/BST.java:30
↓ 1 callersMethodinorderSuccessor
(Node root)
17_Binary Search Trees (1)/BST.java:79
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (1)/PrintInRange.java:14
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (1)/RootToLeaf.java:16
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (1)/BST.java:16
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (1)/SearchInBST.java:14
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (1)/validateBST.java:14
↓ 1 callersMethodinsert
(Node root, int val)
17_Binary Search Trees (2)/BST.java:14
↓ 1 callersMethodinsertionSortDescending
(int arr[])
2_Basic Sorting/InsertionSort.java:19
↓ 1 callersMethodinterleave
(Queue<Integer> q)
14_Queues/Interleave.java:4
↓ 1 callersMethodinverted_halfPyramid_withNumbers
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:30
↓ 1 callersMethodinverted_rotated_halfPyramid
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:16
↓ 1 callersMethodisIdentical
(Node root, Node subRoot)
16_BinaryTrees/SubtreeOfAnother.java:13
↓ 1 callersMethodisPalindrome
(String str)
3_Strings/Palindrome.java:3
↓ 1 callersMethodisSafe
(int sudoku[][], int row, int col, int n)
10_Backtracking/Sudoku.java:2
↓ 1 callersMethodisSafe
(int sudoku[][], int row, int col, int digit)
10_Backtracking/Classroom.java:2
↓ 1 callersMethodisSubtree
(Node root, Node subRoot)
16_BinaryTrees/SubtreeOfAnother.java:24
↓ 1 callersMethodisValid
(String str)
13_Stacks/ValidParentheses.java:4
↓ 1 callersMethodisValidBST
(Node root, Node min, Node max)
17_Binary Search Trees (2)/BST.java:132
↓ 1 callersMethodisValidUtil
(Node root, Node leftMax, Node rightMin)
17_Binary Search Trees (1)/validateBST.java:33
↓ 1 callersMethodlargestBST
(Node root)
17_Binary Search Trees (2)/largestBSTinBT.java:38
next →1–100 of 384, ranked by callers