├── BST ├── BST Class.cpp ├── BST to Sorted LL.cpp ├── Check if a Binary Tree is BST.cpp ├── Construct BST from a Sorted Array.cpp ├── Create & Insert Duplicate Node.cpp ├── Find Path in BST.cpp ├── LCA of BST.cpp ├── LCA of Binary Tree.cpp ├── Largest BST.cpp ├── Pair Sum Binary Tree.cpp ├── Pair Sum in a BST.cpp ├── Path Sum Root to Leaf.cpp ├── Print Elements in range.cpp ├── Print Nodes at distance k from node.cpp ├── Replace with Sum of greater nodes.cpp └── Search in BST.cpp ├── Backtracking ├── Crossword Problem.cpp ├── N-Queen Problem.cpp ├── Rat in A Maze Problem.cpp ├── Subset Sum.cpp └── Sudoku Solver.cpp ├── Binary Trees ├── Check Balanced.cpp ├── Construct Tree from Postorder and Inorder.cpp ├── Construct Tree from Preorder and Inorder.cpp ├── Find a node.cpp ├── Height of Binary Tree.cpp ├── Level Order Traversal.cpp ├── Level wise linkedlist.cpp ├── Min and Max of Binary Tree.cpp ├── Mirror.cpp ├── Nodes without sibling.cpp ├── Postorder Binary Tree.cpp ├── Preorder Binary Tree.cpp ├── Print Level Wise.cpp ├── Remove Leaf nodes.cpp ├── Sum of Nodes.cpp └── ZigZag tree.cpp ├── DP 1 ├── Min Steps to 1 using DP.cpp ├── Min Steps to 1.cpp ├── Minimum Count.cpp ├── Number of Balanced BTs using DP.cpp ├── Number of Balanced BTs.cpp └── Staircase using DP.cpp ├── DP 2 ├── All possible ways.cpp ├── Coin Tower.cpp ├── Edit Distance(Memoization and DP).cpp ├── Edit Distance.cpp ├── Knapsack(Memoization and DP).cpp ├── Knapsack.cpp ├── Longest Increasing Subsequence.cpp ├── Loot Houses.cpp ├── Matrix Chain Multiplication.cpp ├── Maximum Square Matrix with all Zeros.cpp ├── Min Cost Path.cpp ├── Shortest Subsequence.cpp └── Ways to Make Coin Change.cpp ├── Graphs 1 ├── 3 Cycle.cpp ├── All connected components.cpp ├── BFS Traversal.cpp ├── Coding Ninjas.cpp ├── Connecting Dots.cpp ├── Get Path - BFS.cpp ├── Get Path - DFS.cpp ├── Has Path.cpp ├── Is connected.cpp ├── Islands.cpp └── Largest Piece.cpp ├── Graphs 2 ├── Dijkstra's Algorithm.cpp ├── Kruskal's Algorithm.cpp └── Prim's Algorithm.cpp ├── Hashmaps ├── Extract Unique characters.cpp ├── Longest Consecutive Sequence.cpp ├── Longest Subset Zero sum.cpp ├── Maximum Frequency Number.cpp ├── Pair Sum to 0.cpp ├── Pairs with difference K.cpp └── Print Intersection.cpp ├── Linked List 1 ├── AppendLastNToFirst.cpp ├── Delete node(recurisve).cpp ├── Delete node.cpp ├── Eliminate duplicates from LL.cpp ├── Find a Node in Linked List.cpp ├── Insert node(recursive).cpp ├── Length of LL(recursive).cpp ├── Length of LL.cpp ├── Palindrome LinkedList.cpp ├── Print Reverse LinkedList.cpp └── Print ith node.cpp ├── Linked List 2 ├── Bubble Sort(Iterative) LinkedList.cpp ├── Delete every N nodes.cpp ├── Even after Odd LinkedList.cpp ├── Find a node in LL(recursive).cpp ├── Merge Sort.cpp ├── Merge Two Sorted LL.cpp ├── Midpoint of LL.cpp ├── Reverse LL(Iterative).cpp ├── Reverse LL(recursive).cpp ├── Swap two Nodes of LL.cpp └── kReverse.cpp ├── OOPS 1 and 2 ├── Complex Number Class.cpp └── Polynomial Class.cpp ├── Priority Queues ├── Buy the ticket.cpp ├── Check Max Heap.cpp ├── In-place heap sort.cpp ├── K largest elements.cpp ├── K smallest elements.cpp ├── Kth largest element.cpp ├── Max Priority Queue.cpp ├── Merge K sorted arrays.cpp ├── Remove Min.cpp └── Running Median.cpp ├── Recursion 1 ├── All indices of number.cpp ├── Check Number.cpp ├── Check Palindrome(Recursive).cpp ├── Count Zeroes.cpp ├── First Index of Number.cpp ├── Geometric Sum.cpp ├── Last Index of Number.cpp ├── Multiplication(Recursive).cpp ├── Power.cpp ├── Print Numbers.cpp ├── Sum of Array.cpp ├── Sum of Digits(Recursive).cpp └── Sum of Digits.cpp ├── Recursion 1b ├── Pair Star.cpp ├── Remove X.cpp ├── Replace pi(Recursive).cpp ├── String to Integer.cpp └── Tower of Hanoi.cpp ├── Recursion 2 ├── Binary Search(Recursive).cpp ├── Check AB.cpp ├── Merge Sort.cpp ├── Print Keypad Combinations Code.cpp ├── Print Permutations.cpp ├── Print Subset Sum to K.cpp ├── Print Subset.cpp ├── Print all codes.cpp ├── Quick Sort.cpp ├── Remove Duplicates(Recursively).cpp ├── Replace Characters(Recursively).cpp ├── Return Keypad Code.cpp ├── Return Permutations.cpp ├── Return Subset.cpp ├── Return Subsets Sum to K.cpp ├── Return all codes.cpp └── Staircase.cpp ├── Stacks and Queues ├── Balanced Parenthesis.cpp ├── Check Redundant Brackets.cpp ├── Minimum bracket Reversal.cpp ├── Queue using LL.cpp ├── Reverse Queue.cpp ├── Reverse a Stack.cpp ├── Stack Using LL.cpp └── Stock Span.cpp ├── Tests ├── Check Cousins.cpp ├── Delete Alternate Nodes.cpp ├── Deque.cpp ├── Does s contain t.cpp ├── Longest Leaf to root path.cpp ├── Maximum Profit on App.cpp ├── Next Number.cpp ├── Remove Leaf Nodes in Tree.cpp └── Split Array.cpp ├── Time and Space Complexity ├── Array intersection.cpp ├── Check Array Rotation.cpp ├── Duplicate in array.cpp ├── Find the Unique Element.cpp ├── Pair Sum in array.cpp ├── Rotate array.cpp └── Triplet Sum.cpp ├── Trees ├── Contains x.cpp ├── Count leaf nodes.cpp ├── Count nodes.cpp ├── Find height.cpp ├── Find sum of nodes.cpp ├── Max data node.cpp ├── Next larger.cpp ├── Node with maximum child sum.cpp ├── PostOrder Traversal.cpp ├── Print Level Wise.cpp ├── Replace with depth.cpp ├── Second Largest Element in Tree.cpp └── Structurally identical.cpp └── Tries and Huffman Coding ├── Auto complete.cpp ├── Palindrome Pair.cpp ├── Pattern Matching.cpp └── Search in Tries.cpp /BST/BST Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/BST Class.cpp -------------------------------------------------------------------------------- /BST/BST to Sorted LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/BST to Sorted LL.cpp -------------------------------------------------------------------------------- /BST/Check if a Binary Tree is BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Check if a Binary Tree is BST.cpp -------------------------------------------------------------------------------- /BST/Construct BST from a Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Construct BST from a Sorted Array.cpp -------------------------------------------------------------------------------- /BST/Create & Insert Duplicate Node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Create & Insert Duplicate Node.cpp -------------------------------------------------------------------------------- /BST/Find Path in BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Find Path in BST.cpp -------------------------------------------------------------------------------- /BST/LCA of BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/LCA of BST.cpp -------------------------------------------------------------------------------- /BST/LCA of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/LCA of Binary Tree.cpp -------------------------------------------------------------------------------- /BST/Largest BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Largest BST.cpp -------------------------------------------------------------------------------- /BST/Pair Sum Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Pair Sum Binary Tree.cpp -------------------------------------------------------------------------------- /BST/Pair Sum in a BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Pair Sum in a BST.cpp -------------------------------------------------------------------------------- /BST/Path Sum Root to Leaf.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Path Sum Root to Leaf.cpp -------------------------------------------------------------------------------- /BST/Print Elements in range.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Print Elements in range.cpp -------------------------------------------------------------------------------- /BST/Print Nodes at distance k from node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Print Nodes at distance k from node.cpp -------------------------------------------------------------------------------- /BST/Replace with Sum of greater nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Replace with Sum of greater nodes.cpp -------------------------------------------------------------------------------- /BST/Search in BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/BST/Search in BST.cpp -------------------------------------------------------------------------------- /Backtracking/Crossword Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Backtracking/Crossword Problem.cpp -------------------------------------------------------------------------------- /Backtracking/N-Queen Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Backtracking/N-Queen Problem.cpp -------------------------------------------------------------------------------- /Backtracking/Rat in A Maze Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Backtracking/Rat in A Maze Problem.cpp -------------------------------------------------------------------------------- /Backtracking/Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Backtracking/Subset Sum.cpp -------------------------------------------------------------------------------- /Backtracking/Sudoku Solver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Backtracking/Sudoku Solver.cpp -------------------------------------------------------------------------------- /Binary Trees/Check Balanced.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Check Balanced.cpp -------------------------------------------------------------------------------- /Binary Trees/Construct Tree from Postorder and Inorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Construct Tree from Postorder and Inorder.cpp -------------------------------------------------------------------------------- /Binary Trees/Construct Tree from Preorder and Inorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Construct Tree from Preorder and Inorder.cpp -------------------------------------------------------------------------------- /Binary Trees/Find a node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Find a node.cpp -------------------------------------------------------------------------------- /Binary Trees/Height of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Height of Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Trees/Level Order Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Level Order Traversal.cpp -------------------------------------------------------------------------------- /Binary Trees/Level wise linkedlist.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Level wise linkedlist.cpp -------------------------------------------------------------------------------- /Binary Trees/Min and Max of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Min and Max of Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Trees/Mirror.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Mirror.cpp -------------------------------------------------------------------------------- /Binary Trees/Nodes without sibling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Nodes without sibling.cpp -------------------------------------------------------------------------------- /Binary Trees/Postorder Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Postorder Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Trees/Preorder Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Preorder Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Trees/Print Level Wise.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Print Level Wise.cpp -------------------------------------------------------------------------------- /Binary Trees/Remove Leaf nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Remove Leaf nodes.cpp -------------------------------------------------------------------------------- /Binary Trees/Sum of Nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/Sum of Nodes.cpp -------------------------------------------------------------------------------- /Binary Trees/ZigZag tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Binary Trees/ZigZag tree.cpp -------------------------------------------------------------------------------- /DP 1/Min Steps to 1 using DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Min Steps to 1 using DP.cpp -------------------------------------------------------------------------------- /DP 1/Min Steps to 1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Min Steps to 1.cpp -------------------------------------------------------------------------------- /DP 1/Minimum Count.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Minimum Count.cpp -------------------------------------------------------------------------------- /DP 1/Number of Balanced BTs using DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Number of Balanced BTs using DP.cpp -------------------------------------------------------------------------------- /DP 1/Number of Balanced BTs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Number of Balanced BTs.cpp -------------------------------------------------------------------------------- /DP 1/Staircase using DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 1/Staircase using DP.cpp -------------------------------------------------------------------------------- /DP 2/All possible ways.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/All possible ways.cpp -------------------------------------------------------------------------------- /DP 2/Coin Tower.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Coin Tower.cpp -------------------------------------------------------------------------------- /DP 2/Edit Distance(Memoization and DP).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Edit Distance(Memoization and DP).cpp -------------------------------------------------------------------------------- /DP 2/Edit Distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Edit Distance.cpp -------------------------------------------------------------------------------- /DP 2/Knapsack(Memoization and DP).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Knapsack(Memoization and DP).cpp -------------------------------------------------------------------------------- /DP 2/Knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Knapsack.cpp -------------------------------------------------------------------------------- /DP 2/Longest Increasing Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Longest Increasing Subsequence.cpp -------------------------------------------------------------------------------- /DP 2/Loot Houses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Loot Houses.cpp -------------------------------------------------------------------------------- /DP 2/Matrix Chain Multiplication.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Matrix Chain Multiplication.cpp -------------------------------------------------------------------------------- /DP 2/Maximum Square Matrix with all Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Maximum Square Matrix with all Zeros.cpp -------------------------------------------------------------------------------- /DP 2/Min Cost Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Min Cost Path.cpp -------------------------------------------------------------------------------- /DP 2/Shortest Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Shortest Subsequence.cpp -------------------------------------------------------------------------------- /DP 2/Ways to Make Coin Change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/DP 2/Ways to Make Coin Change.cpp -------------------------------------------------------------------------------- /Graphs 1/3 Cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/3 Cycle.cpp -------------------------------------------------------------------------------- /Graphs 1/All connected components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/All connected components.cpp -------------------------------------------------------------------------------- /Graphs 1/BFS Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/BFS Traversal.cpp -------------------------------------------------------------------------------- /Graphs 1/Coding Ninjas.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Coding Ninjas.cpp -------------------------------------------------------------------------------- /Graphs 1/Connecting Dots.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Connecting Dots.cpp -------------------------------------------------------------------------------- /Graphs 1/Get Path - BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Get Path - BFS.cpp -------------------------------------------------------------------------------- /Graphs 1/Get Path - DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Get Path - DFS.cpp -------------------------------------------------------------------------------- /Graphs 1/Has Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Has Path.cpp -------------------------------------------------------------------------------- /Graphs 1/Is connected.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Is connected.cpp -------------------------------------------------------------------------------- /Graphs 1/Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Islands.cpp -------------------------------------------------------------------------------- /Graphs 1/Largest Piece.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 1/Largest Piece.cpp -------------------------------------------------------------------------------- /Graphs 2/Dijkstra's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 2/Dijkstra's Algorithm.cpp -------------------------------------------------------------------------------- /Graphs 2/Kruskal's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 2/Kruskal's Algorithm.cpp -------------------------------------------------------------------------------- /Graphs 2/Prim's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Graphs 2/Prim's Algorithm.cpp -------------------------------------------------------------------------------- /Hashmaps/Extract Unique characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Extract Unique characters.cpp -------------------------------------------------------------------------------- /Hashmaps/Longest Consecutive Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Longest Consecutive Sequence.cpp -------------------------------------------------------------------------------- /Hashmaps/Longest Subset Zero sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Longest Subset Zero sum.cpp -------------------------------------------------------------------------------- /Hashmaps/Maximum Frequency Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Maximum Frequency Number.cpp -------------------------------------------------------------------------------- /Hashmaps/Pair Sum to 0.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Pair Sum to 0.cpp -------------------------------------------------------------------------------- /Hashmaps/Pairs with difference K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Pairs with difference K.cpp -------------------------------------------------------------------------------- /Hashmaps/Print Intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Hashmaps/Print Intersection.cpp -------------------------------------------------------------------------------- /Linked List 1/AppendLastNToFirst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/AppendLastNToFirst.cpp -------------------------------------------------------------------------------- /Linked List 1/Delete node(recurisve).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Delete node(recurisve).cpp -------------------------------------------------------------------------------- /Linked List 1/Delete node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Delete node.cpp -------------------------------------------------------------------------------- /Linked List 1/Eliminate duplicates from LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Eliminate duplicates from LL.cpp -------------------------------------------------------------------------------- /Linked List 1/Find a Node in Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Find a Node in Linked List.cpp -------------------------------------------------------------------------------- /Linked List 1/Insert node(recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Insert node(recursive).cpp -------------------------------------------------------------------------------- /Linked List 1/Length of LL(recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Length of LL(recursive).cpp -------------------------------------------------------------------------------- /Linked List 1/Length of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Length of LL.cpp -------------------------------------------------------------------------------- /Linked List 1/Palindrome LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Palindrome LinkedList.cpp -------------------------------------------------------------------------------- /Linked List 1/Print Reverse LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Print Reverse LinkedList.cpp -------------------------------------------------------------------------------- /Linked List 1/Print ith node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 1/Print ith node.cpp -------------------------------------------------------------------------------- /Linked List 2/Bubble Sort(Iterative) LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Bubble Sort(Iterative) LinkedList.cpp -------------------------------------------------------------------------------- /Linked List 2/Delete every N nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Delete every N nodes.cpp -------------------------------------------------------------------------------- /Linked List 2/Even after Odd LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Even after Odd LinkedList.cpp -------------------------------------------------------------------------------- /Linked List 2/Find a node in LL(recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Find a node in LL(recursive).cpp -------------------------------------------------------------------------------- /Linked List 2/Merge Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Merge Sort.cpp -------------------------------------------------------------------------------- /Linked List 2/Merge Two Sorted LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Merge Two Sorted LL.cpp -------------------------------------------------------------------------------- /Linked List 2/Midpoint of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Midpoint of LL.cpp -------------------------------------------------------------------------------- /Linked List 2/Reverse LL(Iterative).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Reverse LL(Iterative).cpp -------------------------------------------------------------------------------- /Linked List 2/Reverse LL(recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Reverse LL(recursive).cpp -------------------------------------------------------------------------------- /Linked List 2/Swap two Nodes of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/Swap two Nodes of LL.cpp -------------------------------------------------------------------------------- /Linked List 2/kReverse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Linked List 2/kReverse.cpp -------------------------------------------------------------------------------- /OOPS 1 and 2/Complex Number Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/OOPS 1 and 2/Complex Number Class.cpp -------------------------------------------------------------------------------- /OOPS 1 and 2/Polynomial Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/OOPS 1 and 2/Polynomial Class.cpp -------------------------------------------------------------------------------- /Priority Queues/Buy the ticket.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Buy the ticket.cpp -------------------------------------------------------------------------------- /Priority Queues/Check Max Heap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Check Max Heap.cpp -------------------------------------------------------------------------------- /Priority Queues/In-place heap sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/In-place heap sort.cpp -------------------------------------------------------------------------------- /Priority Queues/K largest elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/K largest elements.cpp -------------------------------------------------------------------------------- /Priority Queues/K smallest elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/K smallest elements.cpp -------------------------------------------------------------------------------- /Priority Queues/Kth largest element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Kth largest element.cpp -------------------------------------------------------------------------------- /Priority Queues/Max Priority Queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Max Priority Queue.cpp -------------------------------------------------------------------------------- /Priority Queues/Merge K sorted arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Merge K sorted arrays.cpp -------------------------------------------------------------------------------- /Priority Queues/Remove Min.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Remove Min.cpp -------------------------------------------------------------------------------- /Priority Queues/Running Median.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Priority Queues/Running Median.cpp -------------------------------------------------------------------------------- /Recursion 1/All indices of number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/All indices of number.cpp -------------------------------------------------------------------------------- /Recursion 1/Check Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Check Number.cpp -------------------------------------------------------------------------------- /Recursion 1/Check Palindrome(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Check Palindrome(Recursive).cpp -------------------------------------------------------------------------------- /Recursion 1/Count Zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Count Zeroes.cpp -------------------------------------------------------------------------------- /Recursion 1/First Index of Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/First Index of Number.cpp -------------------------------------------------------------------------------- /Recursion 1/Geometric Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Geometric Sum.cpp -------------------------------------------------------------------------------- /Recursion 1/Last Index of Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Last Index of Number.cpp -------------------------------------------------------------------------------- /Recursion 1/Multiplication(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Multiplication(Recursive).cpp -------------------------------------------------------------------------------- /Recursion 1/Power.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Power.cpp -------------------------------------------------------------------------------- /Recursion 1/Print Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Print Numbers.cpp -------------------------------------------------------------------------------- /Recursion 1/Sum of Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Sum of Array.cpp -------------------------------------------------------------------------------- /Recursion 1/Sum of Digits(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Sum of Digits(Recursive).cpp -------------------------------------------------------------------------------- /Recursion 1/Sum of Digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1/Sum of Digits.cpp -------------------------------------------------------------------------------- /Recursion 1b/Pair Star.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1b/Pair Star.cpp -------------------------------------------------------------------------------- /Recursion 1b/Remove X.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1b/Remove X.cpp -------------------------------------------------------------------------------- /Recursion 1b/Replace pi(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1b/Replace pi(Recursive).cpp -------------------------------------------------------------------------------- /Recursion 1b/String to Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1b/String to Integer.cpp -------------------------------------------------------------------------------- /Recursion 1b/Tower of Hanoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 1b/Tower of Hanoi.cpp -------------------------------------------------------------------------------- /Recursion 2/Binary Search(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Binary Search(Recursive).cpp -------------------------------------------------------------------------------- /Recursion 2/Check AB.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Check AB.cpp -------------------------------------------------------------------------------- /Recursion 2/Merge Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Merge Sort.cpp -------------------------------------------------------------------------------- /Recursion 2/Print Keypad Combinations Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Print Keypad Combinations Code.cpp -------------------------------------------------------------------------------- /Recursion 2/Print Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Print Permutations.cpp -------------------------------------------------------------------------------- /Recursion 2/Print Subset Sum to K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Print Subset Sum to K.cpp -------------------------------------------------------------------------------- /Recursion 2/Print Subset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Print Subset.cpp -------------------------------------------------------------------------------- /Recursion 2/Print all codes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Print all codes.cpp -------------------------------------------------------------------------------- /Recursion 2/Quick Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Quick Sort.cpp -------------------------------------------------------------------------------- /Recursion 2/Remove Duplicates(Recursively).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Remove Duplicates(Recursively).cpp -------------------------------------------------------------------------------- /Recursion 2/Replace Characters(Recursively).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Replace Characters(Recursively).cpp -------------------------------------------------------------------------------- /Recursion 2/Return Keypad Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Return Keypad Code.cpp -------------------------------------------------------------------------------- /Recursion 2/Return Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Return Permutations.cpp -------------------------------------------------------------------------------- /Recursion 2/Return Subset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Return Subset.cpp -------------------------------------------------------------------------------- /Recursion 2/Return Subsets Sum to K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Return Subsets Sum to K.cpp -------------------------------------------------------------------------------- /Recursion 2/Return all codes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Return all codes.cpp -------------------------------------------------------------------------------- /Recursion 2/Staircase.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Recursion 2/Staircase.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Balanced Parenthesis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Balanced Parenthesis.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Check Redundant Brackets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Check Redundant Brackets.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Minimum bracket Reversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Minimum bracket Reversal.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Queue using LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Queue using LL.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Reverse Queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Reverse Queue.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Reverse a Stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Reverse a Stack.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Stack Using LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Stack Using LL.cpp -------------------------------------------------------------------------------- /Stacks and Queues/Stock Span.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Stacks and Queues/Stock Span.cpp -------------------------------------------------------------------------------- /Tests/Check Cousins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Check Cousins.cpp -------------------------------------------------------------------------------- /Tests/Delete Alternate Nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Delete Alternate Nodes.cpp -------------------------------------------------------------------------------- /Tests/Deque.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Deque.cpp -------------------------------------------------------------------------------- /Tests/Does s contain t.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Does s contain t.cpp -------------------------------------------------------------------------------- /Tests/Longest Leaf to root path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Longest Leaf to root path.cpp -------------------------------------------------------------------------------- /Tests/Maximum Profit on App.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Maximum Profit on App.cpp -------------------------------------------------------------------------------- /Tests/Next Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Next Number.cpp -------------------------------------------------------------------------------- /Tests/Remove Leaf Nodes in Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Remove Leaf Nodes in Tree.cpp -------------------------------------------------------------------------------- /Tests/Split Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tests/Split Array.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Array intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Array intersection.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Check Array Rotation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Check Array Rotation.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Duplicate in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Duplicate in array.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Find the Unique Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Find the Unique Element.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Pair Sum in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Pair Sum in array.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Rotate array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Rotate array.cpp -------------------------------------------------------------------------------- /Time and Space Complexity/Triplet Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Time and Space Complexity/Triplet Sum.cpp -------------------------------------------------------------------------------- /Trees/Contains x.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Contains x.cpp -------------------------------------------------------------------------------- /Trees/Count leaf nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Count leaf nodes.cpp -------------------------------------------------------------------------------- /Trees/Count nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Count nodes.cpp -------------------------------------------------------------------------------- /Trees/Find height.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Find height.cpp -------------------------------------------------------------------------------- /Trees/Find sum of nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Find sum of nodes.cpp -------------------------------------------------------------------------------- /Trees/Max data node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Max data node.cpp -------------------------------------------------------------------------------- /Trees/Next larger.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Next larger.cpp -------------------------------------------------------------------------------- /Trees/Node with maximum child sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Node with maximum child sum.cpp -------------------------------------------------------------------------------- /Trees/PostOrder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/PostOrder Traversal.cpp -------------------------------------------------------------------------------- /Trees/Print Level Wise.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Print Level Wise.cpp -------------------------------------------------------------------------------- /Trees/Replace with depth.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Replace with depth.cpp -------------------------------------------------------------------------------- /Trees/Second Largest Element in Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Second Largest Element in Tree.cpp -------------------------------------------------------------------------------- /Trees/Structurally identical.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Trees/Structurally identical.cpp -------------------------------------------------------------------------------- /Tries and Huffman Coding/Auto complete.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tries and Huffman Coding/Auto complete.cpp -------------------------------------------------------------------------------- /Tries and Huffman Coding/Palindrome Pair.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tries and Huffman Coding/Palindrome Pair.cpp -------------------------------------------------------------------------------- /Tries and Huffman Coding/Pattern Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tries and Huffman Coding/Pattern Matching.cpp -------------------------------------------------------------------------------- /Tries and Huffman Coding/Search in Tries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rahulkumarguptaa/coding-ninjas-data-structure/HEAD/Tries and Huffman Coding/Search in Tries.cpp --------------------------------------------------------------------------------