Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/apna-college/Alpha
/ functions
Functions
384 in github.com/apna-college/Alpha
⨍
Functions
384
◇
Types & classes
143
↓ 78 callers
Method
print
()
12_LinkedList.java/LL.java:36
↓ 72 callers
Method
add
(int idx, int data)
12_LinkedList.java/LL.java:45
↓ 38 callers
Method
isEmpty
()
13_Stacks/StackLL.java:26
↓ 30 callers
Method
push
(int data)
13_Stacks/StackLL.java:15
↓ 27 callers
Method
add
(int idx, int data)
12_LinkedList.java/LinkedList.java:50
↓ 18 callers
Method
peek
()
13_Stacks/StackLL.java:39
↓ 18 callers
Method
pop
()
13_Stacks/StackLL.java:30
↓ 18 callers
Method
remove
()
14_Queues/Classroom.java:27
↓ 13 callers
Method
addLast
(int data)
12_LinkedList.java/LinkedList.java:30
↓ 6 callers
Method
add
(int data)
14_Queues/Classroom.java:23
↓ 6 callers
Method
addLast
(int data)
12_LinkedList.java/LL.java:25
↓ 4 callers
Method
addFirst
(int data)
12_LinkedList.java/DLL.java:18
↓ 4 callers
Method
print
()
12_LinkedList.java/DLL.java:31
↓ 4 callers
Method
push
(int data)
13_Stacks/StackAL.java:7
↓ 3 callers
Method
addFirst
(int data)
12_LinkedList.java/DoubleLL.java:18
↓ 3 callers
Method
isEmpty
()
13_Stacks/StackAL.java:11
↓ 2 callers
Method
addFirst
(int data)
12_LinkedList.java/LinkedList.java:15
↓ 2 callers
Method
findMidNode
(Node head)
12_LinkedList.java/LL.java:176
↓ 2 callers
Method
findSubsets
(String str, int i, StringBuilder ans)
10_Backtracking/FindSubsets.java:3
↓ 2 callers
Method
getDist
(Node root, int n)
16_BinaryTrees/MinDistanceBtwNodes.java:34
↓ 2 callers
Method
getInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/Classroom.java:15
↓ 2 callers
Method
getInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/MergeBSTs.java:25
↓ 2 callers
Method
getPath
(Node root, int n, ArrayList<Node> path)
16_BinaryTrees/Classroom.java:174
↓ 2 callers
Method
height
(Node root)
16_BinaryTrees/Diameter.java:13
↓ 2 callers
Method
inorder
(Node root)
17_Binary Search Trees (1)/BST.java:31
↓ 2 callers
Method
isSafe
(char board[][], int row, int col)
10_Backtracking/NQueens.java:2
↓ 2 callers
Method
lcaDist
(Node root, int n)
16_BinaryTrees/Classroom.java:235
↓ 2 callers
Method
peek
()
14_Queues/Classroom.java:15
↓ 2 callers
Method
print
(int arr[])
13_Stacks/NextGreater.java:4
↓ 2 callers
Method
print
()
12_LinkedList.java/DoubleLL.java:32
↓ 2 callers
Method
print
()
12_LinkedList.java/LinkedList.java:41
↓ 2 callers
Method
printArr
(int arr[])
10_Backtracking/BacktrackOnArrays.java:2
↓ 2 callers
Method
printArray
(int arr[])
1_Arrays/ReverseArray.java:20
↓ 2 callers
Method
printBoard
(char board[][])
10_Backtracking/NQueens.java:42
↓ 2 callers
Method
printRoot2Leaf
(Node root, ArrayList<Integer> path)
17_Binary Search Trees (1)/RootToLeaf.java:38
↓ 2 callers
Method
removeLast
()
12_LinkedList.java/LinkedList.java:86
↓ 2 callers
Method
rootToNodePath
(Node root, int node, ArrayList<Node> path)
16_BinaryTrees/LowestCommonAncestor.java:15
↓ 2 callers
Method
topView
(Node root)
16_BinaryTrees/TopView.java:25
↓ 1 callers
Method
FMWC
(ArrayList<Integer> height)
11_ArrayLists/ContainerWithMostWater.java:4
↓ 1 callers
Method
KthAncestor
(Node root, int n, int k)
16_BinaryTrees/KAncestor.java:13
↓ 1 callers
Method
KthLevel
(Node root, int k, int level)
16_BinaryTrees/KLevel.java:13
↓ 1 callers
Method
addFirst
(int data)
12_LinkedList.java/LL.java:14
↓ 1 callers
Method
balanceBST
(Node root)
17_Binary Search Trees (2)/BSTToBalancedBST.java:46
↓ 1 callers
Method
binSearch
(int arr[], int key)
1_Arrays/BinarySearch.java:5
↓ 1 callers
Method
bubbleSortDescending
(int arr[])
2_Basic Sorting/BubbleSort.java:37
↓ 1 callers
Method
butterfly
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:68
↓ 1 callers
Method
buyAndSellStocks
(int prices[])
1_Arrays/ArraysCC.java:5
↓ 1 callers
Method
calcSum
(int matrix[][])
4_2DArrays/DiagonalSum.java:6
↓ 1 callers
Method
changeArr
(int arr[], int i, int val)
10_Backtracking/BacktrackOnArrays.java:9
↓ 1 callers
Method
changeStr
(String str, int i, char val, int n)
10_Backtracking/BacktrackonStrings.java:4
↓ 1 callers
Method
checkDuplicate
(String str)
13_Stacks/DuplicateParanthesis.java:4
↓ 1 callers
Method
checkNQueens
(char board[][], int row)
10_Backtracking/NQueens.java:52
↓ 1 callers
Method
clearIthBit
(int n, int i)
5_Bit Manipulation/BitOperations.java:15
↓ 1 callers
Method
compressString
(String str)
3_Strings/StringCompression.java:5
↓ 1 callers
Method
constructBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/MergeBSTs.java:34
↓ 1 callers
Method
convertToBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/BSTToBalancedBST.java:25
↓ 1 callers
Method
convertToBST
(int arr[], int st, int end)
17_Binary Search Trees (2)/ArrayToBST.java:23
↓ 1 callers
Method
convertToSumTree
(Node root)
16_BinaryTrees/SumTree.java:13
↓ 1 callers
Method
countGridWays
(int i, int j, int n, int m)
10_Backtracking/GridWays.java:2
↓ 1 callers
Method
countSetBits
(int n)
5_Bit Manipulation/BitOperations.java:55
↓ 1 callers
Method
countingSortDescending
(int arr[])
2_Basic Sorting/CountingSort.java:26
↓ 1 callers
Method
createBST
(ArrayList<Integer> arr, int st, int end)
17_Binary Search Trees (2)/Classroom.java:25
↓ 1 callers
Method
delete
(Node root, int val)
17_Binary Search Trees (1)/BST.java:41
↓ 1 callers
Method
diameter1
(Node root)
16_BinaryTrees/Diameter.java:22
↓ 1 callers
Method
diameter2
(Node root)
16_BinaryTrees/Diameter.java:44
↓ 1 callers
Method
diamond
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:146
↓ 1 callers
Method
findInorderSuccessor
(Node root)
17_Binary Search Trees (2)/BST.java:86
↓ 1 callers
Method
findMaxWaterContainer
(ArrayList<Integer> height)
11_ArrayLists/ContainerWithMostWater.java:19
↓ 1 callers
Method
findMid
(Node head)
12_LinkedList.java/LinkedList.java:187
↓ 1 callers
Method
findPermutation
(String str, String ans)
10_Backtracking/FindPermutations.java:3
↓ 1 callers
Method
findSum1
(ArrayList<Integer> list, int target)
11_ArrayLists/PairSum.java:4
↓ 1 callers
Method
floyds_triangle
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:41
↓ 1 callers
Method
getInorder
(Node root, ArrayList<Integer> arr)
17_Binary Search Trees (2)/BSTToBalancedBST.java:37
↓ 1 callers
Method
getMid
(Node head)
12_LinkedList.java/LinkedList.java:276
↓ 1 callers
Method
getUppercase
(String str)
3_Strings/ConvertToUppercase.java:5
↓ 1 callers
Method
height
(Node root)
16_BinaryTrees/Height.java:13
↓ 1 callers
Method
helper
(Node head, int key)
12_LinkedList.java/LinkedList.java:125
↓ 1 callers
Method
hollowRectangle
(int n, int m)
0_JavaProgrammingBasics/Patterns/Patterns.java:3
↓ 1 callers
Method
hollow_rhombus
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:126
↓ 1 callers
Method
inorder
(Node root)
17_Binary Search Trees (2)/BST.java:30
↓ 1 callers
Method
inorderSuccessor
(Node root)
17_Binary Search Trees (1)/BST.java:79
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (1)/PrintInRange.java:14
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (1)/RootToLeaf.java:16
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (1)/BST.java:16
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (1)/SearchInBST.java:14
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (1)/validateBST.java:14
↓ 1 callers
Method
insert
(Node root, int val)
17_Binary Search Trees (2)/BST.java:14
↓ 1 callers
Method
insertionSortDescending
(int arr[])
2_Basic Sorting/InsertionSort.java:19
↓ 1 callers
Method
interleave
(Queue<Integer> q)
14_Queues/Interleave.java:4
↓ 1 callers
Method
inverted_halfPyramid_withNumbers
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:30
↓ 1 callers
Method
inverted_rotated_halfPyramid
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:16
↓ 1 callers
Method
isIdentical
(Node root, Node subRoot)
16_BinaryTrees/SubtreeOfAnother.java:13
↓ 1 callers
Method
isPalindrome
(String str)
3_Strings/Palindrome.java:3
↓ 1 callers
Method
isSafe
(int sudoku[][], int row, int col, int n)
10_Backtracking/Sudoku.java:2
↓ 1 callers
Method
isSafe
(int sudoku[][], int row, int col, int digit)
10_Backtracking/Classroom.java:2
↓ 1 callers
Method
isSubtree
(Node root, Node subRoot)
16_BinaryTrees/SubtreeOfAnother.java:24
↓ 1 callers
Method
isValid
(String str)
13_Stacks/ValidParentheses.java:4
↓ 1 callers
Method
isValidBST
(Node root, Node min, Node max)
17_Binary Search Trees (2)/BST.java:132
↓ 1 callers
Method
isValidUtil
(Node root, Node leftMax, Node rightMin)
17_Binary Search Trees (1)/validateBST.java:33
↓ 1 callers
Method
largestBST
(Node root)
17_Binary Search Trees (2)/largestBSTinBT.java:38
next →
1–100 of 384, ranked by callers