├── .DS_Store ├── Algorithms ├── .DS_Store ├── c++ │ ├── recursion │ │ ├── questions │ │ │ ├── advanced │ │ │ │ ├── AllPossibleBT.cpp │ │ │ │ ├── JosephusProblem.cpp │ │ │ │ ├── Letter-case-permutation.cpp │ │ │ │ ├── M-colouringProblem.cpp │ │ │ │ ├── MatrixPaths.cpp │ │ │ │ ├── Maximu-binary-tree.cpp │ │ │ │ ├── N-queenProblem.cpp │ │ │ │ ├── PredictTheWinner.cpp │ │ │ │ ├── Print-N-binary-numbers.cpp │ │ │ │ ├── SubsetGeneration.cpp │ │ │ │ ├── Tower-of-hanoi.cpp │ │ │ │ ├── delete-mid-element-stack.cpp │ │ │ │ ├── differentWaysToAddParentheses.cpp │ │ │ │ ├── fibonacci.cpp │ │ │ │ ├── generateParenthesis.cpp │ │ │ │ ├── generate_all_balanced_parenthesis.cpp │ │ │ │ ├── kth-symbol-grammar.cpp │ │ │ │ ├── palindrome-LL.cpp │ │ │ │ ├── permutation-with-caseChange.cpp │ │ │ │ ├── permutation-with-spaces.cpp │ │ │ │ ├── permutationsOfArray.cpp │ │ │ │ ├── powerOfTwo.cpp │ │ │ │ ├── rat-in-a-maze.cpp │ │ │ │ ├── reverseString,cpp │ │ │ │ ├── sortArrayRecursion.cpp │ │ │ │ ├── sortStack.cpp │ │ │ │ ├── stack-reverse-using-recursion.cpp │ │ │ │ ├── sudokoSolver.cpp │ │ │ │ └── swapNodesInPairs.cpp │ │ │ └── basic │ │ │ │ ├── Factorial of a Number Using Recursion.cpp │ │ │ │ ├── powerOfFour.cpp │ │ │ │ ├── powerOfThree.cpp │ │ │ │ ├── remove-LL-elements.cpp │ │ │ │ └── stringPalindromeString.cpp │ │ └── readme.md │ └── sorting │ │ ├── mergesort.cpp │ │ └── quicksort.cpp └── java │ ├── .DS_Store │ └── sorting │ ├── BubbleSort.java │ ├── CyclicSort.java │ ├── InsertionSort.java │ └── SelectionSort.java ├── Binary search .md ├── CODE_OF_CONDUCT.md ├── DataStructure └── c++ │ ├── Array │ └── readme.md │ ├── Binary-Search-Tree │ ├── Ceil-of-a-BST.cpp │ ├── Count-BST-nodes-that-lie-in-a-given-range.cpp │ ├── Delete-a-Node-in-Binary-Search-Tree.cpp │ ├── Insert-a-given-Node-in-Binary-Search-Tree.cpp │ ├── LoveBabbarDsSheet │ │ ├── BinaryTreeToBst.cpp │ │ ├── CheckforBST.cpp │ │ ├── Construct-BST-from-given-preorder-traversal.cpp │ │ ├── Convert-Normal-BST-into-a-Balanced-BST.cpp │ │ ├── Count-pairs-from-2-BST-whose-sum-is-equal-to-given-value-"X".cpp │ │ ├── Delete-a-Node-in-Binary-Search-Tree.cpp │ │ ├── Flatten-binary-tree.cpp │ │ ├── Kth-largest-element-in-BST.cpp │ │ ├── LcaBst.cpp │ │ ├── Median-of-BST.cpp │ │ ├── Merge-Two-Balanced-Binary-Search-Trees.cpp │ │ ├── Minimum element in BST .cpp │ │ ├── Populate-Inorder-Successor-for-all-nodes.cpp │ │ ├── Predecessor and Successor.cpp │ │ ├── Preorder-to-postorder.cpp │ │ ├── Replace-every-element-with-the-least-greater-element-on-its-right.cpp │ │ ├── dead-end-bst.cpp │ │ ├── find-a-node-in-a-BST.cpp │ │ ├── kth-smallest-element-in-BST.cpp │ │ └── largest-bst.cpp │ ├── Search-in-a-BST.cpp │ ├── floor-in-a-binary-tree.cpp │ ├── prerequisite.md │ └── readme.md │ ├── Binary-trees │ ├── Bottom-view-of-a-binary-tree.cpp │ ├── Check_Balanced_Binary_Tree.cpp │ ├── Construct-a-Binary-Tree-Preorder-and-Inorder-Traversal.cpp │ ├── Construct-the-Binary-Tree-from-Postorder-and-Inorder-Traversal.cpp │ ├── Count-total-Nodes-in-a-COMPLETE-Binary-Tree.cpp │ ├── Diameter of Binary tree.cpp │ ├── Flatten-a-binary-tree-to-a-linkedList.cpp │ ├── LoverBabbarSheet │ │ ├── Bottom-view-of-a-binary-tree.cpp │ │ ├── Check_Balanced_Binary_Tree.cpp │ │ ├── Construct Tree from Inorder & Preorder.cpp │ │ ├── Create-a-mirror-tree-BabbarSheet.cpp │ │ ├── Diagonal-traversal-BinaryTree.cpp │ │ ├── Diameter-of-binary-tree-BabbarSheet.cpp │ │ ├── Duplicate Subtrees.cpp │ │ ├── Duplicate-subtree-in-Binary-Tree.cpp │ │ ├── Graph-is-tree-or-not.cpp │ │ ├── Inorder-traversal.cpp │ │ ├── Kth ancestor of a node in binary tree | Set 2.cpp │ │ ├── Level-order-traversal.cpp │ │ ├── Lowest Common Ancestor in a Binary Tree.cpp │ │ ├── Maximum sum of nodes in Binary tree such that no two are adjacent.cpp │ │ ├── Min distance between two given nodes of a Binary Tree.cpp │ │ ├── Minimum-swap-required-to-convert-binary-tree-to-binary-search-tree.cpp │ │ ├── PostOrder-BabbarSheet.cpp │ │ ├── PreOrderBabbarSheet.cpp │ │ ├── Print all k-sum paths in a binary tree.cpp │ │ ├── Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node).cpp │ │ ├── Top-View-Of-A-Binary-Tree.cpp │ │ ├── Tree-Isomorphism-Problem.cpp │ │ ├── boundary-traversal.cpp │ │ ├── check-all-leaf-nodes-are-same-level.cpp │ │ ├── construct-String-to-tree.cpp │ │ ├── convert-Binary-Into-DublyLL.cpp │ │ ├── convert-Binary-Into-sumTree.cpp │ │ ├── find-Largest-SubtreeSum.cpp │ │ ├── height-of-a-binary-tree-BabbarSheet.cpp │ │ ├── left-viewBabbarSheet.cpp │ │ ├── reverse-level-order.cpp │ │ ├── right-viewBabbarSheet.cpp │ │ ├── sum-tree-check.cpp │ │ └── zigzag-Traversal.cpp │ ├── Lowest-common-ancestor.cpp │ ├── Maximum Path Sum.cpp │ ├── Minimum-time-taken-to-BURN-the-Binary-Tree-from-a-Node.cpp │ ├── Print-all-the-Nodes-at-a-distance-of-K-in-Binary-Tree.cpp │ ├── Serialize-and-De-serialize-Binary-Tree.cpp │ ├── Top-View-Of-A-Binary-Tree.cpp │ ├── VerticalOrderTraversal.cpp │ ├── boundary-traversal.cpp │ ├── check-Indentical-Tress.cpp │ ├── children_Sum_Property.cpp │ ├── max-width-of-binarytree.cpp │ ├── morrisTraversals.cpp │ ├── print-route-to-node-path.cpp │ ├── readme.md │ ├── right-left-view-of-a-binary-tree.cpp │ ├── symmetric-check.cpp │ ├── traversals.cpp │ ├── treeDepth.cpp │ └── zigzag-Traversal.cpp │ ├── Graph │ ├── LoveBabbarDsSheet │ │ ├── Alien-dictionary.cpp │ │ ├── Clone-graph.cpp │ │ ├── Create-a-Graph,printIt.cpp │ │ ├── CycleDetectDirectedGraph.cpp │ │ ├── Find-bridge-in-a-graph.cpp │ │ ├── Find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies.cpp │ │ ├── Flood-fill.cpp │ │ ├── Implement-BFS-algorithm.cpp │ │ ├── Kosaraju's-Algorithm.cpp │ │ ├── Longest-Path-In-DAG.cpp │ │ ├── MST-kruskal's.cpp │ │ ├── Minimum-Edges-to-Reverse-to-make-path -from-a-Source-to-a-Destination.cpp │ │ ├── Number-of-Triangles-in-Directed-and-Undirected-Graphs.cpp │ │ ├── Number-of-islands.cpp │ │ ├── Path-of-greater-than-equal-to-k-length │ │ ├── PrismsAlgo.cpp │ │ ├── Steps-by-knight.cpp │ │ ├── Travelling salesman problem.cpp │ │ ├── bellmanFordALgo.cpp │ │ ├── cheapest-flights-within-k-stops.cpp │ │ ├── dfsGraph.cpp │ │ ├── implement_dijkstra's.cpp │ │ ├── journey-to-the-moon.cpp │ │ ├── m-colouringProblem.cpp │ │ ├── minimum-time-taken-by-each-job-to-get-completed.cpp │ │ ├── snakes-and-ladders.cpp │ │ ├── topological-sort.cpp │ │ └── word-ladder.cpp │ ├── opeartions │ │ ├── BFS-ALGO │ │ │ ├── code.cpp │ │ │ └── readme.md │ │ ├── Bellman-ford-algo.cpp │ │ ├── Bipartite-BFS.cpp │ │ ├── Bipartite-DFS.cpp │ │ ├── Cycle-Detection-UndirectGraph(DFS).cpp │ │ ├── Cycle-DetectionBFS(kahn's algo).cpp │ │ ├── Cycle-detection-in-Undirectedgraph.cpp │ │ ├── CycleDetectionBFS-graph.cpp │ │ ├── DFS-ALGO │ │ │ ├── code.cpp │ │ │ └── readme.md │ │ ├── DisjointSet.cpp │ │ ├── Graph-representation.cpp │ │ ├── Kosaraju's-Algorithm-for-Strongly-Connected-Components-(SCC).cpp │ │ ├── Shortest-Path-in-Directed-Acyclic-Graph-(DAG).cpp │ │ ├── ShortestPath-In-UndirectedGraph.cpp │ │ ├── TopologicalSortBfs(kahn's algo).cpp │ │ ├── TopologicalSortDfs.cpp │ │ ├── articulationPoint.cpp │ │ ├── bridgeInGraph-cut-edge.cpp │ │ ├── dfs-stack.cpp │ │ ├── dijkstra's-algo.cpp │ │ ├── kruskal's-algo.cpp │ │ └── prismsAlgo.cpp │ ├── prerequisites │ └── readme.md │ ├── Linked-list │ ├── Detect a loop in a LinkedList.cpp │ ├── First Node of the starting of the loop.cpp │ ├── Implement a LinkedList.cpp │ ├── Remove loop in Linked List.cpp │ ├── Reverse a Linked List in groups of given size.cpp │ ├── Reverse a LinkedList.cpp │ └── readme.md │ ├── Queue │ ├── Implement LRU cache.cpp │ ├── Implement a circular queue.cpp │ ├── Queue-Implement.cpp │ ├── Reverse First K elements of a queue.cpp │ ├── Reverse a queue using recursion.cpp │ └── implementing queue using stack.cpp │ ├── heap │ ├── Implementing Heap │ │ └── FullCode.cpp │ ├── loveBabbarDsSheet │ │ ├── BST-to-Maxheap.cpp │ │ ├── Merge-k-sorted-linkedList.cpp │ │ ├── bstToHeap.cpp │ │ ├── find-median-in-a-stream.cpp │ │ ├── implement-heap-array.cpp │ │ ├── is-binary-tree-heap.cpp │ │ ├── k-largest-elements.cpp │ │ ├── kth-smallest-element.cpp │ │ ├── merge-k-sorted-arrays.cpp │ │ ├── minimum-cost-of-ropes.cpp │ │ ├── reorganise-string.cpp │ │ └── smallest-range-in-k-lists.cpp │ └── readme.md │ ├── stack │ ├── Stack-implement.cpp │ ├── infixTopostfix.cpp │ ├── infixToprefix.cpp │ ├── postfix expression evaluation.cpp │ ├── prefix expression evaluation.cpp │ ├── reverse a sentence using stack.cpp │ └── stack-implement(using queue).cpp │ └── string │ ├── README.md │ ├── opearations │ └── readme.md │ ├── questions │ └── readme.md │ └── readme.md ├── LICENSE ├── README.md └── contributing.md /.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/.DS_Store -------------------------------------------------------------------------------- /Algorithms/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/.DS_Store -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/AllPossibleBT.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/AllPossibleBT.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/JosephusProblem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/JosephusProblem.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/Letter-case-permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/Letter-case-permutation.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/M-colouringProblem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/M-colouringProblem.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/MatrixPaths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/MatrixPaths.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/Maximu-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/Maximu-binary-tree.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/N-queenProblem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/N-queenProblem.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/PredictTheWinner.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/PredictTheWinner.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/Print-N-binary-numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/Print-N-binary-numbers.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/SubsetGeneration.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/SubsetGeneration.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/Tower-of-hanoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/Tower-of-hanoi.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/delete-mid-element-stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/delete-mid-element-stack.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/differentWaysToAddParentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/differentWaysToAddParentheses.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/fibonacci.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/fibonacci.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/generateParenthesis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/generateParenthesis.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/generate_all_balanced_parenthesis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/generate_all_balanced_parenthesis.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/kth-symbol-grammar.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/kth-symbol-grammar.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/palindrome-LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/palindrome-LL.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/permutation-with-caseChange.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/permutation-with-caseChange.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/permutation-with-spaces.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/permutation-with-spaces.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/permutationsOfArray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/permutationsOfArray.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/powerOfTwo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/powerOfTwo.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/rat-in-a-maze.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/rat-in-a-maze.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/reverseString,cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/reverseString,cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/sortArrayRecursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/sortArrayRecursion.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/sortStack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/sortStack.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/stack-reverse-using-recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/stack-reverse-using-recursion.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/sudokoSolver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/sudokoSolver.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/advanced/swapNodesInPairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/advanced/swapNodesInPairs.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/basic/Factorial of a Number Using Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/basic/Factorial of a Number Using Recursion.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/basic/powerOfFour.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/basic/powerOfFour.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/basic/powerOfThree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/basic/powerOfThree.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/basic/remove-LL-elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/basic/remove-LL-elements.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/questions/basic/stringPalindromeString.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/questions/basic/stringPalindromeString.cpp -------------------------------------------------------------------------------- /Algorithms/c++/recursion/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/recursion/readme.md -------------------------------------------------------------------------------- /Algorithms/c++/sorting/mergesort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/sorting/mergesort.cpp -------------------------------------------------------------------------------- /Algorithms/c++/sorting/quicksort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/c++/sorting/quicksort.cpp -------------------------------------------------------------------------------- /Algorithms/java/.DS_Store: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/java/.DS_Store -------------------------------------------------------------------------------- /Algorithms/java/sorting/BubbleSort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/java/sorting/BubbleSort.java -------------------------------------------------------------------------------- /Algorithms/java/sorting/CyclicSort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/java/sorting/CyclicSort.java -------------------------------------------------------------------------------- /Algorithms/java/sorting/InsertionSort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/java/sorting/InsertionSort.java -------------------------------------------------------------------------------- /Algorithms/java/sorting/SelectionSort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Algorithms/java/sorting/SelectionSort.java -------------------------------------------------------------------------------- /Binary search .md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/Binary search .md -------------------------------------------------------------------------------- /CODE_OF_CONDUCT.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/CODE_OF_CONDUCT.md -------------------------------------------------------------------------------- /DataStructure/c++/Array/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Array/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/Ceil-of-a-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/Ceil-of-a-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/Count-BST-nodes-that-lie-in-a-given-range.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/Count-BST-nodes-that-lie-in-a-given-range.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/Delete-a-Node-in-Binary-Search-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/Delete-a-Node-in-Binary-Search-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/Insert-a-given-Node-in-Binary-Search-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/Insert-a-given-Node-in-Binary-Search-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/BinaryTreeToBst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/BinaryTreeToBst.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/CheckforBST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/CheckforBST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Construct-BST-from-given-preorder-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Construct-BST-from-given-preorder-traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Convert-Normal-BST-into-a-Balanced-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Convert-Normal-BST-into-a-Balanced-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Count-pairs-from-2-BST-whose-sum-is-equal-to-given-value-"X".cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Count-pairs-from-2-BST-whose-sum-is-equal-to-given-value-"X".cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Delete-a-Node-in-Binary-Search-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Delete-a-Node-in-Binary-Search-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Flatten-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Flatten-binary-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Kth-largest-element-in-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Kth-largest-element-in-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/LcaBst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/LcaBst.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Median-of-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Median-of-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Merge-Two-Balanced-Binary-Search-Trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Merge-Two-Balanced-Binary-Search-Trees.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Minimum element in BST .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Minimum element in BST .cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Populate-Inorder-Successor-for-all-nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Populate-Inorder-Successor-for-all-nodes.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Predecessor and Successor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Predecessor and Successor.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Preorder-to-postorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Preorder-to-postorder.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Replace-every-element-with-the-least-greater-element-on-its-right.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/Replace-every-element-with-the-least-greater-element-on-its-right.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/dead-end-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/dead-end-bst.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/find-a-node-in-a-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/find-a-node-in-a-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/kth-smallest-element-in-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/kth-smallest-element-in-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/largest-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/LoveBabbarDsSheet/largest-bst.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/Search-in-a-BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/Search-in-a-BST.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/floor-in-a-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/floor-in-a-binary-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/prerequisite.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/prerequisite.md -------------------------------------------------------------------------------- /DataStructure/c++/Binary-Search-Tree/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-Search-Tree/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Bottom-view-of-a-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Bottom-view-of-a-binary-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Check_Balanced_Binary_Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Check_Balanced_Binary_Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Construct-a-Binary-Tree-Preorder-and-Inorder-Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Construct-a-Binary-Tree-Preorder-and-Inorder-Traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Construct-the-Binary-Tree-from-Postorder-and-Inorder-Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Construct-the-Binary-Tree-from-Postorder-and-Inorder-Traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Count-total-Nodes-in-a-COMPLETE-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Count-total-Nodes-in-a-COMPLETE-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Diameter of Binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Diameter of Binary tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Flatten-a-binary-tree-to-a-linkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Flatten-a-binary-tree-to-a-linkedList.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Bottom-view-of-a-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Bottom-view-of-a-binary-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Check_Balanced_Binary_Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Check_Balanced_Binary_Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Construct Tree from Inorder & Preorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Construct Tree from Inorder & Preorder.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Create-a-mirror-tree-BabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Create-a-mirror-tree-BabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Diagonal-traversal-BinaryTree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Diagonal-traversal-BinaryTree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Diameter-of-binary-tree-BabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Diameter-of-binary-tree-BabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Duplicate Subtrees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Duplicate Subtrees.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Duplicate-subtree-in-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Duplicate-subtree-in-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Graph-is-tree-or-not.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Graph-is-tree-or-not.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Inorder-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Inorder-traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Kth ancestor of a node in binary tree | Set 2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Kth ancestor of a node in binary tree | Set 2.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Level-order-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Level-order-traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Lowest Common Ancestor in a Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Lowest Common Ancestor in a Binary Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Maximum sum of nodes in Binary tree such that no two are adjacent.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Maximum sum of nodes in Binary tree such that no two are adjacent.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Min distance between two given nodes of a Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Min distance between two given nodes of a Binary Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Minimum-swap-required-to-convert-binary-tree-to-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Minimum-swap-required-to-convert-binary-tree-to-binary-search-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/PostOrder-BabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/PostOrder-BabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/PreOrderBabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/PreOrderBabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Print all k-sum paths in a binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Print all k-sum paths in a binary tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Top-View-Of-A-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Top-View-Of-A-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/Tree-Isomorphism-Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/Tree-Isomorphism-Problem.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/boundary-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/boundary-traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/check-all-leaf-nodes-are-same-level.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/check-all-leaf-nodes-are-same-level.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/construct-String-to-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/construct-String-to-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/convert-Binary-Into-DublyLL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/convert-Binary-Into-DublyLL.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/convert-Binary-Into-sumTree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/convert-Binary-Into-sumTree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/find-Largest-SubtreeSum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/find-Largest-SubtreeSum.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/height-of-a-binary-tree-BabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/height-of-a-binary-tree-BabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/left-viewBabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/left-viewBabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/reverse-level-order.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/reverse-level-order.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/right-viewBabbarSheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/right-viewBabbarSheet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/sum-tree-check.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/sum-tree-check.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/LoverBabbarSheet/zigzag-Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/LoverBabbarSheet/zigzag-Traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Lowest-common-ancestor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Lowest-common-ancestor.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Maximum Path Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Maximum Path Sum.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Minimum-time-taken-to-BURN-the-Binary-Tree-from-a-Node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Minimum-time-taken-to-BURN-the-Binary-Tree-from-a-Node.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Print-all-the-Nodes-at-a-distance-of-K-in-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Print-all-the-Nodes-at-a-distance-of-K-in-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Serialize-and-De-serialize-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Serialize-and-De-serialize-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/Top-View-Of-A-Binary-Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/Top-View-Of-A-Binary-Tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/VerticalOrderTraversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/VerticalOrderTraversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/boundary-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/boundary-traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/check-Indentical-Tress.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/check-Indentical-Tress.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/children_Sum_Property.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/children_Sum_Property.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/max-width-of-binarytree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/max-width-of-binarytree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/morrisTraversals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/morrisTraversals.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/print-route-to-node-path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/print-route-to-node-path.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/right-left-view-of-a-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/right-left-view-of-a-binary-tree.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/symmetric-check.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/symmetric-check.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/traversals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/traversals.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/treeDepth.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/treeDepth.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Binary-trees/zigzag-Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Binary-trees/zigzag-Traversal.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Alien-dictionary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Alien-dictionary.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Clone-graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Clone-graph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Create-a-Graph,printIt.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Create-a-Graph,printIt.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/CycleDetectDirectedGraph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/CycleDetectDirectedGraph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Find-bridge-in-a-graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Find-bridge-in-a-graph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Flood-fill.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Flood-fill.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Implement-BFS-algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Implement-BFS-algorithm.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Kosaraju's-Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Kosaraju's-Algorithm.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Longest-Path-In-DAG.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Longest-Path-In-DAG.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/MST-kruskal's.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/MST-kruskal's.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Minimum-Edges-to-Reverse-to-make-path -from-a-Source-to-a-Destination.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Minimum-Edges-to-Reverse-to-make-path -from-a-Source-to-a-Destination.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Number-of-Triangles-in-Directed-and-Undirected-Graphs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Number-of-Triangles-in-Directed-and-Undirected-Graphs.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Number-of-islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Number-of-islands.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Path-of-greater-than-equal-to-k-length: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Path-of-greater-than-equal-to-k-length -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/PrismsAlgo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/PrismsAlgo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Steps-by-knight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Steps-by-knight.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/Travelling salesman problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/Travelling salesman problem.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/bellmanFordALgo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/bellmanFordALgo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/cheapest-flights-within-k-stops.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/cheapest-flights-within-k-stops.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/dfsGraph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/dfsGraph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/implement_dijkstra's.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/implement_dijkstra's.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/journey-to-the-moon.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/journey-to-the-moon.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/m-colouringProblem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/m-colouringProblem.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/minimum-time-taken-by-each-job-to-get-completed.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/minimum-time-taken-by-each-job-to-get-completed.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/snakes-and-ladders.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/snakes-and-ladders.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/topological-sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/topological-sort.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/LoveBabbarDsSheet/word-ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/LoveBabbarDsSheet/word-ladder.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/BFS-ALGO/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/BFS-ALGO/code.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/BFS-ALGO/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/BFS-ALGO/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Bellman-ford-algo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Bellman-ford-algo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Bipartite-BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Bipartite-BFS.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Bipartite-DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Bipartite-DFS.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Cycle-Detection-UndirectGraph(DFS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Cycle-Detection-UndirectGraph(DFS).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Cycle-DetectionBFS(kahn's algo).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Cycle-DetectionBFS(kahn's algo).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Cycle-detection-in-Undirectedgraph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Cycle-detection-in-Undirectedgraph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/CycleDetectionBFS-graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/CycleDetectionBFS-graph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/DFS-ALGO/code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/DFS-ALGO/code.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/DFS-ALGO/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/DFS-ALGO/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/DisjointSet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/DisjointSet.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Graph-representation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Graph-representation.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Kosaraju's-Algorithm-for-Strongly-Connected-Components-(SCC).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Kosaraju's-Algorithm-for-Strongly-Connected-Components-(SCC).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/Shortest-Path-in-Directed-Acyclic-Graph-(DAG).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/Shortest-Path-in-Directed-Acyclic-Graph-(DAG).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/ShortestPath-In-UndirectedGraph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/ShortestPath-In-UndirectedGraph.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/TopologicalSortBfs(kahn's algo).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/TopologicalSortBfs(kahn's algo).cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/TopologicalSortDfs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/TopologicalSortDfs.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/articulationPoint.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/articulationPoint.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/bridgeInGraph-cut-edge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/bridgeInGraph-cut-edge.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/dfs-stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/dfs-stack.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/dijkstra's-algo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/dijkstra's-algo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/kruskal's-algo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/kruskal's-algo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/opeartions/prismsAlgo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/opeartions/prismsAlgo.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Graph/prerequisites: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/prerequisites -------------------------------------------------------------------------------- /DataStructure/c++/Graph/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Graph/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/Detect a loop in a LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/Detect a loop in a LinkedList.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/First Node of the starting of the loop.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/First Node of the starting of the loop.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/Implement a LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/Implement a LinkedList.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/Remove loop in Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/Remove loop in Linked List.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/Reverse a Linked List in groups of given size.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/Reverse a Linked List in groups of given size.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/Reverse a LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/Reverse a LinkedList.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Linked-list/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Linked-list/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/Queue/Implement LRU cache.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/Implement LRU cache.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Queue/Implement a circular queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/Implement a circular queue.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Queue/Queue-Implement.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/Queue-Implement.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Queue/Reverse First K elements of a queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/Reverse First K elements of a queue.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Queue/Reverse a queue using recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/Reverse a queue using recursion.cpp -------------------------------------------------------------------------------- /DataStructure/c++/Queue/implementing queue using stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/Queue/implementing queue using stack.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/Implementing Heap/FullCode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/Implementing Heap/FullCode.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/BST-to-Maxheap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/BST-to-Maxheap.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/Merge-k-sorted-linkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/Merge-k-sorted-linkedList.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/bstToHeap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/bstToHeap.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/find-median-in-a-stream.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/find-median-in-a-stream.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/implement-heap-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/implement-heap-array.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/is-binary-tree-heap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/is-binary-tree-heap.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/k-largest-elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/k-largest-elements.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/kth-smallest-element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/kth-smallest-element.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/merge-k-sorted-arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/merge-k-sorted-arrays.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/minimum-cost-of-ropes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/minimum-cost-of-ropes.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/reorganise-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/reorganise-string.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/loveBabbarDsSheet/smallest-range-in-k-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/heap/loveBabbarDsSheet/smallest-range-in-k-lists.cpp -------------------------------------------------------------------------------- /DataStructure/c++/heap/readme.md: -------------------------------------------------------------------------------- 1 |

Heap

2 | -------------------------------------------------------------------------------- /DataStructure/c++/stack/Stack-implement.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/Stack-implement.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/infixTopostfix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/infixTopostfix.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/infixToprefix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/infixToprefix.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/postfix expression evaluation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/postfix expression evaluation.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/prefix expression evaluation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/prefix expression evaluation.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/reverse a sentence using stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/reverse a sentence using stack.cpp -------------------------------------------------------------------------------- /DataStructure/c++/stack/stack-implement(using queue).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/stack/stack-implement(using queue).cpp -------------------------------------------------------------------------------- /DataStructure/c++/string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/string/README.md -------------------------------------------------------------------------------- /DataStructure/c++/string/opearations/readme.md: -------------------------------------------------------------------------------- 1 | # All string related opearations:- 2 | -------------------------------------------------------------------------------- /DataStructure/c++/string/questions/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/string/questions/readme.md -------------------------------------------------------------------------------- /DataStructure/c++/string/readme.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/DataStructure/c++/string/readme.md -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/LICENSE -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/README.md -------------------------------------------------------------------------------- /contributing.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/subhamengine/DataStructures-and-Algorithm/HEAD/contributing.md --------------------------------------------------------------------------------