├── Assignment: Recursion 1b ├── Pair Star.cpp ├── Remove X.cpp ├── Replace pi (recursive).cpp ├── String to Integer.cpp └── Tower of Hanoi.cpp ├── Conditionals and Loops ├── Check Case.cpp ├── Fahrenheit to Celsius Table.cpp ├── Find power of a number.cpp ├── Number Pattern 1.cpp ├── Number Pattern 2.cpp ├── Start Pattern.cpp ├── Sum of Even Numbers till N.cpp ├── Sum of even & odd.cpp └── Total Salary.cpp ├── Lecture 10 : Stacks & Queues ├── Check redundant brackets.cpp ├── Code : Balanced Parenthesis.cpp ├── Code : Queue Using LL.cpp ├── Code : Stack Using LL.cpp ├── Minimum bracket Reversal.cpp ├── Reverse Queue.cpp ├── Reverse a Stack.cpp └── Stock Span.cpp ├── Lecture 10: Character Arrays and 2D Arrays ├── Check Palindrome.cpp ├── Check Permutation.cpp ├── Column Wise Sum.cpp ├── Compress the String.cpp ├── Highest Occuring Character.cpp ├── Largest Row or Column.cpp ├── Print All Substrings.cpp ├── Remove Consecutive Duplicates.cpp ├── Remove character.cpp ├── Replace Character.cpp ├── Reverse Each Word.cpp ├── Reverse Word Wise.cpp ├── Spiral Print.cpp ├── Trim Spaces.cpp └── Wave Print.cpp ├── Lecture 11 : Trees ├── Code : Count leaf nodes.cpp ├── Code : Find height.cpp ├── Code : Find sum of nodes.cpp ├── Code : Max data node.cpp ├── Code : PostOrder Traversal.cpp ├── Contains x.cpp ├── Count nodes.cpp ├── Next larger.cpp ├── Node with maximum child sum.cpp ├── Print Level Wise.cpp ├── Replace with depth.cpp ├── Second Largest Element In Tree.cpp └── Structurally identical.cpp ├── Lecture 12 : Binary Trees ├── Check Balanced.cpp ├── Code : Find a node.cpp ├── Code : Height of Binary Tree.cpp ├── Code : Mirror.cpp ├── Code: Construct Tree from Preorder and Inorder.cpp ├── Construct Tree from Postorder and Inorder.cpp ├── Level order traversal.cpp ├── Level wise linkedlist.cpp ├── Min and Max of Binary Tree.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 ├── Lecture 13 : BST ├── Check if a Binary Tree is BST.cpp ├── Code: BST Class.cpp ├── Code: BST to Sorted LL.cpp ├── Code: Construct BST from a Sorted Array.cpp ├── Code: Print Elements in Range.cpp ├── Code: Search in BST.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 nodes at distance k from node.cpp └── Replace with Sum of greater nodes.cpp ├── Lecture 14 : Priority Queues ├── Buy the ticket.cpp ├── Check Max-Heap.cpp ├── Code : In-place heap sort.cpp ├── Code : K largest elements.cpp ├── Code : K smallest Elements.cpp ├── Code : Max Priority Queue.cpp ├── Code : Remove Min.cpp ├── Kth largest element.cpp ├── Merge K sorted arrays.cpp └── Running Median.cpp ├── Lecture 15 : Hashmaps ├── Code : Maximum Frequency Number.cpp ├── Code : Pair Sum to 0.cpp ├── Code : Print Intersection.cpp ├── Extract Unique characters.cpp ├── Longest Consecutive Sequence.cpp ├── Longest subarray zero sum.cpp └── Pairs with difference K.cpp ├── Lecture 16 : Tries and Huffman Coding ├── Auto complete.cpp ├── Code : Search in Tries.cpp ├── Palindrome Pair.cpp └── Pattern Matching.cpp ├── Lecture 17 : Backtracking ├── Crossword Problem.cpp ├── N-Queen Problem.cpp ├── Rat In A Maze Problem.cpp ├── Subset Sum.cpp └── Sudoku Solver.cpp ├── Lecture 18 : DP - 1 ├── Code : Min Steps to 1 using DP.cpp ├── Code : Min Steps to 1.cpp ├── Code : Minimum Count.cpp ├── Code : No. of balanced BTs using DP.cpp ├── Code : No. of balanced BTs.cpp └── Code : Staircase using Dp.cpp ├── Lecture 19 : DP - 2 ├── All possible ways.cpp ├── Code : Edit Distance (Memoization and DP).cpp ├── Code : Edit Distance.cpp ├── Code : Knapsack.cpp ├── Code : Min Cost Path.cpp ├── Code: Knapsack (Memoization and DP).cpp ├── Coin Tower.cpp ├── Longest Increasing Subsequence.cpp ├── Loot Houses.cpp ├── Matrix Chain Multiplication.cpp ├── Maximum Square Matrix With All Zeros.cpp ├── Shortest Subsequence.cpp └── Ways To Make Coin Change.cpp ├── Lecture 20 : Graphs 1 ├── 3 Cycle.cpp ├── Code : All connected components.cpp ├── Code : BFS Traversal.cpp ├── Code : Get Path - BFS.cpp ├── Code : Get Path - DFS.cpp ├── Code : Has Path.cpp ├── Code : Is Connected.cpp ├── Coding Ninjas.cpp ├── Connecting Dots.cpp ├── Islands.cpp └── Largest Piece.cpp ├── Lecture 21 : Graphs 2 ├── Code : Dijkstra's Algorithm.cpp ├── Code : Kruskal's Algorithm.cpp └── Code : Prim's Algorithm.cpp ├── Lecture 3: Recursion 1 ├── All Indices of Number.cpp ├── Check Number.cpp ├── Check Palindrome (recursive).cpp ├── Count Zeros.cpp ├── First Index of Number.cpp ├── Geometric Sum.cpp ├── Last Index of Number.cpp ├── Multiplication (Recursive).cpp ├── Number of Digits.cpp ├── Power.cpp ├── Print Numbers.cpp ├── Sum of Array.cpp └── Sum of digits (recursive).cpp ├── Lecture 4: Recursion 2 ├── Binary Search (Recursive).cpp ├── Check AB.cpp ├── Merge Sort Code.cpp ├── Print Keypad Combinations Code.cpp ├── Print Permutations.cpp ├── Print Subset Sum to K.cpp ├── Print Subsets of Array.cpp ├── Print all Codes - String.cpp ├── Quick Sort Code.cpp ├── Remove Duplicates Recursively.cpp ├── Replace Character Recursively.cpp ├── Return Keypad Code.cpp ├── Return Permutations - String.cpp ├── Return all codes - String.cpp ├── Return subset of an array.cpp ├── Return subsets sum to K.cpp └── Staircase.cpp ├── Lecture 5 : Time and Space Complexity Analysis ├── 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 ├── Lecture 6: OOPS 1 └── Complex Number Class.cpp ├── Lecture 7: Functions ├── Fahrenheit to Celsius Table.cpp └── Fibonacci Number.cpp ├── Lecture 7: OOPS 2 └── Code : Polynomial Class.cpp ├── Lecture 8 : Linked List 1 ├── AppendLastNToFirst.cpp ├── Delete node (recursive).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 ├── Lecture 8: Arrays ├── Arrange Numbers in Array.cpp ├── Array Sum.cpp ├── Find Duplicate.cpp ├── Find Unique.cpp ├── Intersection of Two Arrays II.cpp ├── Linear Search.cpp ├── Pair Sum.cpp ├── Sort 0 1.cpp ├── Swap Alternate.cpp └── Triplet Sum.cpp ├── Lecture 9: Linked List 2 ├── Bubble Sort (Iterative) LinkedList.cpp ├── Code : Reverse LL (Recursive).cpp ├── Code: Merge Sort.cpp ├── Code: Merge Two Sorted LL.cpp ├── Code: Midpoint of LL.cpp ├── Code: Reverse LL (Iterative).cpp ├── Delete every N nodes.cpp ├── Even after Odd LinkedList.cpp ├── Find a node in LL (recursive).cpp ├── Swap two Nodes of LL.cpp └── kReverse.cpp ├── Lecture 9: Searching and Sorting ├── Check Array Rotation.cpp ├── Code Binary Search.cpp ├── Code Bubble Sort.cpp ├── Code Insertion Sort.cpp ├── Code Merge Two Sorted Arrays.cpp ├── Push Zeros to end.cpp ├── Rotate array.cpp ├── Second Largest in array.cpp ├── Sort 0 1 2.cpp └── Sum of Two Arrays.cpp ├── Operators and For Loop ├── All Prime Numbers.cpp ├── Binary to decimal.cpp ├── Check Number sequence.cpp ├── Count Characters.cpp ├── Decimal to Binary.cpp ├── Nth Fibonacci Number.cpp ├── Reverse of a number.cpp ├── Square Root (Integral).cpp ├── Sum or Product.cpp └── Terms of AP.cpp ├── Patterns 1 ├── Code : Alpha Pattern.cpp ├── Code : Character Pattern.cpp ├── Code : Interesting Alphabets.cpp ├── Code : Reverse Number Pattern.cpp ├── Code : Square Pattern.cpp ├── Code : Triangle Number Pattern.cpp └── Code : Triangular Star Pattern.cpp ├── Patterns 2 ├── Code : Diamond of stars.cpp ├── Code : Inverted Number Pattern.cpp ├── Code : Mirror Number Pattern.cpp ├── Code : Star Pattern.cpp └── Code : Triangle of Numbers.cpp ├── README.md ├── Test 1 (Milestone 1) ├── Number Star Pattern.cpp ├── Pyramid Number Pattern.cpp └── Second Largest.cpp ├── Test 1(Milestone 3) ├── Does s contain t.cpp ├── Maximum Profit on App.cpp └── Split Array.cpp ├── Test 2 (Milestone 2) ├── Leaders in array.cpp ├── Minimum Length Word.cpp └── Print 2D Array.cpp ├── Test 2 (Milestone 3) ├── Delete Alternate Nodes.cpp ├── Dequeue.cpp └── Next Number.cpp └── Test 3 (Milestone 4) ├── Check cousins.cpp ├── Longest Leaf to root path.cpp └── Remove leaf nodes in Tree.cpp /Assignment: Recursion 1b/Pair Star.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Assignment: Recursion 1b/Pair Star.cpp -------------------------------------------------------------------------------- /Assignment: Recursion 1b/Remove X.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Assignment: Recursion 1b/Remove X.cpp -------------------------------------------------------------------------------- /Assignment: Recursion 1b/Replace pi (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Assignment: Recursion 1b/Replace pi (recursive).cpp -------------------------------------------------------------------------------- /Assignment: Recursion 1b/String to Integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Assignment: Recursion 1b/String to Integer.cpp -------------------------------------------------------------------------------- /Assignment: Recursion 1b/Tower of Hanoi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Assignment: Recursion 1b/Tower of Hanoi.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Check Case.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Check Case.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Fahrenheit to Celsius Table.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Fahrenheit to Celsius Table.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Find power of a number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Find power of a number.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Number Pattern 1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Number Pattern 1.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Number Pattern 2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Number Pattern 2.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Start Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Start Pattern.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Sum of Even Numbers till N.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Sum of Even Numbers till N.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Sum of even & odd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Sum of even & odd.cpp -------------------------------------------------------------------------------- /Conditionals and Loops/Total Salary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Conditionals and Loops/Total Salary.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Check redundant brackets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Check redundant brackets.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Code : Balanced Parenthesis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Code : Balanced Parenthesis.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Code : Queue Using LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Code : Queue Using LL.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Code : Stack Using LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Code : Stack Using LL.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Minimum bracket Reversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Minimum bracket Reversal.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Reverse Queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Reverse Queue.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Reverse a Stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Reverse a Stack.cpp -------------------------------------------------------------------------------- /Lecture 10 : Stacks & Queues/Stock Span.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10 : Stacks & Queues/Stock Span.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Check Palindrome.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Check Palindrome.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Check Permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Check Permutation.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Column Wise Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Column Wise Sum.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Compress the String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Compress the String.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Highest Occuring Character.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Highest Occuring Character.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Largest Row or Column.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Largest Row or Column.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Print All Substrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Print All Substrings.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Remove Consecutive Duplicates.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Remove Consecutive Duplicates.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Remove character.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Remove character.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Replace Character.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Replace Character.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Reverse Each Word.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Reverse Each Word.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Reverse Word Wise.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Reverse Word Wise.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Spiral Print.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Spiral Print.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Trim Spaces.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Trim Spaces.cpp -------------------------------------------------------------------------------- /Lecture 10: Character Arrays and 2D Arrays/Wave Print.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 10: Character Arrays and 2D Arrays/Wave Print.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Code : Count leaf nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Code : Count leaf nodes.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Code : Find height.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Code : Find height.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Code : Find sum of nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Code : Find sum of nodes.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Code : Max data node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Code : Max data node.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Code : PostOrder Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Code : PostOrder Traversal.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Contains x.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Contains x.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Count nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Count nodes.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Next larger.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Next larger.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Node with maximum child sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Node with maximum child sum.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Print Level Wise.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Print Level Wise.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Replace with depth.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Replace with depth.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Second Largest Element In Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Second Largest Element In Tree.cpp -------------------------------------------------------------------------------- /Lecture 11 : Trees/Structurally identical.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 11 : Trees/Structurally identical.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Check Balanced.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Check Balanced.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Code : Find a node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Code : Find a node.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Code : Height of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Code : Height of Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Code : Mirror.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Code : Mirror.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Code: Construct Tree from Preorder and Inorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Code: Construct Tree from Preorder and Inorder.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Construct Tree from Postorder and Inorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Construct Tree from Postorder and Inorder.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Level order traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Level order traversal.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Level wise linkedlist.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Level wise linkedlist.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Min and Max of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Min and Max of Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Nodes without sibling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Nodes without sibling.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Postorder Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Postorder Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Preorder Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Preorder Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Print Level Wise.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Print Level Wise.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Remove Leaf nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Remove Leaf nodes.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/Sum Of Nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/Sum Of Nodes.cpp -------------------------------------------------------------------------------- /Lecture 12 : Binary Trees/ZigZag tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 12 : Binary Trees/ZigZag tree.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Check if a Binary Tree is BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Check if a Binary Tree is BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Code: BST Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Code: BST Class.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Code: BST to Sorted LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Code: BST to Sorted LL.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Code: Construct BST from a Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Code: Construct BST from a Sorted Array.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Code: Print Elements in Range.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Code: Print Elements in Range.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Code: Search in BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Code: Search in BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Create & Insert Duplicate Node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Create & Insert Duplicate Node.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Find Path in BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Find Path in BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/LCA of BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/LCA of BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/LCA of Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/LCA of Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Largest BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Largest BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Pair Sum Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Pair Sum Binary Tree.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Pair sum in a BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Pair sum in a BST.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Path Sum Root to Leaf.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Path Sum Root to Leaf.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Print nodes at distance k from node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Print nodes at distance k from node.cpp -------------------------------------------------------------------------------- /Lecture 13 : BST/Replace with Sum of greater nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 13 : BST/Replace with Sum of greater nodes.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Buy the ticket.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Buy the ticket.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Check Max-Heap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Check Max-Heap.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Code : In-place heap sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Code : In-place heap sort.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Code : K largest elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Code : K largest elements.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Code : K smallest Elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Code : K smallest Elements.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Code : Max Priority Queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Code : Max Priority Queue.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Code : Remove Min.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Code : Remove Min.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Kth largest element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Kth largest element.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Merge K sorted arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Merge K sorted arrays.cpp -------------------------------------------------------------------------------- /Lecture 14 : Priority Queues/Running Median.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 14 : Priority Queues/Running Median.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Code : Maximum Frequency Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Code : Maximum Frequency Number.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Code : Pair Sum to 0.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Code : Pair Sum to 0.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Code : Print Intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Code : Print Intersection.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Extract Unique characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Extract Unique characters.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Longest Consecutive Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Longest Consecutive Sequence.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Longest subarray zero sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Longest subarray zero sum.cpp -------------------------------------------------------------------------------- /Lecture 15 : Hashmaps/Pairs with difference K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 15 : Hashmaps/Pairs with difference K.cpp -------------------------------------------------------------------------------- /Lecture 16 : Tries and Huffman Coding/Auto complete.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 16 : Tries and Huffman Coding/Auto complete.cpp -------------------------------------------------------------------------------- /Lecture 16 : Tries and Huffman Coding/Code : Search in Tries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 16 : Tries and Huffman Coding/Code : Search in Tries.cpp -------------------------------------------------------------------------------- /Lecture 16 : Tries and Huffman Coding/Palindrome Pair.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 16 : Tries and Huffman Coding/Palindrome Pair.cpp -------------------------------------------------------------------------------- /Lecture 16 : Tries and Huffman Coding/Pattern Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 16 : Tries and Huffman Coding/Pattern Matching.cpp -------------------------------------------------------------------------------- /Lecture 17 : Backtracking/Crossword Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 17 : Backtracking/Crossword Problem.cpp -------------------------------------------------------------------------------- /Lecture 17 : Backtracking/N-Queen Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 17 : Backtracking/N-Queen Problem.cpp -------------------------------------------------------------------------------- /Lecture 17 : Backtracking/Rat In A Maze Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 17 : Backtracking/Rat In A Maze Problem.cpp -------------------------------------------------------------------------------- /Lecture 17 : Backtracking/Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 17 : Backtracking/Subset Sum.cpp -------------------------------------------------------------------------------- /Lecture 17 : Backtracking/Sudoku Solver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 17 : Backtracking/Sudoku Solver.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : Min Steps to 1 using DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : Min Steps to 1 using DP.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : Min Steps to 1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : Min Steps to 1.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : Minimum Count.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : Minimum Count.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : No. of balanced BTs using DP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : No. of balanced BTs using DP.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : No. of balanced BTs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : No. of balanced BTs.cpp -------------------------------------------------------------------------------- /Lecture 18 : DP - 1/Code : Staircase using Dp.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 18 : DP - 1/Code : Staircase using Dp.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/All possible ways.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/All possible ways.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Code : Edit Distance (Memoization and DP).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Code : Edit Distance (Memoization and DP).cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Code : Edit Distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Code : Edit Distance.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Code : Knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Code : Knapsack.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Code : Min Cost Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Code : Min Cost Path.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Code: Knapsack (Memoization and DP).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Code: Knapsack (Memoization and DP).cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Coin Tower.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Coin Tower.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Longest Increasing Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Longest Increasing Subsequence.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Loot Houses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Loot Houses.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Matrix Chain Multiplication.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Matrix Chain Multiplication.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Maximum Square Matrix With All Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Maximum Square Matrix With All Zeros.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Shortest Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Shortest Subsequence.cpp -------------------------------------------------------------------------------- /Lecture 19 : DP - 2/Ways To Make Coin Change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 19 : DP - 2/Ways To Make Coin Change.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/3 Cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/3 Cycle.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : All connected components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : All connected components.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : BFS Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : BFS Traversal.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : Get Path - BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : Get Path - BFS.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : Get Path - DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : Get Path - DFS.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : Has Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : Has Path.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Code : Is Connected.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Code : Is Connected.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Coding Ninjas.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Coding Ninjas.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Connecting Dots.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Connecting Dots.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Islands.cpp -------------------------------------------------------------------------------- /Lecture 20 : Graphs 1/Largest Piece.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 20 : Graphs 1/Largest Piece.cpp -------------------------------------------------------------------------------- /Lecture 21 : Graphs 2/Code : Dijkstra's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 21 : Graphs 2/Code : Dijkstra's Algorithm.cpp -------------------------------------------------------------------------------- /Lecture 21 : Graphs 2/Code : Kruskal's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 21 : Graphs 2/Code : Kruskal's Algorithm.cpp -------------------------------------------------------------------------------- /Lecture 21 : Graphs 2/Code : Prim's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 21 : Graphs 2/Code : Prim's Algorithm.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/All Indices of Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/All Indices of Number.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Check Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Check Number.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Check Palindrome (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Check Palindrome (recursive).cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Count Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Count Zeros.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/First Index of Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/First Index of Number.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Geometric Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Geometric Sum.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Last Index of Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Last Index of Number.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Multiplication (Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Multiplication (Recursive).cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Number of Digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Number of Digits.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Power.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Power.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Print Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Print Numbers.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Sum of Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Sum of Array.cpp -------------------------------------------------------------------------------- /Lecture 3: Recursion 1/Sum of digits (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 3: Recursion 1/Sum of digits (recursive).cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Binary Search (Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Binary Search (Recursive).cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Check AB.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Check AB.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Merge Sort Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Merge Sort Code.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Print Keypad Combinations Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Print Keypad Combinations Code.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Print Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Print Permutations.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Print Subset Sum to K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Print Subset Sum to K.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Print Subsets of Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Print Subsets of Array.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Print all Codes - String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Print all Codes - String.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Quick Sort Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Quick Sort Code.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Remove Duplicates Recursively.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Remove Duplicates Recursively.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Replace Character Recursively.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Replace Character Recursively.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Return Keypad Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Return Keypad Code.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Return Permutations - String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Return Permutations - String.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Return all codes - String.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Return all codes - String.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Return subset of an array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Return subset of an array.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Return subsets sum to K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Return subsets sum to K.cpp -------------------------------------------------------------------------------- /Lecture 4: Recursion 2/Staircase.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 4: Recursion 2/Staircase.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Array Intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Array Intersection.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Check Array Rotation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Check Array Rotation.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Duplicate in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Duplicate in array.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Find the Unique Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Find the Unique Element.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Pair sum in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Pair sum in array.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Rotate array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Rotate array.cpp -------------------------------------------------------------------------------- /Lecture 5 : Time and Space Complexity Analysis/Triplet sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 5 : Time and Space Complexity Analysis/Triplet sum.cpp -------------------------------------------------------------------------------- /Lecture 6: OOPS 1/Complex Number Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 6: OOPS 1/Complex Number Class.cpp -------------------------------------------------------------------------------- /Lecture 7: Functions/Fahrenheit to Celsius Table.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 7: Functions/Fahrenheit to Celsius Table.cpp -------------------------------------------------------------------------------- /Lecture 7: Functions/Fibonacci Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 7: Functions/Fibonacci Number.cpp -------------------------------------------------------------------------------- /Lecture 7: OOPS 2/Code : Polynomial Class.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 7: OOPS 2/Code : Polynomial Class.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/AppendLastNToFirst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/AppendLastNToFirst.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Delete node (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Delete node (recursive).cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Delete node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Delete node.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Eliminate duplicates from LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Eliminate duplicates from LL.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Find a Node in Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Find a Node in Linked List.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Insert node (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Insert node (recursive).cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Length of LL (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Length of LL (recursive).cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Length of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Length of LL.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Palindrome LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Palindrome LinkedList.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Print Reverse LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Print Reverse LinkedList.cpp -------------------------------------------------------------------------------- /Lecture 8 : Linked List 1/Print ith node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8 : Linked List 1/Print ith node.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Arrange Numbers in Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Arrange Numbers in Array.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Array Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Array Sum.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Find Duplicate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Find Duplicate.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Find Unique.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Find Unique.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Intersection of Two Arrays II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Intersection of Two Arrays II.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Linear Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Linear Search.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Pair Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Pair Sum.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Sort 0 1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Sort 0 1.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Swap Alternate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Swap Alternate.cpp -------------------------------------------------------------------------------- /Lecture 8: Arrays/Triplet Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 8: Arrays/Triplet Sum.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Bubble Sort (Iterative) LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Bubble Sort (Iterative) LinkedList.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Code : Reverse LL (Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Code : Reverse LL (Recursive).cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Code: Merge Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Code: Merge Sort.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Code: Merge Two Sorted LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Code: Merge Two Sorted LL.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Code: Midpoint of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Code: Midpoint of LL.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Code: Reverse LL (Iterative).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Code: Reverse LL (Iterative).cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Delete every N nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Delete every N nodes.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Even after Odd LinkedList.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Even after Odd LinkedList.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Find a node in LL (recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Find a node in LL (recursive).cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/Swap two Nodes of LL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/Swap two Nodes of LL.cpp -------------------------------------------------------------------------------- /Lecture 9: Linked List 2/kReverse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Linked List 2/kReverse.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Check Array Rotation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Check Array Rotation.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Code Binary Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Code Binary Search.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Code Bubble Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Code Bubble Sort.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Code Insertion Sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Code Insertion Sort.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Code Merge Two Sorted Arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Code Merge Two Sorted Arrays.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Push Zeros to end.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Push Zeros to end.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Rotate array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Rotate array.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Second Largest in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Second Largest in array.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Sort 0 1 2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Sort 0 1 2.cpp -------------------------------------------------------------------------------- /Lecture 9: Searching and Sorting/Sum of Two Arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Lecture 9: Searching and Sorting/Sum of Two Arrays.cpp -------------------------------------------------------------------------------- /Operators and For Loop/All Prime Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/All Prime Numbers.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Binary to decimal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Binary to decimal.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Check Number sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Check Number sequence.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Count Characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Count Characters.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Decimal to Binary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Decimal to Binary.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Nth Fibonacci Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Nth Fibonacci Number.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Reverse of a number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Reverse of a number.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Square Root (Integral).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Square Root (Integral).cpp -------------------------------------------------------------------------------- /Operators and For Loop/Sum or Product.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Sum or Product.cpp -------------------------------------------------------------------------------- /Operators and For Loop/Terms of AP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Operators and For Loop/Terms of AP.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Alpha Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Alpha Pattern.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Character Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Character Pattern.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Interesting Alphabets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Interesting Alphabets.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Reverse Number Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Reverse Number Pattern.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Square Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Square Pattern.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Triangle Number Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Triangle Number Pattern.cpp -------------------------------------------------------------------------------- /Patterns 1/Code : Triangular Star Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 1/Code : Triangular Star Pattern.cpp -------------------------------------------------------------------------------- /Patterns 2/Code : Diamond of stars.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 2/Code : Diamond of stars.cpp -------------------------------------------------------------------------------- /Patterns 2/Code : Inverted Number Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 2/Code : Inverted Number Pattern.cpp -------------------------------------------------------------------------------- /Patterns 2/Code : Mirror Number Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 2/Code : Mirror Number Pattern.cpp -------------------------------------------------------------------------------- /Patterns 2/Code : Star Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 2/Code : Star Pattern.cpp -------------------------------------------------------------------------------- /Patterns 2/Code : Triangle of Numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Patterns 2/Code : Triangle of Numbers.cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/README.md -------------------------------------------------------------------------------- /Test 1 (Milestone 1)/Number Star Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1 (Milestone 1)/Number Star Pattern.cpp -------------------------------------------------------------------------------- /Test 1 (Milestone 1)/Pyramid Number Pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1 (Milestone 1)/Pyramid Number Pattern.cpp -------------------------------------------------------------------------------- /Test 1 (Milestone 1)/Second Largest.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1 (Milestone 1)/Second Largest.cpp -------------------------------------------------------------------------------- /Test 1(Milestone 3)/Does s contain t.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1(Milestone 3)/Does s contain t.cpp -------------------------------------------------------------------------------- /Test 1(Milestone 3)/Maximum Profit on App.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1(Milestone 3)/Maximum Profit on App.cpp -------------------------------------------------------------------------------- /Test 1(Milestone 3)/Split Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 1(Milestone 3)/Split Array.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 2)/Leaders in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 2)/Leaders in array.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 2)/Minimum Length Word.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 2)/Minimum Length Word.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 2)/Print 2D Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 2)/Print 2D Array.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 3)/Delete Alternate Nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 3)/Delete Alternate Nodes.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 3)/Dequeue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 3)/Dequeue.cpp -------------------------------------------------------------------------------- /Test 2 (Milestone 3)/Next Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 2 (Milestone 3)/Next Number.cpp -------------------------------------------------------------------------------- /Test 3 (Milestone 4)/Check cousins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 3 (Milestone 4)/Check cousins.cpp -------------------------------------------------------------------------------- /Test 3 (Milestone 4)/Longest Leaf to root path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 3 (Milestone 4)/Longest Leaf to root path.cpp -------------------------------------------------------------------------------- /Test 3 (Milestone 4)/Remove leaf nodes in Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/rajeevrpandey/Coding-Ninjas-Solutions-CPP/HEAD/Test 3 (Milestone 4)/Remove leaf nodes in Tree.cpp --------------------------------------------------------------------------------