MCPcopy Create free account

hub / github.com/anitaa1990/Android-Cheat-sheet / functions

Functions538 in github.com/anitaa1990/Android-Cheat-sheet

↓ 121 callersMethodadd
(LinkedList.Node node)
src/linkedlist/FindNthNode.java:32
↓ 50 callersMethodprint
(Node node)
src/linkedlist/RemoveDuplicates.java:38
↓ 33 callersMethodisEmpty
()
src/stacks/StacksUsingQueues.java:133
↓ 22 callersMethodpop
()
src/stacks/StacksUsingQueues.java:137
↓ 20 callersMethodpush
(int data)
src/stacks/StacksUsingQueues.java:120
↓ 16 callersMethodpush
(int new_data)
src/linkedlist/MergeSortList.java:182
↓ 12 callersMethodfindSumOfThreeValues
(int arr[], int requiredSum)
src/misc/SumOfThreeValues.java:30
↓ 11 callersMethodcomputeLevenshteinDistance
(String str1, String str2)
src/dynamicprogramming/LevenshteinDistance.java:38
↓ 8 callersMethodisEmpty
()
src/queue/QueuesUsingStack.java:77
↓ 8 callersMethodpush
(int new_data)
src/linkedlist/MergeLinkedList.java:85
↓ 7 callersMethodgetG
()
src/graphs/WordChaining.java:68
↓ 6 callersMethodgetX
()
src/misc/ClosestMeetingPoint.java:41
↓ 6 callersMethodgetY
()
src/misc/ClosestMeetingPoint.java:49
↓ 6 callersMethodisVisited
()
src/graphs/MinimumSpanningTree.java:86
↓ 6 callersMethodnext
()
src/linkedlist/CheckIfContainsCycle.java:56
↓ 6 callersMethodnext
()
src/linkedlist/FindNthNode.java:48
↓ 6 callersMethodpush
(int new_data)
src/linkedlist/ReversekElements.java:77
↓ 6 callersMethodround
(double value, int places)
src/math/PowerOfNumber.java:54
↓ 5 callersMethodadd
(Node node)
src/linkedlist/InsertSortLinkedList.java:75
↓ 5 callersMethodappendIntoTail
(Node node)
src/linkedlist/CheckIfContainsCycle.java:36
↓ 5 callersMethodenqueue
(int data)
src/queue/QueuesUsingStack.java:73
↓ 5 callersMethodenqueue
(int data)
src/queue/QueuesUsingStack.java:116
↓ 5 callersMethodpush
(int new_data)
src/linkedlist/SwapNthNodeWithHead.java:79
↓ 5 callersMethodpush
(int new_data)
src/linkedlist/ReverseEvenNodes.java:100
↓ 5 callersMethodpush
(int new_data)
src/linkedlist/AddTwoIntegers.java:71
↓ 5 callersMethodpush
(int new_data)
src/linkedlist/RotateLinkedList.java:111
↓ 5 callersMethodpush
(int data)
src/stacks/StacksUsingQueues.java:71
↓ 4 callersMethodadd
(Node node)
src/linkedlist/FindMiddleNode.java:40
↓ 4 callersMethodfindNthHighestInBst
(Node node, int n)
src/trees/NthHighestBST.java:48
↓ 4 callersMethodgetDest
()
src/graphs/MinimumSpanningTree.java:102
↓ 4 callersMethodintegerDivide
(int x, int y)
src/math/IntegerDivision.java:18
↓ 4 callersMethodnext
()
src/linkedlist/FindMiddleNode.java:56
↓ 4 callersMethodpush
(int new_data)
src/linkedlist/NthFromLastNode.java:59
↓ 3 callersMethodgetAdj_vertices
()
src/graphs/WordChaining.java:51
↓ 3 callersMethodgetId
()
src/graphs/MinimumSpanningTree.java:47
↓ 3 callersMethodgetValue
()
src/stacks/EvaluationExpression.java:246
↓ 3 callersMethodgetWeight
()
src/graphs/MinimumSpanningTree.java:78
↓ 3 callersMethodprintNode
(Node node)
src/linkedlist/AddTwoIntegers.java:63
↓ 3 callersMethodprintNode
(Node node)
src/linkedlist/MergeLinkedList.java:77
↓ 3 callersMethodsetX
(int x)
src/misc/ClosestMeetingPoint.java:45
↓ 3 callersMethodsetY
(int y)
src/misc/ClosestMeetingPoint.java:53
↓ 3 callersMethodverify
(int[][] matrix)
src/misc/ColumnsRowsZeroes.java:110
↓ 2 callersMethodcalculateSumOfDistances
(List<Point> points)
src/misc/ClosestMeetingPoint.java:63
↓ 2 callersMethodclone
(Node root)
src/graphs/CloneDirectedGraph.java:164
↓ 2 callersMethodconcatenateLists
(Node head1, Node head2)
src/trees/BinaryTreeToLinkedList.java:57
↓ 2 callersMethodconvertInfixToPostfix
(String expression)
src/stacks/EvaluationExpression.java:101
↓ 2 callersMethodcreateRandomMatrix
(int rows, int cols)
src/misc/ColumnsRowsZeroes.java:60
↓ 2 callersMethoddequeue
()
src/queue/QueuesUsingStack.java:81
↓ 2 callersMethoddequeue
()
src/queue/QueuesUsingStack.java:127
↓ 2 callersMethodevaluate
(List<EvalToken> tokens)
src/stacks/EvaluationExpression.java:56
↓ 2 callersMethodfindHostByteOrder
()
src/misc/HostByteOrder.java:27
↓ 2 callersMethodfindMinSpanningTree
()
src/graphs/MinimumSpanningTree.java:171
↓ 2 callersMethodfindPalindromeInSubString
(String input, int start, int end)
src/strings/PalindroneStrings.java:40
↓ 2 callersMethodgenerateGraph
(int vertices, List<ArrayList<Integer>> edges)
src/graphs/MinimumSpanningTree.java:150
↓ 2 callersMethodgetChildren
()
src/strings/XmlToString.java:87
↓ 2 callersMethodgetCount
(Node node)
src/linkedlist/IntersectionPoints.java:73
↓ 2 callersMethodgetIn_vertices
()
src/graphs/WordChaining.java:55
↓ 2 callersMethodgetIntersectionNode
(int d, Node node1, Node node2)
src/linkedlist/IntersectionPoints.java:50
↓ 2 callersMethodgetSrc
()
src/graphs/MinimumSpanningTree.java:94
↓ 2 callersMethodhasNext
()
src/trees/BinaryTreeIterator.java:49
↓ 2 callersMethodhead
()
src/linkedlist/CheckIfContainsCycle.java:44
↓ 2 callersMethodhead
()
src/linkedlist/FindMiddleNode.java:45
↓ 2 callersMethodhead
()
src/linkedlist/FindNthNode.java:37
↓ 2 callersMethodisVisited
()
src/graphs/WordChaining.java:43
↓ 2 callersMethodlevelOrderTraversal
(Node root)
src/trees/MirrorBinaryTreeNodes.java:70
↓ 2 callersMethodlevelOrderTraversal
(Node root)
src/trees/DeleteZeroSumSubTrees.java:106
↓ 2 callersMethodpop
()
src/stacks/StacksUsingQueues.java:79
↓ 2 callersMethodprintGraph
(List<Node> vertices)
src/graphs/CloneDirectedGraph.java:58
↓ 2 callersMethodprintList
(Node node)
src/linkedlist/ReverseLinkedList.java:35
↓ 2 callersMethodprintMatrix
(int[][] m)
src/misc/ColumnsRowsZeroes.java:76
↓ 2 callersMethodprintMst
(int w)
src/graphs/MinimumSpanningTree.java:211
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/ReversekElements.java:69
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/SwapNthNodeWithHead.java:71
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/ReverseEvenNodes.java:92
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/RotateLinkedList.java:103
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/InsertSortLinkedList.java:84
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/DeleteNodeWithKey.java:52
↓ 2 callersMethodprintNode
(Node node)
src/linkedlist/MergeSortList.java:174
↓ 2 callersMethodquickSort
(char[] arr, int lowerIndex, int upperIndex)
src/strings/CheckIfAnagram.java:32
↓ 2 callersMethodscoringOptions
(int n)
src/dynamicprogramming/GameScoring.java:41
↓ 2 callersMethodsetNext
(LinkedList.Node next)
src/linkedlist/CheckIfContainsCycle.java:60
↓ 2 callersMethodsetParent
(Node<T> parent)
src/strings/XmlToString.java:99
↓ 2 callersMethodsetVisited
(boolean visited)
src/graphs/MinimumSpanningTree.java:90
↓ 2 callersMethodvertexExists
(char value)
src/graphs/WordChaining.java:105
↓ 2 callersMethodvertexExists
(int id)
src/graphs/MinimumSpanningTree.java:139
↓ 1 callersMethodaddEdge
(Vertex start, Vertex end)
src/graphs/WordChaining.java:128
↓ 1 callersMethodaddIntegers
(LinkedList.Node integer1, LinkedList.Node integer2)
src/linkedlist/AddTwoIntegers.java:21
↓ 1 callersMethodadjustRotationsNeeded
(int n, int len)
src/linkedlist/RotateLinkedList.java:36
↓ 1 callersMethodallVisited
()
src/graphs/WordChaining.java:116
↓ 1 callersMethodareGraphsEqualRec
(Node root1, Node root2, HashSet<Nod
src/graphs/CloneDirectedGraph.java:93
↓ 1 callersMethodbubbleSort
(int[] arr)
src/sort/BubbleSort.java:14
↓ 1 callersMethodcalculateDistance
(Point p)
src/misc/ClosestMeetingPoint.java:57
↓ 1 callersMethodcanBeSegmented
(Set<String> firstDict, Set<String> secondDict,
src/strings/StringSegmentation.java:23
↓ 1 callersMethodcheckCycle
(int list_size)
src/graphs/WordChaining.java:178
↓ 1 callersMethodcheckCycleRec
(Vertex node, Vertex starting_node)
src/graphs/WordChaining.java:148
↓ 1 callersMethodcheckIfAnagram
(String word1, String word2)
src/strings/CheckIfAnagram.java:10
↓ 1 callersMethodcheckIfArmstrongNumber
(int num)
src/math/CheckIfArmstrongNumber.java:5
↓ 1 callersMethodcheckIfDelimiterIsEqual
(String s)
src/stacks/EqualDelimiters.java:9
↓ 1 callersMethodcloneRec
(Node root, HashMap<Node, Node> nodes_completed)
src/graphs/CloneDirectedGraph.java:144
↓ 1 callersMethodcomputeFactorial
(int n)
src/math/FindFactorial.java:5
next →1–100 of 538, ranked by callers