Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/careermonk/data-structures-and-algorithms-made-easy-in-java
/ functions
Functions
490 in github.com/careermonk/data-structures-and-algorithms-made-easy-in-java
⨍
Functions
490
◇
Types & classes
176
Method
LinkedList
()
src/chapter03linkedlists/LinkedList.java:18
Method
LinkedList
()
src/chapter09graphs/GraphAdjacencyList.java:27
Method
LinkedQueue
()
src/chapter05queues/LinkedQueue.java:23
Method
LinkedStack
()
src/chapter04stacks/LinkedStack.java:25
Method
ListIterator
(ListNode<Integer> head)
src/chapter09graphs/GraphAdjacencyList.java:56
Method
ListNode
(int x)
src/chapter07priorityqueues/ListNode.java:18
Method
ListNode
()
src/chapter03linkedlists/ListNode.java:20
Method
MaxRectangleArea
(int[] A)
src/chapter04stacks/MaxRectangleAreaInHistrogram.java:18
Method
MirrorOfBinaryTree
(BinaryTreeNode root)
src/chapter06trees/ConstructMirror.java:16
Method
Node
(T key, U value, long level, Node next, Node down)
src/chapter03linkedlists/SkipList.java:23
Method
OptimalJumps
()
src/chapter19dynamicprogramming/OptimalJumps.java:22
Method
PostOrder
(BinaryTreeNode root)
src/chapter06trees/PostOrderRecursive.java:16
Method
PreOrder
(BinaryTreeNode root)
src/chapter06trees/PreOrderRecursive.java:16
Method
RandomListNode
(int x)
src/chapter03linkedlists/RandomListNode.java:20
Method
SiblingBinaryTreeNode
(int data)
src/chapter06trees/SiblingBinaryTreeNode.java:23
Method
SkipList
()
src/chapter03linkedlists/SkipList.java:45
Method
Skyline
(int n)
src/chapter18divideandconquer/SkylinesDivideandConquer.java:28
Method
Spiral
(int[][]A, int m, int n)
src/chapter21miscconcepts/MatrixSpiralPrint.java:16
Method
StackForStackSets
(int capacity)
src/chapter04stacks/StackForStackSets.java:24
Method
StackSets
(int threshold)
src/chapter04stacks/StackSets.java:24
Method
ToString
()
src/chapter18divideandconquer/SkylinesDivideandConquer.java:42
Method
Trie
()
src/chapter15stringalgorithms/Trie.java:23
Method
V
()
src/chapter09graphs/BFS.java:48
Method
V
()
src/chapter09graphs/GraphAdjacencyMatrix.java:50
Method
V
()
src/chapter09graphs/DFS.java:48
Method
add
(int data)
src/chapter03linkedlists/CircularLinkedList.java:28
Method
addBT
(BinaryTreeNode root)
src/chapter06trees/SumOfElementsInBinaryTreeLevelOrder.java:19
Method
addBT
(BinaryTreeNode root)
src/chapter06trees/SumOfElementsInBinaryTreeRecursive.java:18
Method
addOneToNumber
(int[] digits)
src/chapter21miscconcepts/AddOneToNumber.java:18
Method
addToTail
(int data)
src/chapter03linkedlists/CircularLinkedList.java:46
Method
addTwoNumbers
(ListNode l1, ListNode l2)
src/chapter03linkedlists/AddNumbersFromList.java:37
Method
addTwoReversedNumbers
(ListNode l1, ListNode l2)
src/chapter03linkedlists/AddNumbersFromList.java:16
Method
adjList
(int u)
src/chapter09graphs/GraphAdjacencyList.java:146
Method
adjMatrix
(int u)
src/chapter09graphs/BFS.java:64
Method
adjMatrix
(int u)
src/chapter09graphs/GraphAdjacencyMatrix.java:66
Method
adjMatrix
(int u)
src/chapter09graphs/DFS.java:64
Method
areMirrors
(BinaryTreeNode root1, BinaryTreeNode root2)
src/chapter06trees/CheckMirrors.java:16
Method
buildBinaryTree
(int[] inorder, int[] postorder)
src/chapter06trees/TreeFromInOrderAndPostOrder.java:16
Method
buildBinaryTree
(int[] preorder, int[] inorder)
src/chapter06trees/TreeFromInOrderAndPreOrder.java:16
Method
checkStructurullySameTrees
(BinaryTreeNode root1, BinaryTreeNode root2)
src/chapter06trees/CheckStructurullySameTrees.java:18
Method
checkValidBST
(BinarySearchTreeNode root)
src/chapter06trees/CheckValidBSTRecursiveSingleVariable.java:17
Method
checkValidBST
(BinarySearchTreeNode root)
src/chapter06trees/CheckValidBSTRecursive.java:16
Method
childAt
(char ch)
src/chapter15stringalgorithms/Trie.java:69
Method
clearList
()
src/chapter03linkedlists/DoublyLinkedList.java:207
Method
clearList
()
src/chapter03linkedlists/LinkedList.java:232
Method
commonElement
(ListNode list1, ListNode list2)
src/chapter03linkedlists/CommonElementsInSortedLinkedLists.java:17
Method
compare
(ListNode o1, ListNode o2)
src/chapter07priorityqueues/MergingKSortedLists.java:24
Method
contains
(int data)
src/chapter03linkedlists/CircularLinkedList.java:97
Method
contains
(int u, int v)
src/chapter09graphs/BFS.java:59
Method
contains
(int u, int v)
src/chapter09graphs/GraphAdjacencyMatrix.java:61
Method
contains
(int u, int v)
src/chapter09graphs/DFS.java:59
Method
copy
()
src/chapter06trees/BinaryTreeNode.java:111
Method
copyRandomList
(RandomListNode head)
src/chapter03linkedlists/RandomPointerLinkedList.java:19
Method
countNumberofSetbitsin1toN
(int n)
src/chapter21miscconcepts/CountNumberofSetbitsin1toN.java:18
Method
deQueue
()
src/chapter05queues/FixedSizeArrayQueue.java:49
Method
deQueue
()
src/chapter05queues/DynamicArrayQueue.java:49
Method
deepestNodeinBinaryTree
(BinaryTreeNode root)
src/chapter06trees/DeepestNode.java:22
Method
degree
(int u)
src/chapter09graphs/GraphAdjacencyList.java:151
Method
deleteBinaryTree
(BinaryTreeNode root)
src/chapter06trees/DeleteBinaryTree.java:18
Method
dequeue
()
src/chapter05queues/LinkedQueue.java:43
Method
dequeue
()
src/chapter05queues/QueuewithTwoStacks.java:23
Method
diameter
(BinaryTreeNode root)
src/chapter06trees/DiameterOfTree.java:31
Method
diameterOfTree
(BinaryTreeNode root)
src/chapter06trees/DiameterOfTree.java:20
Method
displayHuffmanBoolCodes
()
src/chapter17greedyalgorithms/Huffman.java:207
Method
displayHuffmanCodes
()
src/chapter17greedyalgorithms/Huffman.java:198
Method
editDistance
(String A, String B)
src/chapter19dynamicprogramming/EditDistance.java:16
Method
enQueue
(int data)
src/chapter05queues/FixedSizeArrayQueue.java:38
Method
enQueue
(int data)
src/chapter05queues/DynamicArrayQueue.java:40
Method
enqueue
(int data)
src/chapter05queues/LinkedQueue.java:29
Method
enqueue
(T data)
src/chapter05queues/QueuewithTwoStacks.java:20
Method
exchangeAdjacentNodes
(ListNode head)
src/chapter03linkedlists/ExchangeAdjacentNodes.java:16
Method
expressionEvaluation
(String[] tokens)
src/chapter04stacks/ExpressionEvaluation.java:18
Method
fibonacciWithDP
(int n)
src/chapter19dynamicprogramming/FibonacciWithDP.java:20
Method
fillNextSiblings
(SiblingBinaryTreeNode root)
src/chapter06trees/FillNextSiblingsWithRecursion.java:18
Method
fillNextSiblings
(SiblingBinaryTreeNode root)
src/chapter06trees/FillNextSiblingsWithLevelOrder.java:21
Method
findBeginofLoop
(ListNode head)
src/chapter03linkedlists/LoopInALinkedList.java:39
Method
findIfLoopExistsUsingBrents
(ListNode head)
src/chapter03linkedlists/LoopInALinkedList.java:75
Method
findIfLoopExistsUsingFloyds
(ListNode head)
src/chapter03linkedlists/LoopInALinkedList.java:62
Method
findInBT
(BinaryTreeNode root, int data)
src/chapter06trees/SearchBinaryTreeRecursive.java:19
Method
findInBT
(BinaryTreeNode root, int data)
src/chapter06trees/BinaryTreeNode.java:64
Method
findInBT
(BinaryTreeNode root, int data)
src/chapter06trees/SearchBinaryTreeLevelOrder.java:21
Method
findLengthOfTheLoop
(ListNode head)
src/chapter03linkedlists/LoopInALinkedList.java:17
Method
findLevelwithMaxSum
(BinaryTreeNode root)
src/chapter06trees/FindLevelwithMaxSum.java:21
Method
first
()
src/chapter05queues/LinkedQueue.java:57
Method
generateNextNumFromReading
(int n)
src/chapter11searching/GenerateNextNumFromReading.java:16
Method
generateTrees
(int n)
src/chapter06trees/GenerateBSTs.java:18
Method
get
(int position)
src/chapter03linkedlists/DoublyLinkedList.java:31
Method
getBoolCode
()
src/chapter17greedyalgorithms/HuffmanTreeNode.java:50
Method
getCode
()
src/chapter17greedyalgorithms/HuffmanTreeNode.java:47
Method
getData
()
src/chapter07priorityqueues/ListNode.java:22
Method
getData
()
src/chapter03linkedlists/RandomListNode.java:24
Method
getData
()
src/chapter06trees/SiblingBinaryTreeNode.java:35
Method
getHead
()
src/chapter03linkedlists/LinkedList.java:29
Method
getHuffmanCodes
()
src/chapter17greedyalgorithms/Huffman.java:65
Method
getLast
()
src/chapter03linkedlists/LinkedList.java:98
Method
getNext
()
src/chapter07priorityqueues/ListNode.java:28
Method
getNext
()
src/chapter03linkedlists/RandomListNode.java:30
Method
getPosition
(int data)
src/chapter03linkedlists/DoublyLinkedList.java:37
Method
getPosition
(int data)
src/chapter03linkedlists/LinkedList.java:210
Method
getRandom
()
src/chapter03linkedlists/RandomListNode.java:36
← previous
next →
201–300 of 490, ranked by callers