MCPcopy Create free account

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

Functions384 in github.com/apna-college/Alpha

⨍ Functions 384◇ Types & classes 143
↓ 1 callersMethodlca
(Node root, int n1, int n2)
16_BinaryTrees/MinDistanceBtwNodes.java:13
↓ 1 callersMethodlca2
(Node root, int n1, int n2)
16_BinaryTrees/Classroom.java:216
↓ 1 callersMethodlca2
(Node root, int n1, int n2)
16_BinaryTrees/LowestCommonAncestor.java:54
↓ 1 callersMethodmaxArea
(int arr[])
13_Stacks/Classroom.java:61
↓ 1 callersMethodmaxArea
(int arr[])
13_Stacks/AreaInHistogram.java:11
↓ 1 callersMethodmaxProfit
(int[] prices)
1_Arrays/BuyAndSellStock.java:8
↓ 1 callersMethodmaxSubarraySum1
(int arr[])
1_Arrays/MaxSubarraySum.java:6
↓ 1 callersMethodmaxSubarraySum2
(int arr[])
1_Arrays/MaxSubarraySum.java:23
↓ 1 callersMethodmaxSubarraySum3
(int arr[])
1_Arrays/MaxSubarraySum.java:43
↓ 1 callersMethodmerge
(int arr[], int si, int mid, int ei)
8_DivideAndConquer/MergeSort.java:15
↓ 1 callersMethodmerge
(Node root1, Node root2)
17_Binary Search Trees (2)/MergeBSTs.java:47
↓ 1 callersMethodmerge
(Node head1, Node head2)
12_LinkedList.java/LL.java:275
↓ 1 callersMethodmerge
(Node head1, Node head2)
12_LinkedList.java/LinkedList.java:287
↓ 1 callersMethodmergeBSTs
(Node root1, Node root2)
17_Binary Search Trees (2)/Classroom.java:35
↓ 1 callersMethodmergeSort
(int arr[], int si, int ei)
8_DivideAndConquer/MergeSort.java:3
↓ 1 callersMethodmergeSort
()
12_LinkedList.java/LL.java:305
↓ 1 callersMethodmergeSortHelper
(Node head)
12_LinkedList.java/LL.java:257
↓ 1 callersMethodminDist
(Node root, int n1, int n2)
16_BinaryTrees/MinDistanceBtwNodes.java:55
↓ 1 callersMethodmirrorBst
(Node root)
17_Binary Search Trees (2)/MirrorBST.java:13
↓ 1 callersMethodnQueens
(char board[][], int row)
10_Backtracking/NQueens.java:27
↓ 1 callersMethodnumber_pyramid
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:176
↓ 1 callersMethodpairSum2
(ArrayList<Integer> list, int target)
11_ArrayLists/Classroom.java:42
↓ 1 callersMethodpalindromic_pattern_withNumbers
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:192
↓ 1 callersMethodpartition
(int arr[], int si, int ei)
8_DivideAndConquer/QuickSort.java:20
↓ 1 callersMethodpeek
()
13_Stacks/StackAL.java:23
↓ 1 callersMethodpeek
()
14_Queues/Classroom.java:31
↓ 1 callersMethodpop
()
13_Stacks/StackAL.java:15
↓ 1 callersMethodpop
()
14_Queues/Classroom.java:11
↓ 1 callersMethodpow
(int a, int n)
5_Bit Manipulation/FastExponentiation.java:3
↓ 1 callersMethodpreorder
(Node root)
17_Binary Search Trees (2)/BSTToBalancedBST.java:15
↓ 1 callersMethodpreorder
(Node root)
17_Binary Search Trees (2)/Classroom.java:71
↓ 1 callersMethodpreorder
(Node root)
17_Binary Search Trees (2)/ArrayToBST.java:13
↓ 1 callersMethodpreorder
(Node root)
17_Binary Search Trees (2)/MergeBSTs.java:15
↓ 1 callersMethodpreorder
(Node root)
17_Binary Search Trees (2)/MirrorBST.java:26
↓ 1 callersMethodpreorder
(Node root)
16_BinaryTrees/SumTree.java:28
↓ 1 callersMethodpreorder
(Node root)
16_BinaryTrees/Classroom.java:302
↓ 1 callersMethodprintArr
(int arr[])
8_DivideAndConquer/MergeSort.java:48
↓ 1 callersMethodprintArr
(int arr[])
8_DivideAndConquer/QuickSort.java:2
↓ 1 callersMethodprintArr
(int arr[])
2_Basic Sorting/CountingSort.java:46
↓ 1 callersMethodprintArr
(int arr[])
2_Basic Sorting/SelectionSort.java:38
↓ 1 callersMethodprintArr
(int arr[])
2_Basic Sorting/BubbleSort.java:50
↓ 1 callersMethodprintArr
(int arr[])
2_Basic Sorting/InsertionSort.java:32
↓ 1 callersMethodprintBinStrings
(int n, int lastPlace, String str)
7_RecursionBasics/RecursionBasics.java:149
↓ 1 callersMethodprintInRange
(Node root, int k1, int k2)
17_Binary Search Trees (1)/PrintInRange.java:29
↓ 1 callersMethodprintMax
(ArrayList<Integer> list)
11_ArrayLists/PrintMaximum.java:4
↓ 1 callersMethodprintNonRepeating
(String str)
14_Queues/FirstNonRepeating.java:4
↓ 1 callersMethodprintPairs
(int arr[])
1_Arrays/PairsinArray.java:5
↓ 1 callersMethodprintPath
(ArrayList<Integer> path)
17_Binary Search Trees (1)/RootToLeaf.java:31
↓ 1 callersMethodprintPath
( ArrayList<Integer> path)
17_Binary Search Trees (2)/BST.java:110
↓ 1 callersMethodprintSpiral
(int matrix[][])
4_2DArrays/SpiralMatrix.java:6
↓ 1 callersMethodprintSubarrays
(int arr[])
1_Arrays/PrintSubarrays.java:5
↓ 1 callersMethodprintSudoku
(int sudoku[][])
10_Backtracking/Sudoku.java:57
↓ 1 callersMethodprintSudoku
(int sudoku[][])
10_Backtracking/Classroom.java:62
↓ 1 callersMethodpush
(int data)
14_Queues/Classroom.java:7
↓ 1 callersMethodpushAtBottom
(Stack<Integer> s, int data)
13_Stacks/Question1.java:4
↓ 1 callersMethodpushAtBottom
(Stack<Integer> s, int data)
13_Stacks/Question3.java:5
↓ 1 callersMethodquickSort
(int arr[], int si, int ei)
8_DivideAndConquer/QuickSort.java:9
↓ 1 callersMethodremoveFirst
()
12_LinkedList.java/LL.java:66
↓ 1 callersMethodremoveFirst
()
12_LinkedList.java/DLL.java:40
↓ 1 callersMethodremoveFirst
()
12_LinkedList.java/LinkedList.java:70
↓ 1 callersMethodremoveLast
()
12_LinkedList.java/LL.java:82
↓ 1 callersMethodreverse
(int arr[])
1_Arrays/ReverseArray.java:5
↓ 1 callersMethodreverse
(Queue<Integer> q)
14_Queues/Reversal.java:4
↓ 1 callersMethodreverse
()
12_LinkedList.java/DoubleLL.java:61
↓ 1 callersMethodreverse
()
12_LinkedList.java/DLL.java:56
↓ 1 callersMethodreverse
(ArrayList<Integer> list)
11_ArrayLists/PrintReverse.java:3
↓ 1 callersMethodsearch
(int arr[], int tar, int si, int ei)
8_DivideAndConquer/DividenConquer.java:2
↓ 1 callersMethodsearch
(int arr[], int tar, int si, int ei)
8_DivideAndConquer/RotatedSortedArray.java:3
↓ 1 callersMethodsearch
(Node root, int key)
17_Binary Search Trees (1)/SearchInBST.java:29
↓ 1 callersMethodsearchHelper
(Node head, int key)
12_LinkedList.java/LL.java:123
↓ 1 callersMethodselectionSortDescending
(int arr[])
2_Basic Sorting/SelectionSort.java:22
↓ 1 callersMethodshortestPath
(String path)
3_Strings/ShortestPath.java:4
↓ 1 callersMethodsolid_rhombus
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:110
↓ 1 callersMethodsolveSudoku
(int sudoku[][], int i, int j)
10_Backtracking/Sudoku.java:28
↓ 1 callersMethodstaircaseSearch
(int matrix[][], int key)
4_2DArrays/SearchInSorted.java:6
↓ 1 callersMethodstockSpan
(int stocks[])
13_Stacks/Question4.java:5
↓ 1 callersMethodsudokuSolver
(int sudoku[][], int row, int col)
10_Backtracking/Classroom.java:32
↓ 1 callersMethodswap
(ArrayList<Integer> list, int idx1, int idx2)
11_ArrayLists/Swap.java:3
↓ 1 callersMethodtransform
(Node root)
16_BinaryTrees/Classroom.java:286
↓ 1 callersMethodtrapWater
(int height[])
1_Arrays/TrappingRainWater.java:8
↓ 1 callersMethodzero_one_triangle
(int n)
0_JavaProgrammingBasics/Patterns/Patterns.java:54
↓ 1 callersMethodzigZag
()
12_LinkedList.java/LinkedList.java:335
MethodInfo
(boolean isBST, int size, int max, int min)
17_Binary Search Trees (2)/largestBSTinBT.java:30
MethodInfo
(int ht, int diam)
16_BinaryTrees/Diameter.java:38
MethodInfo
(Node node, int hd)
16_BinaryTrees/Classroom.java:115
MethodJob
(int id, int deadline, int profit)
15_Greedy/JobSequencing.java:9
MethodKAncestor
(Node root, int n, int k)
16_BinaryTrees/Classroom.java:264
MethodKLevel
(Node root, int level, int k)
16_BinaryTrees/Classroom.java:160
MethodNode
(int data)
17_Binary Search Trees (1)/PrintInRange.java:7
MethodNode
(int data)
17_Binary Search Trees (1)/RootToLeaf.java:9
MethodNode
(int data)
17_Binary Search Trees (1)/BST.java:9
MethodNode
(int data)
17_Binary Search Trees (1)/SearchInBST.java:7
MethodNode
(int data)
17_Binary Search Trees (1)/validateBST.java:7
MethodNode
(int data)
17_Binary Search Trees (2)/BSTToBalancedBST.java:9
MethodNode
(int data)
17_Binary Search Trees (2)/Classroom.java:9
MethodNode
(int data)
17_Binary Search Trees (2)/largestBSTinBT.java:7
MethodNode
(int data)
17_Binary Search Trees (2)/BST.java:9
MethodNode
(int data)
17_Binary Search Trees (2)/ArrayToBST.java:7
MethodNode
(int data)
17_Binary Search Trees (2)/MergeBSTs.java:9
MethodNode
(int data)
17_Binary Search Trees (2)/MirrorBST.java:7
← previousnext →101–200 of 384, ranked by callers