problem id:--http://practice.geeksforgeeks.org/problems/minimum-sum-of-factors/0 In this problem we first calculate and store at least one prime factor of every number. if the given number is prime number then just add 1 to it and that will be our required answer. is the given number is not a prime then find the prime...

problem id:-http://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1 code:-- /* Please note that it's Function problem i.e. you need to write your solution in the form Function(s) only. Driver Code to call/invoke your function would be added by GfG's Online Judge.*/ /*   Reverse...

problem id:--http://practice.geeksforgeeks.org/problems/rod-cutting/0 In this problem you have to use DP(instead of recursion which takes exponential time). We create a array val of size n+1. We then traverse var i from 1 to index n. And take i as the length of the Rod and try to find the max. Value for the regarding...

problem id:--http://practice.geeksforgeeks.org/problems/min-value-of-x/0 In this problem you need to find the Positive integer root of the given equation Since given equation is this ax^2+bx+c>=k First convert it into normal form ax^+bx+(c-k)>=0 Now find the +ve root of the quadratic solution . and if it's...

In this problem you need to find the largest permutation of a given array by using at most k swap. I am using map(in decreasing order ) here because you need to swap the largest element of array with the current index of the orignal array.So first of all insert values into map with there index values.After that traverse...

Check Arithmetic Progression In this question you can use Hashing or priority_queue. I have used Priority queue(Heap ) First of all push all elements in the heap .I elements is less than or equal to 2. then AP can be formed . Else go for the approach (I mean) find the common diff and check through out the array to find...

problem id:-http://practice.geeksforgeeks.org/problems/friendly-array/0 code:-- #include <bits/stdc++.h> using namespace std; #define  ll       long long #define      pii                  std::pair<int,int> #define  ...