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
getRight
()
src/chapter06trees/SiblingBinaryTreeNode.java:47
Method
hasPathSum
(BinaryTreeNode root, int sum)
src/chapter06trees/CheckPathForSum.java:16
Method
hashCode
()
src/chapter06trees/BinaryTreeNode.java:90
Method
inorderTraversal
(BinaryTreeNode root)
src/chapter06trees/InOrderIterative.java:19
Method
insert
(int newValue)
src/chapter03linkedlists/DoublyLinkedList.java:59
Method
insert
(BinaryTreeNode root, int data)
src/chapter06trees/InsertInBinaryTreeRecursive.java:19
Method
insertAtBegin
(ListNode node)
src/chapter03linkedlists/LinkedList.java:34
Method
insertAtEnd
(ListNode node)
src/chapter03linkedlists/LinkedList.java:41
Method
insertInBinaryTreeLevelOrder
(BinaryTreeNode root, int data)
src/chapter06trees/InsertInBinaryTreeLevelOrder.java:21
Method
insertTail
(int newValue)
src/chapter03linkedlists/DoublyLinkedList.java:105
Method
isAVL
(BinarySearchTreeNode root, int min, int max)
src/chapter06trees/CheckAVL.java:16
Method
isBigEndian
()
src/chapter21miscconcepts/CheckEndian.java:19
Method
isEmpty
()
src/chapter05queues/FixedSizeArrayQueue.java:64
Method
isEmpty
()
src/chapter05queues/DynamicArrayQueue.java:64
Method
isFull
()
src/chapter05queues/FixedSizeArrayQueue.java:69
Method
isFull
()
src/chapter05queues/DynamicArrayQueue.java:69
Method
isLeaf
()
src/chapter06trees/SiblingBinaryTreeNode.java:64
Method
isLittleEndian
()
src/chapter21miscconcepts/CheckEndian.java:24
Method
isValidSymbolPattern
(String s)
src/chapter04stacks/SymbolBalance.java:18
Method
iterator
()
src/chapter09graphs/BFS.java:77
Method
iterator
()
src/chapter09graphs/GraphAdjacencyMatrix.java:79
Method
iterator
()
src/chapter09graphs/GraphAdjacencyList.java:48
Method
iterator
()
src/chapter09graphs/DFS.java:77
Method
kthLargest
(int[] A, int k)
src/chapter12selectionalgorithms/KthLargest.java:76
Method
kthSmallest
(int[] A, int k)
src/chapter12selectionalgorithms/KthSmallest.java:76
Method
length
()
src/chapter03linkedlists/DoublyLinkedList.java:54
Method
length
()
src/chapter03linkedlists/CircularLinkedList.java:140
Method
levelOrder
(BinaryTreeNode root)
src/chapter06trees/LevelOrder.java:20
Method
levelOrderTraversalInReverse
(BinaryTreeNode root)
src/chapter06trees/LevelOrderTraversalInReverse.java:22
Method
main
(String[] args)
src/chapter15stringalgorithms/Trie.java:73
Method
main
( String [ ] args )
src/chapter07priorityqueues/BinaryHeap.java:124
Method
main
(String[] args)
src/chapter21miscconcepts/RegexDemo.java:5
Method
main
(String args[])
src/chapter21miscconcepts/SwapOddEvenBits.java:25
Method
main
(String[] args)
src/chapter21miscconcepts/Equilibrium.java:34
Method
main
(String[] args)
src/chapter21miscconcepts/SquareMatrixRotationByKElementsTest.java:16
Method
main
(String[] args)
src/chapter21miscconcepts/SquareMatrixRotationByOneElementTest.java:17
Method
main
(java.lang.String args[])
src/chapter21miscconcepts/RomanToDecimal.java:85
Method
main
(String[] args)
src/chapter04stacks/StackSets.java:91
Method
main
(String[] args)
src/chapter10sorting/CountingSort.java:42
Method
main
(String args[])
src/chapter10sorting/ConvertArraytoSawToothWaveLinearTime.java:35
Method
main
(String[] args)
src/chapter10sorting/QuickSort.java:55
Method
main
(String args[])
src/chapter10sorting/ConvertArraytoSawToothWave.java:39
Method
main
@param args
src/chapter02recursionandbacktracking/FactorialTest.java:18
Method
main
(String[] args)
src/chapter08disjointsets/DisjointSets.java:47
Method
main
(String[] args)
src/chapter03linkedlists/InsertionSortLinkedList.java:58
Method
main
(String [] args)
src/chapter03linkedlists/SkipListsTest.java:15
Method
main
(String[] args)
src/chapter03linkedlists/PrintListInReverse.java:23
Method
main
(String[] args)
src/chapter01introduction/NSquareLogNComplexity.java:19
Method
main
(String[] args)
src/chapter01introduction/LogNComplexityDown.java:19
Method
main
(String[] args)
src/chapter01introduction/NPower3By2Complexity.java:18
Method
main
(String[] args)
src/chapter01introduction/SquareRootNComplexity.java:18
Method
main
(String[] args)
src/chapter01introduction/NlogNComplexity.java:19
Method
main
(String[] args)
src/chapter01introduction/NComplexity.java:19
Method
main
(String[] args)
src/chapter01introduction/LogNComplexityUp.java:19
Method
main
(String[] args)
src/chapter12selectionalgorithms/MedianInTwoSortedArraysTest.java:15
Method
main
(String[] args)
src/chapter19dynamicprogramming/MaximumSumSubMatrix.java:52
Method
main
(String[] args)
src/chapter19dynamicprogramming/MaxSubSquareMatrixWith1s.java:50
Method
main
(String[] args)
src/chapter19dynamicprogramming/FibonacciWithDP.java:42
Method
main
(String[] args)
src/chapter19dynamicprogramming/OptimalJumps.java:50
Method
main
(String[] args)
src/chapter19dynamicprogramming/RecursiveFibonacci.java:19
Method
main
(String[] args)
src/chapter09graphs/BFS.java:145
Method
main
(String[] args)
src/chapter09graphs/GraphAdjacencyMatrix.java:119
Method
main
(String[] args)
src/chapter09graphs/GraphAdjacencyList.java:172
Method
main
(String[] args)
src/chapter09graphs/DFS.java:147
Method
main
(String args[])
src/chapter11searching/InterpolationSearch.java:39
Method
main
(String [] args)
src/chapter11searching/DutchNationalFlag.java:38
Method
main
(String[] args)
src/chapter18divideandconquer/PeakFinder_1D_Binary_Search.java:31
Method
main
(String[] args)
src/chapter18divideandconquer/ExponentialDivideAndConquer.java:41
Method
main
(String[] args)
src/chapter18divideandconquer/All_PeakFinder_1D_Linear_Search.java:26
Method
main
(String[] args)
src/chapter18divideandconquer/PeakFinder_1D_Linear_Search.java:25
Method
main
(String[] args)
src/chapter18divideandconquer/SkyLineBruteForce.java:20
Method
main
(String[] args)
src/chapter18divideandconquer/Highest_PeakFinder_1D_Linear_Search.java:24
Method
makeEmpty
( )
src/chapter07priorityqueues/BinaryHeap.java:96
Method
makeHuffmanCodes
(int[] freq)
src/chapter17greedyalgorithms/Huffman.java:56
Method
maxDepthIterative
(BinaryTreeNode root)
src/chapter06trees/MaxDepthInBinaryTreeWithStack.java:19
Method
maxDepthLevelOrder
(BinaryTreeNode root)
src/chapter06trees/MaxDepthInBinaryTreeWithLevelOrder.java:22
Method
maxDepthRecursive
(BinaryTreeNode root)
src/chapter06trees/MaxDepthRecursiveInBinaryTree.java:15
Method
maxInBinaryTree
(BinaryTreeNode root)
src/chapter06trees/MaxInBinaryTreeRecursive.java:17
Method
maxInBinaryTreeLevelOrder
(BinaryTreeNode root)
src/chapter06trees/MaxInBinaryTreeLevelOrder.java:21
Method
maxSubArray
(int[] A)
src/chapter19dynamicprogramming/MaxSumSubArrayDP.java:16
Method
maxSumSubArray
(int[] A)
src/chapter18divideandconquer/MaxSumSubArrayDividAndConquer.java:16
Method
merge
(int A[], int m, int B[], int n)
src/chapter10sorting/MergeTwoSortedArrays.java:15
Method
mergeKLists
(ArrayList<ListNode> lists)
src/chapter07priorityqueues/MergingKSortedLists.java:20
Method
mergeKLists
(ArrayList<ListNode> lists)
src/chapter03linkedlists/MergeKSortedLists.java:20
Method
mergeTwoLists
(ListNode head1, ListNode head2)
src/chapter03linkedlists/MergeSortedListsIterative.java:16
Method
mergeTwoLists
(ListNode head1, ListNode head2)
src/chapter03linkedlists/MergeSortedListsRecursion.java:16
Method
minDepth
(BinaryTreeNode root)
src/chapter06trees/MinimumDepth.java:19
Method
minInBinaryTree
(BinaryTreeNode root)
src/chapter06trees/MinInBinaryTreeRecursive.java:18
Method
minWindow
(String input, String chars)
src/chapter15stringalgorithms/MinLengthWindow.java:16
Method
mirrorOfBinaryTree
(BinaryTreeNode root)
src/chapter06trees/MirrorOfBinaryTree.java:18
Method
next
()
src/chapter09graphs/BFS.java:89
Method
next
()
src/chapter09graphs/GraphAdjacencyMatrix.java:91
Method
next
()
src/chapter09graphs/GraphAdjacencyList.java:63
Method
next
()
src/chapter09graphs/DFS.java:89
Method
nthNodeFromEnd
(ListNode head, int Nth)
src/chapter03linkedlists/NthNodeFromEnd.java:17
Method
nthNodeFromEndIterative
(ListNode head, int Nth)
src/chapter03linkedlists/NthNodeFromEnd.java:28
Method
numOfBSTs
(int n)
src/chapter06trees/CountBSTs.java:16
Method
numberCombinations
(int n, int k)
src/chapter15stringalgorithms/NumberCombinations.java:18
Method
numberOfFullNodesInBTusingLevelOrder
(BinaryTreeNode root)
src/chapter06trees/NumberOfFullNodesInBTusingLevelOrder.java:21
Method
numberOfHalfNodesInBTusingLevelOrder
(BinaryTreeNode root)
src/chapter06trees/NumberOfHalfNodesInBTusingLevelOrder.java:21
← previous
next →
301–400 of 490, ranked by callers