├── Adhoc problems ├── Circular List of Students.cpp ├── Interesting Sequences.cpp ├── Light Up the Bulbs.cpp └── winning strategy.cpp ├── Advanced Graphs ├── AIRPORTS.cpp ├── BOTTOM.cpp ├── Connected horses.cpp ├── Dominos.cpp ├── FILLMTR.cpp ├── Kingdom Of Monkeys.cpp ├── Monk and the Islands.cpp ├── New Year Transportation.cpp ├── Permutation Swaps.cpp └── connected components.cpp ├── Advanced Recursion ├── Merge sort.cpp ├── Print Keypad Combinations Code.cpp ├── Quick sort.cpp ├── Remove Duplicates Recursively.cpp ├── Replace Character Recursively.cpp ├── Return Keypad Code.cpp └── Return Subsequences of string.cpp ├── Applications Of NT - 1 ├── Advanced GCD.cpp ├── Card Game.cpp ├── Divisors Of Factorial.cpp ├── Find The Cube Free Number.cpp ├── Find the good sets.cpp ├── Number Of Factors.cpp ├── Sachin And Varun Problem.cpp └── Strange order.cpp ├── Assignment - Backtracking , Binary Search And Merge Sort Problems ├── Collecting the balls.cpp ├── Find power of a number.cpp ├── Sorting the Skills.cpp └── Sudoku Solver.cpp ├── Backtracking ├── Crossword Problem.cpp ├── N-Queen Problem.cpp ├── Rat In A Maze Problem.cpp └── sudoku.cpp ├── Basics of resursion ├── Number of digits.cpp ├── all indices of number.cpp ├── check number.cpp ├── first index of number.cpp ├── last index of number.cpp ├── power.cpp ├── print numbers.cpp └── sum of array.cpp ├── Binary Tree and Binary Search Tree ├── Averages of Levels in Binary Tree.cpp ├── Binary Tree.cpp ├── Construct the binary tree from inorder and preorder.cpp ├── Serialize and Deserialize The Binary Tree.cpp ├── Tree Views Top Right Left Bottom.cpp └── Tree traversals and height.cpp ├── Bit manipulation ├── CheckEvenOdd.cpp ├── Clear All Bits From MSB.cpp ├── Find first set bit.cpp ├── Set ith bit.cpp ├── Turn off 1st set bit.cpp ├── Unset ith bit.cpp ├── clearLSBbits.cpp ├── flip_ith_bit.cpp └── powerof2.cpp ├── Commonly Asked Problems Practice ├── Arrays : Minimum number of increment-other operations to make all array elements equal.cpp ├── Backtracking : M - Coloring problem.cpp ├── Backtracking : Permutations.cpp ├── Backtracking : Rat in maze.cpp ├── Backtracking and DP : count number of subsets with given sum.cpp ├── Binary Search : Search in Rotated Sorted Array.cpp ├── Binary Search : Find Minimum in Rotated Sorted Array.cpp ├── Binary Search : Find Smallest Letter Greater Than Target.cpp ├── Binary Search : Find minimum absolute difference in sorted array.cpp ├── Binary Search : Floor in a Sorted Array.cpp ├── Binary Search : K-th element of two sorted Arrays.cpp ├── Binary Search : Meeting rooms.cpp ├── Binary Search : Search in an almost sorted array.cpp ├── Binary search : Allocate minimum number of pages .cpp ├── Binary search : Find Nth root of M.cpp ├── Binary search : Find maximum element in Bitonic Array.cpp ├── Binary search : Minimum removals from array to make max – min <= K.cpp ├── Contruct Height balanced BST from sorted array.cpp ├── Count Binary Substrings.cpp ├── Count number of binary strings without consecutive 1’s.cpp ├── DP : Coin game winner where every player has three choices.cpp ├── DP : Partition Equal Subset Sum.cpp ├── Dp : number of subsequences having product smaller than or equal to K..cpp ├── Dp : Count common subsequence in two strings.cpp ├── Dp : Count of subsets with sum equal to X.cpp ├── Dp : Edit distance.cpp ├── Dp : Egg dropping problem.cpp ├── Dp : Largest Rectangle in Histogram.cpp ├── Dp : Longest Common Subsequence.cpp ├── Dp : Longest Palindromic Subsequence.cpp ├── Dp : Longest repeating subsequence.cpp ├── Dp : MCM.cpp ├── Dp : Maximum Sum Circular Subarray.cpp ├── Dp : Maximum subsequence sum such that no three are consecutive.cpp ├── Dp : Maximum sum Increasing subsequence.cpp ├── Dp : Minimum Difference Subsets.cpp ├── Dp : Minimum number of deletions OR insertions to make a string palindrome.cpp ├── Dp : Number of ways to make coin change.cpp ├── Dp : Painting the Fence.cpp ├── Dp : Regular Expression Matching.cpp ├── Dp : Rod cutting problem.cpp ├── Dp : Russian Doll Envelopes.cpp ├── Dp : Shortest Common Supersequence.cpp ├── Dp : Subset Sum Problem.cpp ├── Dp : Trapping Rain Water.cpp ├── Dp : Uncrossed Lines.cpp ├── Dp : Unique paths in a Grid with Obstacles.cpp ├── Dp : Wildcard Matching.cpp ├── Dp : Word Wrap.cpp ├── Dp : count number subsets S1 and S2 with given given difference.cpp ├── Geometry : Minimum distance from a point to the line segment.cpp ├── Graphs : Number of Operations to Make Network Connected.cpp ├── Graphs : Alien Dictionary ( Topo sort ).cpp ├── Graphs : BFS - Snake and Ladder.cpp ├── Graphs : Cheapest Flights Within K Stops.cpp ├── Graphs : Critical Connections in a Network.cpp ├── Graphs : Cycle detection in directed graph.cpp ├── Graphs : Cycle detection in undirected graph.cpp ├── Graphs : Dijkstras single source shortest path.cpp ├── Graphs : Find the celebrity.cpp ├── Graphs : Minimum time taken by each job to be completed given by a Directed Acyclic Graph.cpp ├── Graphs : Network Delay Time.cpp ├── Graphs : Number of islands.cpp ├── Graphs : Prims algorithm for MST.cpp ├── Graphs : Rotting Oranges.cpp ├── Graphs : Strongly connected components in graph (kosaraju algo).cpp ├── Graphs : course schedule 2 .cpp ├── Graphs : topological sorting.cpp ├── Graphs : words ladder.cpp ├── Greedy : Job sequencing.cpp ├── Greedy : Maximum trains for which stoppage can be provided.cpp ├── HashMap Implementation.cpp ├── Hashmaps : Count subarrays with Given XOR.cpp ├── Hashmaps : Largest subarray with 0 sum.cpp ├── Heap : Sort a nearly sorted (or K sorted) array.cpp ├── LRU Cache Implementation O(1) .cpp ├── LRU Cache Implementation O(n) .cpp ├── Largest subarray with equal number of 0s and 1s.cpp ├── Linked List : Flattening a Linked List.cpp ├── Linked List Cycle detection approach : Find the Duplicate Number.cpp ├── Majority Element II.cpp ├── Maximum points on straight line.cpp ├── Merge Sort : Count inversion.cpp ├── Merge Without Extra Space.cpp ├── Minimum cost to cover the given positions in a N*M grid.cpp ├── Minimum cost to make string valid.cpp ├── Minimum number of coins to make change to amount.cpp ├── Minimum operations to make strings equal.cpp ├── Moores : Majority Element.cpp ├── Next Greater Element.cpp ├── Optimal Strategy for a Game.cpp ├── Priority Queue : Min Heap Implementation.cpp ├── Queue : Double ended queue.cpp ├── Queue : implementation using array.cpp ├── Queue Using Two Stacks.cpp ├── Recursion : Return all susequences of string.cpp ├── Return Keypad Code.cpp ├── Search In Rotated Sorted Array.cpp ├── Sliding window : First negative integer in every window of size k.cpp ├── Sliding window : Longest K unique characters substring.cpp ├── Sliding window : Longest Substring Without Repeating Characters.cpp ├── Sliding window : Max Sum Subarray of size K .cpp ├── Sliding window : Minimum Window Substring.cpp ├── Sort Stack Recursively.cpp ├── Sorting : Merge sort.cpp ├── Sorting : Quicksort.cpp ├── Stack : Largest Rectangle in Histogram.cpp ├── Stack : Merge Intervals leetcode.cpp ├── Stack : Online Stock Span.cpp ├── Stack : Stack using single queue.cpp ├── String : Partition Labels.cpp ├── Strings : Minimum Swaps for Bracket Balancing.cpp ├── Strings : Rabin carp (string matching).cpp ├── Subsets.cpp ├── Trees : Check Identical and Mirror trees.cpp ├── Trees : Convert Binary tree to BST.cpp ├── Trees : Convert a given tree to its Sum Tree.cpp ├── Trees : Largest BST in Binary Tree.cpp ├── Trees : Left view of binary tree.cpp ├── Trees : Minimal Tree ( construct BST ) .cpp ├── Trees : Predecessor and Successor.cpp ├── Trees : sum of all elements in leaf nodes.cpp ├── Treess : Convert Binary Tree to DLL.cpp └── Trie : Implement Trie (Prefix Tree).cpp ├── Computational Geometry ├── Area Of Convex Polygon.cpp ├── Convex Hull.cpp ├── Surveyor.cpp └── Warehouse.cpp ├── DP & Bitmasking ├── Candy.cpp ├── Counting Strings.cpp ├── Dilemma.cpp ├── Ghost Type.cpp ├── Mehta And Bank Robbery.cpp ├── N jobs Bitmask.cpp ├── Number of APs.cpp └── String Maker.cpp ├── Dynamic Programming - 1 ├── Adjacent Bit Counts.cpp ├── AlphaCode-Question.cpp ├── Alyona and Spreadsheet.cpp ├── Angry Children.cpp ├── Boredom.cpp ├── Coin Change Problem.cpp ├── Count BSTs.cpp ├── Hasan and Trip.cpp ├── Jon Snow and his favourite number.cpp ├── Largest Bitonic Subarray.cpp ├── Longest Increasing subsequence.cpp ├── Loot Houses.cpp ├── Magic Grid Problem.cpp ├── Maximum Square Matrix With All Zeros.cpp ├── Maximum Sum Rectangle.cpp ├── Minimum Count.cpp ├── Minimum Number of Chocolates.cpp ├── Roy and Coin Boxes.cpp ├── StairCase Problem.cpp ├── Vanya and GCD.cpp ├── mincost.cpp └── sam ans substring.cpp ├── Dynamic Programming - 2 ├── Balika Vadhu- Problem.cpp ├── Charlie and Pilots.cpp ├── Distinct Subsequences.cpp ├── Edit Distance - Problem.cpp ├── Knapsnack - Problem.cpp ├── LCS - Problem.cpp ├── Miser Man.cpp ├── PARTY - Problem.cpp ├── Shortest Subsequence.cpp ├── Smallest Super-Sequence.cpp ├── Square Brackets.cpp ├── Subset Sum - Problem.cpp └── Trader Profit.cpp ├── FFT └── FFT.cpp ├── Fenwick Tree ├── Coder's Rating.cpp ├── Distinct Query Problem.cpp ├── Fenwick Tree Demo Sum.cpp ├── INCSEQ.cpp ├── KQUERY.cpp ├── OrderSet - Problem.cpp └── Shil and Wave Sequence.cpp ├── Game Theory ├── Calculate Grundy Number.cpp └── Optimal Move In Tic Tac Toe.cpp ├── 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 ├── Graph BFS and DFS.cpp ├── Islands.cpp ├── Largest Piece.cpp └── Lowest Common Ancestor.cpp ├── Graphs 2 ├── Dijkstra's Algorithm.cpp ├── Floyd Warshall Algorithm .cpp ├── Kruskal's Algorithm.cpp ├── Prim's Algorithm.cpp └── Union find algorithm to detect cycle in graph.cpp ├── Greedy Problems ├── Activity Selection.cpp ├── Fractional Knapsack ( original ).cpp ├── Fractional Knapsack.cpp ├── Gold Robbry.cpp ├── Min. Absolute Difference In Array.cpp ├── Nikunj and Donuts.cpp ├── Perimeter with conditions.cpp ├── Problem discussion.cpp ├── Save Energy.cpp ├── Weighted Job Scheduling.cpp ├── Winning Lottery.cpp └── original fractional knapsack.cpp ├── Langauage tools ├── Exercise - Different names.cpp ├── Exercise - Extract unique characters.cpp ├── Exercise - Love for characters.cpp ├── Exercise - tell the positions.cpp ├── Exercise - warm reception.cpp ├── Permutation and Palindrome.cpp ├── STL functions.cpp ├── STL.cpp ├── char frequency.cpp ├── codechef - hussainset.cpp ├── remove duplicates.cpp └── voterslist.cpp ├── Language Tools + Time and Complexity Assignment ├── Duplicate in array.cpp ├── Find unique element.cpp ├── Longest consecutive sequence.cpp ├── Rotate array.cpp ├── Triplet sum.cpp ├── pair sum to 0.cpp └── sum me up.cpp ├── Linked List ├── Find the middle of a given linked list.cpp └── single linked list.cpp ├── Modulo arithmetic └── Number Of Balanced BTs.cpp ├── Number Theory - 1 ├── Extended Euclid algorithm.cpp ├── Find Prime Numbers From 1 to N(sieve of eratosthenes).cpp ├── GCD(euclid).cpp ├── multiplicative modulo inverse.cpp └── return count of prime numbers.cpp ├── Number Theory - 2 ├── Euler Totient.cpp ├── LCM SUM.cpp └── Segmented Sieve Problem.cpp ├── Number Theory - 3 ├── Boring Factorials.cpp ├── Cubic Square.cpp ├── Fibonacci Sum.cpp ├── GCD Extreme.cpp ├── Income On Nth Day.cpp ├── Innocent Swaps and His Emotions.cpp ├── Sanchit And Nuclear Reactor.cpp ├── Sehwag And ETF.cpp └── modular-exponentiation.cpp ├── Pre-requisites ├── Even and Odd Indexes.cpp ├── Matrix Diagonal and Boundaries sum.cpp ├── PRE4.cpp ├── Target Marbles.cpp └── chakri.cpp ├── Searching & Sorting Applications ├── Aggressive Cows Problem.cpp ├── Binary Search.cpp ├── Distribute Candies.cpp ├── Inversion Count.cpp ├── Momos shop.cpp ├── Murder.cpp └── variation.cpp ├── Segment Tree ├── 2 vs 3.cpp ├── Counting Even or Odd.cpp ├── Horrible Queries.cpp ├── Lazy propogation demo.cpp ├── Maximum Pair Sum.cpp ├── Maximum Sum In Subarray.cpp ├── Minimum In SubArray.cpp ├── Vasya vs Rhezo.cpp └── sum segment tree demo.cpp ├── String Algorithms ├── Brute Force String Matching.cpp ├── KMP.cpp ├── Longest Palindrome Substring.cpp ├── Longest prefix suffix code.cpp ├── Palindromic Substrings.cpp ├── String Search.cpp └── Z-algorithm.cpp ├── Time and Space complexity ├── k-concatenation.cpp ├── kadane.cpp ├── max product subarray.cpp └── mind bending.cpp ├── Tries ├── Help Me Pradyumana!.cpp ├── Max XOR pair.cpp ├── Maximum XOR Subarray.cpp ├── SUBXOR.cpp └── Search Engine.cpp └── pointers ├── Reference and pass by reference.cpp ├── datatype and pointer sizes.cpp └── pointers.pdf /Adhoc problems/Circular List of Students.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Adhoc problems/Circular List of Students.cpp -------------------------------------------------------------------------------- /Adhoc problems/Interesting Sequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Adhoc problems/Interesting Sequences.cpp -------------------------------------------------------------------------------- /Adhoc problems/Light Up the Bulbs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Adhoc problems/Light Up the Bulbs.cpp -------------------------------------------------------------------------------- /Adhoc problems/winning strategy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Adhoc problems/winning strategy.cpp -------------------------------------------------------------------------------- /Advanced Graphs/AIRPORTS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/AIRPORTS.cpp -------------------------------------------------------------------------------- /Advanced Graphs/BOTTOM.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/BOTTOM.cpp -------------------------------------------------------------------------------- /Advanced Graphs/Connected horses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/Connected horses.cpp -------------------------------------------------------------------------------- /Advanced Graphs/Dominos.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/Dominos.cpp -------------------------------------------------------------------------------- /Advanced Graphs/FILLMTR.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/FILLMTR.cpp -------------------------------------------------------------------------------- /Advanced Graphs/Kingdom Of Monkeys.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/Kingdom Of Monkeys.cpp -------------------------------------------------------------------------------- /Advanced Graphs/Monk and the Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/Monk and the Islands.cpp -------------------------------------------------------------------------------- /Advanced Graphs/New Year Transportation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/New Year Transportation.cpp -------------------------------------------------------------------------------- /Advanced Graphs/Permutation Swaps.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/Permutation Swaps.cpp -------------------------------------------------------------------------------- /Advanced Graphs/connected components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Graphs/connected components.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Merge sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Merge sort.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Print Keypad Combinations Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Print Keypad Combinations Code.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Quick sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Quick sort.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Remove Duplicates Recursively.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Remove Duplicates Recursively.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Replace Character Recursively.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Replace Character Recursively.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Return Keypad Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Return Keypad Code.cpp -------------------------------------------------------------------------------- /Advanced Recursion/Return Subsequences of string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Advanced Recursion/Return Subsequences of string.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Advanced GCD.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Advanced GCD.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Card Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Card Game.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Divisors Of Factorial.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Divisors Of Factorial.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Find The Cube Free Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Find The Cube Free Number.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Find the good sets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Find the good sets.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Number Of Factors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Number Of Factors.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Sachin And Varun Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Sachin And Varun Problem.cpp -------------------------------------------------------------------------------- /Applications Of NT - 1/Strange order.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Applications Of NT - 1/Strange order.cpp -------------------------------------------------------------------------------- /Assignment - Backtracking , Binary Search And Merge Sort Problems/Collecting the balls.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Assignment - Backtracking , Binary Search And Merge Sort Problems/Collecting the balls.cpp -------------------------------------------------------------------------------- /Assignment - Backtracking , Binary Search And Merge Sort Problems/Find power of a number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Assignment - Backtracking , Binary Search And Merge Sort Problems/Find power of a number.cpp -------------------------------------------------------------------------------- /Assignment - Backtracking , Binary Search And Merge Sort Problems/Sorting the Skills.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Assignment - Backtracking , Binary Search And Merge Sort Problems/Sorting the Skills.cpp -------------------------------------------------------------------------------- /Assignment - Backtracking , Binary Search And Merge Sort Problems/Sudoku Solver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Assignment - Backtracking , Binary Search And Merge Sort Problems/Sudoku Solver.cpp -------------------------------------------------------------------------------- /Backtracking/Crossword Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Backtracking/Crossword Problem.cpp -------------------------------------------------------------------------------- /Backtracking/N-Queen Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Backtracking/N-Queen Problem.cpp -------------------------------------------------------------------------------- /Backtracking/Rat In A Maze Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Backtracking/Rat In A Maze Problem.cpp -------------------------------------------------------------------------------- /Backtracking/sudoku.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Backtracking/sudoku.cpp -------------------------------------------------------------------------------- /Basics of resursion/Number of digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/Number of digits.cpp -------------------------------------------------------------------------------- /Basics of resursion/all indices of number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/all indices of number.cpp -------------------------------------------------------------------------------- /Basics of resursion/check number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/check number.cpp -------------------------------------------------------------------------------- /Basics of resursion/first index of number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/first index of number.cpp -------------------------------------------------------------------------------- /Basics of resursion/last index of number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/last index of number.cpp -------------------------------------------------------------------------------- /Basics of resursion/power.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/power.cpp -------------------------------------------------------------------------------- /Basics of resursion/print numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/print numbers.cpp -------------------------------------------------------------------------------- /Basics of resursion/sum of array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Basics of resursion/sum of array.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Averages of Levels in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Averages of Levels in Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Construct the binary tree from inorder and preorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Construct the binary tree from inorder and preorder.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Serialize and Deserialize The Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Serialize and Deserialize The Binary Tree.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Tree Views Top Right Left Bottom.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Tree Views Top Right Left Bottom.cpp -------------------------------------------------------------------------------- /Binary Tree and Binary Search Tree/Tree traversals and height.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Binary Tree and Binary Search Tree/Tree traversals and height.cpp -------------------------------------------------------------------------------- /Bit manipulation/CheckEvenOdd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/CheckEvenOdd.cpp -------------------------------------------------------------------------------- /Bit manipulation/Clear All Bits From MSB.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/Clear All Bits From MSB.cpp -------------------------------------------------------------------------------- /Bit manipulation/Find first set bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/Find first set bit.cpp -------------------------------------------------------------------------------- /Bit manipulation/Set ith bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/Set ith bit.cpp -------------------------------------------------------------------------------- /Bit manipulation/Turn off 1st set bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/Turn off 1st set bit.cpp -------------------------------------------------------------------------------- /Bit manipulation/Unset ith bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/Unset ith bit.cpp -------------------------------------------------------------------------------- /Bit manipulation/clearLSBbits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/clearLSBbits.cpp -------------------------------------------------------------------------------- /Bit manipulation/flip_ith_bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/flip_ith_bit.cpp -------------------------------------------------------------------------------- /Bit manipulation/powerof2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Bit manipulation/powerof2.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Arrays : Minimum number of increment-other operations to make all array elements equal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Arrays : Minimum number of increment-other operations to make all array elements equal.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Backtracking : M - Coloring problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Backtracking : M - Coloring problem.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Backtracking : Permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Backtracking : Permutations.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Backtracking : Rat in maze.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Backtracking : Rat in maze.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Backtracking and DP : count number of subsets with given sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Backtracking and DP : count number of subsets with given sum.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Search in Rotated Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Search in Rotated Sorted Array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Find Minimum in Rotated Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Find Minimum in Rotated Sorted Array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Find Smallest Letter Greater Than Target.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Find Smallest Letter Greater Than Target.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Find minimum absolute difference in sorted array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Find minimum absolute difference in sorted array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Floor in a Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Floor in a Sorted Array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : K-th element of two sorted Arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : K-th element of two sorted Arrays.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Meeting rooms.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Meeting rooms.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary Search : Search in an almost sorted array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary Search : Search in an almost sorted array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary search : Allocate minimum number of pages .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary search : Allocate minimum number of pages .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary search : Find Nth root of M.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary search : Find Nth root of M.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary search : Find maximum element in Bitonic Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary search : Find maximum element in Bitonic Array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Binary search : Minimum removals from array to make max – min <= K.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Binary search : Minimum removals from array to make max – min <= K.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Contruct Height balanced BST from sorted array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Contruct Height balanced BST from sorted array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Count Binary Substrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Count Binary Substrings.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Count number of binary strings without consecutive 1’s.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Count number of binary strings without consecutive 1’s.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/DP : Coin game winner where every player has three choices.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/DP : Coin game winner where every player has three choices.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/DP : Partition Equal Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/DP : Partition Equal Subset Sum.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : number of subsequences having product smaller than or equal to K..cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : number of subsequences having product smaller than or equal to K..cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Count common subsequence in two strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Count common subsequence in two strings.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Count of subsets with sum equal to X.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Count of subsets with sum equal to X.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Edit distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Edit distance.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Egg dropping problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Egg dropping problem.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Largest Rectangle in Histogram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Largest Rectangle in Histogram.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Longest Common Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Longest Common Subsequence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Longest Palindromic Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Longest Palindromic Subsequence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Longest repeating subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Longest repeating subsequence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : MCM.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : MCM.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Maximum Sum Circular Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Maximum Sum Circular Subarray.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Maximum subsequence sum such that no three are consecutive.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Maximum subsequence sum such that no three are consecutive.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Maximum sum Increasing subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Maximum sum Increasing subsequence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Minimum Difference Subsets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Minimum Difference Subsets.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Minimum number of deletions OR insertions to make a string palindrome.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Minimum number of deletions OR insertions to make a string palindrome.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Number of ways to make coin change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Number of ways to make coin change.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Painting the Fence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Painting the Fence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Regular Expression Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Regular Expression Matching.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Rod cutting problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Rod cutting problem.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Russian Doll Envelopes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Russian Doll Envelopes.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Shortest Common Supersequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Shortest Common Supersequence.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Subset Sum Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Subset Sum Problem.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Trapping Rain Water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Trapping Rain Water.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Uncrossed Lines.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Uncrossed Lines.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Unique paths in a Grid with Obstacles.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Unique paths in a Grid with Obstacles.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Wildcard Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Wildcard Matching.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : Word Wrap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : Word Wrap.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Dp : count number subsets S1 and S2 with given given difference.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Dp : count number subsets S1 and S2 with given given difference.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Geometry : Minimum distance from a point to the line segment.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Geometry : Minimum distance from a point to the line segment.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Number of Operations to Make Network Connected.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Number of Operations to Make Network Connected.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Alien Dictionary ( Topo sort ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Alien Dictionary ( Topo sort ).cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : BFS - Snake and Ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : BFS - Snake and Ladder.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Cheapest Flights Within K Stops.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Cheapest Flights Within K Stops.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Critical Connections in a Network.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Critical Connections in a Network.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Cycle detection in directed graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Cycle detection in directed graph.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Cycle detection in undirected graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Cycle detection in undirected graph.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Dijkstras single source shortest path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Dijkstras single source shortest path.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Find the celebrity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Find the celebrity.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Minimum time taken by each job to be completed given by a Directed Acyclic Graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Minimum time taken by each job to be completed given by a Directed Acyclic Graph.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Network Delay Time.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Network Delay Time.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Number of islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Number of islands.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Prims algorithm for MST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Prims algorithm for MST.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Rotting Oranges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Rotting Oranges.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : Strongly connected components in graph (kosaraju algo).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : Strongly connected components in graph (kosaraju algo).cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : course schedule 2 .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : course schedule 2 .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : topological sorting.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : topological sorting.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Graphs : words ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Graphs : words ladder.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Greedy : Job sequencing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Greedy : Job sequencing.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Greedy : Maximum trains for which stoppage can be provided.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Greedy : Maximum trains for which stoppage can be provided.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/HashMap Implementation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/HashMap Implementation.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Hashmaps : Count subarrays with Given XOR.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Hashmaps : Count subarrays with Given XOR.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Hashmaps : Largest subarray with 0 sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Hashmaps : Largest subarray with 0 sum.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Heap : Sort a nearly sorted (or K sorted) array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Heap : Sort a nearly sorted (or K sorted) array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/LRU Cache Implementation O(1) .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/LRU Cache Implementation O(1) .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/LRU Cache Implementation O(n) .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/LRU Cache Implementation O(n) .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Largest subarray with equal number of 0s and 1s.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Largest subarray with equal number of 0s and 1s.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Linked List : Flattening a Linked List.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Linked List : Flattening a Linked List.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Linked List Cycle detection approach : Find the Duplicate Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Linked List Cycle detection approach : Find the Duplicate Number.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Majority Element II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Majority Element II.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Maximum points on straight line.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Maximum points on straight line.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Merge Sort : Count inversion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Merge Sort : Count inversion.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Merge Without Extra Space.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Merge Without Extra Space.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Minimum cost to cover the given positions in a N*M grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Minimum cost to cover the given positions in a N*M grid.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Minimum cost to make string valid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Minimum cost to make string valid.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Minimum number of coins to make change to amount.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Minimum number of coins to make change to amount.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Minimum operations to make strings equal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Minimum operations to make strings equal.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Moores : Majority Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Moores : Majority Element.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Next Greater Element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Next Greater Element.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Optimal Strategy for a Game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Optimal Strategy for a Game.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Priority Queue : Min Heap Implementation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Priority Queue : Min Heap Implementation.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Queue : Double ended queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Queue : Double ended queue.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Queue : implementation using array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Queue : implementation using array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Queue Using Two Stacks.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Queue Using Two Stacks.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Recursion : Return all susequences of string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Recursion : Return all susequences of string.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Return Keypad Code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Return Keypad Code.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Search In Rotated Sorted Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Search In Rotated Sorted Array.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sliding window : First negative integer in every window of size k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sliding window : First negative integer in every window of size k.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sliding window : Longest K unique characters substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sliding window : Longest K unique characters substring.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sliding window : Longest Substring Without Repeating Characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sliding window : Longest Substring Without Repeating Characters.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sliding window : Max Sum Subarray of size K .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sliding window : Max Sum Subarray of size K .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sliding window : Minimum Window Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sliding window : Minimum Window Substring.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sort Stack Recursively.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sort Stack Recursively.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sorting : Merge sort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sorting : Merge sort.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Sorting : Quicksort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Sorting : Quicksort.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Stack : Largest Rectangle in Histogram.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Stack : Largest Rectangle in Histogram.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Stack : Merge Intervals leetcode.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Stack : Merge Intervals leetcode.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Stack : Online Stock Span.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Stack : Online Stock Span.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Stack : Stack using single queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Stack : Stack using single queue.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/String : Partition Labels.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/String : Partition Labels.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Strings : Minimum Swaps for Bracket Balancing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Strings : Minimum Swaps for Bracket Balancing.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Strings : Rabin carp (string matching).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Strings : Rabin carp (string matching).cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Subsets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Subsets.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Check Identical and Mirror trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Check Identical and Mirror trees.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Convert Binary tree to BST.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Convert Binary tree to BST.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Convert a given tree to its Sum Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Convert a given tree to its Sum Tree.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Largest BST in Binary Tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Largest BST in Binary Tree.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Left view of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Left view of binary tree.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Minimal Tree ( construct BST ) .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Minimal Tree ( construct BST ) .cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : Predecessor and Successor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : Predecessor and Successor.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trees : sum of all elements in leaf nodes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trees : sum of all elements in leaf nodes.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Treess : Convert Binary Tree to DLL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Treess : Convert Binary Tree to DLL.cpp -------------------------------------------------------------------------------- /Commonly Asked Problems Practice/Trie : Implement Trie (Prefix Tree).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Commonly Asked Problems Practice/Trie : Implement Trie (Prefix Tree).cpp -------------------------------------------------------------------------------- /Computational Geometry/Area Of Convex Polygon.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Computational Geometry/Area Of Convex Polygon.cpp -------------------------------------------------------------------------------- /Computational Geometry/Convex Hull.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Computational Geometry/Convex Hull.cpp -------------------------------------------------------------------------------- /Computational Geometry/Surveyor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Computational Geometry/Surveyor.cpp -------------------------------------------------------------------------------- /Computational Geometry/Warehouse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Computational Geometry/Warehouse.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Candy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Candy.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Counting Strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Counting Strings.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Dilemma.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Dilemma.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Ghost Type.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Ghost Type.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Mehta And Bank Robbery.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Mehta And Bank Robbery.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/N jobs Bitmask.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/N jobs Bitmask.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/Number of APs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/Number of APs.cpp -------------------------------------------------------------------------------- /DP & Bitmasking/String Maker.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/DP & Bitmasking/String Maker.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Adjacent Bit Counts.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Adjacent Bit Counts.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/AlphaCode-Question.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/AlphaCode-Question.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Alyona and Spreadsheet.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Alyona and Spreadsheet.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Angry Children.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Angry Children.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Boredom.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Boredom.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Coin Change Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Coin Change Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Count BSTs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Count BSTs.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Hasan and Trip.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Hasan and Trip.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Jon Snow and his favourite number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Jon Snow and his favourite number.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Largest Bitonic Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Largest Bitonic Subarray.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Longest Increasing subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Longest Increasing subsequence.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Loot Houses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Loot Houses.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Magic Grid Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Magic Grid Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Maximum Square Matrix With All Zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Maximum Square Matrix With All Zeros.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Maximum Sum Rectangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Maximum Sum Rectangle.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Minimum Count.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Minimum Count.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Minimum Number of Chocolates.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Minimum Number of Chocolates.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Roy and Coin Boxes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Roy and Coin Boxes.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/StairCase Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/StairCase Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/Vanya and GCD.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/Vanya and GCD.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/mincost.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/mincost.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 1/sam ans substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 1/sam ans substring.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Balika Vadhu- Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Balika Vadhu- Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Charlie and Pilots.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Charlie and Pilots.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Distinct Subsequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Distinct Subsequences.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Edit Distance - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Edit Distance - Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Knapsnack - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Knapsnack - Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/LCS - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/LCS - Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Miser Man.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Miser Man.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/PARTY - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/PARTY - Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Shortest Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Shortest Subsequence.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Smallest Super-Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Smallest Super-Sequence.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Square Brackets.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Square Brackets.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Subset Sum - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Subset Sum - Problem.cpp -------------------------------------------------------------------------------- /Dynamic Programming - 2/Trader Profit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Dynamic Programming - 2/Trader Profit.cpp -------------------------------------------------------------------------------- /FFT/FFT.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/FFT/FFT.cpp -------------------------------------------------------------------------------- /Fenwick Tree/Coder's Rating.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/Coder's Rating.cpp -------------------------------------------------------------------------------- /Fenwick Tree/Distinct Query Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/Distinct Query Problem.cpp -------------------------------------------------------------------------------- /Fenwick Tree/Fenwick Tree Demo Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/Fenwick Tree Demo Sum.cpp -------------------------------------------------------------------------------- /Fenwick Tree/INCSEQ.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/INCSEQ.cpp -------------------------------------------------------------------------------- /Fenwick Tree/KQUERY.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/KQUERY.cpp -------------------------------------------------------------------------------- /Fenwick Tree/OrderSet - Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/OrderSet - Problem.cpp -------------------------------------------------------------------------------- /Fenwick Tree/Shil and Wave Sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Fenwick Tree/Shil and Wave Sequence.cpp -------------------------------------------------------------------------------- /Game Theory/Calculate Grundy Number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Game Theory/Calculate Grundy Number.cpp -------------------------------------------------------------------------------- /Game Theory/Optimal Move In Tic Tac Toe.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Game Theory/Optimal Move In Tic Tac Toe.cpp -------------------------------------------------------------------------------- /Graphs 1/3 Cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/3 Cycle.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : All connected components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : All connected components.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : BFS Traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : BFS Traversal.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : Get Path - BFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : Get Path - BFS.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : Get Path - DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : Get Path - DFS.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : Has Path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : Has Path.cpp -------------------------------------------------------------------------------- /Graphs 1/Code : Is Connected.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Code : Is Connected.cpp -------------------------------------------------------------------------------- /Graphs 1/Coding Ninjas.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Coding Ninjas.cpp -------------------------------------------------------------------------------- /Graphs 1/Connecting Dots.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Connecting Dots.cpp -------------------------------------------------------------------------------- /Graphs 1/Graph BFS and DFS.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Graph BFS and DFS.cpp -------------------------------------------------------------------------------- /Graphs 1/Islands.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Islands.cpp -------------------------------------------------------------------------------- /Graphs 1/Largest Piece.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Largest Piece.cpp -------------------------------------------------------------------------------- /Graphs 1/Lowest Common Ancestor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 1/Lowest Common Ancestor.cpp -------------------------------------------------------------------------------- /Graphs 2/Dijkstra's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 2/Dijkstra's Algorithm.cpp -------------------------------------------------------------------------------- /Graphs 2/Floyd Warshall Algorithm .cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 2/Floyd Warshall Algorithm .cpp -------------------------------------------------------------------------------- /Graphs 2/Kruskal's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 2/Kruskal's Algorithm.cpp -------------------------------------------------------------------------------- /Graphs 2/Prim's Algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 2/Prim's Algorithm.cpp -------------------------------------------------------------------------------- /Graphs 2/Union find algorithm to detect cycle in graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Graphs 2/Union find algorithm to detect cycle in graph.cpp -------------------------------------------------------------------------------- /Greedy Problems/Activity Selection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Activity Selection.cpp -------------------------------------------------------------------------------- /Greedy Problems/Fractional Knapsack ( original ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Fractional Knapsack ( original ).cpp -------------------------------------------------------------------------------- /Greedy Problems/Fractional Knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Fractional Knapsack.cpp -------------------------------------------------------------------------------- /Greedy Problems/Gold Robbry.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Gold Robbry.cpp -------------------------------------------------------------------------------- /Greedy Problems/Min. Absolute Difference In Array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Min. Absolute Difference In Array.cpp -------------------------------------------------------------------------------- /Greedy Problems/Nikunj and Donuts.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Nikunj and Donuts.cpp -------------------------------------------------------------------------------- /Greedy Problems/Perimeter with conditions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Perimeter with conditions.cpp -------------------------------------------------------------------------------- /Greedy Problems/Problem discussion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Problem discussion.cpp -------------------------------------------------------------------------------- /Greedy Problems/Save Energy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Save Energy.cpp -------------------------------------------------------------------------------- /Greedy Problems/Weighted Job Scheduling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Weighted Job Scheduling.cpp -------------------------------------------------------------------------------- /Greedy Problems/Winning Lottery.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/Winning Lottery.cpp -------------------------------------------------------------------------------- /Greedy Problems/original fractional knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Greedy Problems/original fractional knapsack.cpp -------------------------------------------------------------------------------- /Langauage tools/Exercise - Different names.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Exercise - Different names.cpp -------------------------------------------------------------------------------- /Langauage tools/Exercise - Extract unique characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Exercise - Extract unique characters.cpp -------------------------------------------------------------------------------- /Langauage tools/Exercise - Love for characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Exercise - Love for characters.cpp -------------------------------------------------------------------------------- /Langauage tools/Exercise - tell the positions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Exercise - tell the positions.cpp -------------------------------------------------------------------------------- /Langauage tools/Exercise - warm reception.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Exercise - warm reception.cpp -------------------------------------------------------------------------------- /Langauage tools/Permutation and Palindrome.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/Permutation and Palindrome.cpp -------------------------------------------------------------------------------- /Langauage tools/STL functions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/STL functions.cpp -------------------------------------------------------------------------------- /Langauage tools/STL.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/STL.cpp -------------------------------------------------------------------------------- /Langauage tools/char frequency.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/char frequency.cpp -------------------------------------------------------------------------------- /Langauage tools/codechef - hussainset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/codechef - hussainset.cpp -------------------------------------------------------------------------------- /Langauage tools/remove duplicates.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/remove duplicates.cpp -------------------------------------------------------------------------------- /Langauage tools/voterslist.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Langauage tools/voterslist.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/Duplicate in array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/Duplicate in array.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/Find unique element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/Find unique element.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/Longest consecutive sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/Longest consecutive sequence.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/Rotate array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/Rotate array.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/Triplet sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/Triplet sum.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/pair sum to 0.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/pair sum to 0.cpp -------------------------------------------------------------------------------- /Language Tools + Time and Complexity Assignment/sum me up.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Language Tools + Time and Complexity Assignment/sum me up.cpp -------------------------------------------------------------------------------- /Linked List/Find the middle of a given linked list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Linked List/Find the middle of a given linked list.cpp -------------------------------------------------------------------------------- /Linked List/single linked list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Linked List/single linked list.cpp -------------------------------------------------------------------------------- /Modulo arithmetic/Number Of Balanced BTs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Modulo arithmetic/Number Of Balanced BTs.cpp -------------------------------------------------------------------------------- /Number Theory - 1/Extended Euclid algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 1/Extended Euclid algorithm.cpp -------------------------------------------------------------------------------- /Number Theory - 1/Find Prime Numbers From 1 to N(sieve of eratosthenes).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 1/Find Prime Numbers From 1 to N(sieve of eratosthenes).cpp -------------------------------------------------------------------------------- /Number Theory - 1/GCD(euclid).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 1/GCD(euclid).cpp -------------------------------------------------------------------------------- /Number Theory - 1/multiplicative modulo inverse.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 1/multiplicative modulo inverse.cpp -------------------------------------------------------------------------------- /Number Theory - 1/return count of prime numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 1/return count of prime numbers.cpp -------------------------------------------------------------------------------- /Number Theory - 2/Euler Totient.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 2/Euler Totient.cpp -------------------------------------------------------------------------------- /Number Theory - 2/LCM SUM.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 2/LCM SUM.cpp -------------------------------------------------------------------------------- /Number Theory - 2/Segmented Sieve Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 2/Segmented Sieve Problem.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Boring Factorials.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Boring Factorials.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Cubic Square.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Cubic Square.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Fibonacci Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Fibonacci Sum.cpp -------------------------------------------------------------------------------- /Number Theory - 3/GCD Extreme.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/GCD Extreme.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Income On Nth Day.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Income On Nth Day.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Innocent Swaps and His Emotions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Innocent Swaps and His Emotions.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Sanchit And Nuclear Reactor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Sanchit And Nuclear Reactor.cpp -------------------------------------------------------------------------------- /Number Theory - 3/Sehwag And ETF.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/Sehwag And ETF.cpp -------------------------------------------------------------------------------- /Number Theory - 3/modular-exponentiation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Number Theory - 3/modular-exponentiation.cpp -------------------------------------------------------------------------------- /Pre-requisites/Even and Odd Indexes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Pre-requisites/Even and Odd Indexes.cpp -------------------------------------------------------------------------------- /Pre-requisites/Matrix Diagonal and Boundaries sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Pre-requisites/Matrix Diagonal and Boundaries sum.cpp -------------------------------------------------------------------------------- /Pre-requisites/PRE4.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Pre-requisites/PRE4.cpp -------------------------------------------------------------------------------- /Pre-requisites/Target Marbles.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Pre-requisites/Target Marbles.cpp -------------------------------------------------------------------------------- /Pre-requisites/chakri.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Pre-requisites/chakri.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Aggressive Cows Problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Aggressive Cows Problem.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Binary Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Binary Search.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Distribute Candies.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Distribute Candies.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Inversion Count.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Inversion Count.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Momos shop.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Momos shop.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/Murder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/Murder.cpp -------------------------------------------------------------------------------- /Searching & Sorting Applications/variation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Searching & Sorting Applications/variation.cpp -------------------------------------------------------------------------------- /Segment Tree/2 vs 3.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/2 vs 3.cpp -------------------------------------------------------------------------------- /Segment Tree/Counting Even or Odd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Counting Even or Odd.cpp -------------------------------------------------------------------------------- /Segment Tree/Horrible Queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Horrible Queries.cpp -------------------------------------------------------------------------------- /Segment Tree/Lazy propogation demo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Lazy propogation demo.cpp -------------------------------------------------------------------------------- /Segment Tree/Maximum Pair Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Maximum Pair Sum.cpp -------------------------------------------------------------------------------- /Segment Tree/Maximum Sum In Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Maximum Sum In Subarray.cpp -------------------------------------------------------------------------------- /Segment Tree/Minimum In SubArray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Minimum In SubArray.cpp -------------------------------------------------------------------------------- /Segment Tree/Vasya vs Rhezo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/Vasya vs Rhezo.cpp -------------------------------------------------------------------------------- /Segment Tree/sum segment tree demo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Segment Tree/sum segment tree demo.cpp -------------------------------------------------------------------------------- /String Algorithms/Brute Force String Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/Brute Force String Matching.cpp -------------------------------------------------------------------------------- /String Algorithms/KMP.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/KMP.cpp -------------------------------------------------------------------------------- /String Algorithms/Longest Palindrome Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/Longest Palindrome Substring.cpp -------------------------------------------------------------------------------- /String Algorithms/Longest prefix suffix code.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/Longest prefix suffix code.cpp -------------------------------------------------------------------------------- /String Algorithms/Palindromic Substrings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/Palindromic Substrings.cpp -------------------------------------------------------------------------------- /String Algorithms/String Search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/String Search.cpp -------------------------------------------------------------------------------- /String Algorithms/Z-algorithm.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/String Algorithms/Z-algorithm.cpp -------------------------------------------------------------------------------- /Time and Space complexity/k-concatenation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Time and Space complexity/k-concatenation.cpp -------------------------------------------------------------------------------- /Time and Space complexity/kadane.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Time and Space complexity/kadane.cpp -------------------------------------------------------------------------------- /Time and Space complexity/max product subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Time and Space complexity/max product subarray.cpp -------------------------------------------------------------------------------- /Time and Space complexity/mind bending.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Time and Space complexity/mind bending.cpp -------------------------------------------------------------------------------- /Tries/Help Me Pradyumana!.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Tries/Help Me Pradyumana!.cpp -------------------------------------------------------------------------------- /Tries/Max XOR pair.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Tries/Max XOR pair.cpp -------------------------------------------------------------------------------- /Tries/Maximum XOR Subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Tries/Maximum XOR Subarray.cpp -------------------------------------------------------------------------------- /Tries/SUBXOR.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Tries/SUBXOR.cpp -------------------------------------------------------------------------------- /Tries/Search Engine.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/Tries/Search Engine.cpp -------------------------------------------------------------------------------- /pointers/Reference and pass by reference.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/pointers/Reference and pass by reference.cpp -------------------------------------------------------------------------------- /pointers/datatype and pointer sizes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/pointers/datatype and pointer sizes.cpp -------------------------------------------------------------------------------- /pointers/pointers.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Nagaraj-U/Coding-Ninjas-Competitive-Programming/HEAD/pointers/pointers.pdf --------------------------------------------------------------------------------