Hackerrank solutions

All Hackerrank's questions solutions links:

1. problem solving

Solve Me First, Simple Array Sum, Compare the Triplets 

A Very Big Sum, Diagonal Difference, Plus Minus

Staircase, Mini-Max Sum, Birthday Cake Candles 

Time Conversion, Grading Students, Apple and Orange

Number Line Jumps, Breaking the Records, Sub-array Division

Divisible Sum Pairs, Migratory Birds, Day of the Programmer 

Bill Division, Sales by Match, Drawing Book 

Counting Valleys, Electronics Shop, Cats and a Mouse

Picking Numbers, The Hurdle Race, Designer PDF Viewer 

Utopian Tree, Angry Professor, Beautiful Days at the Movies

Viral Advertising, Save the Prisoner!, Circular Array Rotation 

Sequence Equation, Jumping on the Clouds: Revisited, Find Digits

------------------------------------------------------------------------------ Congratulations on your 4th star!!!!

( more solutions coming soon... )

Comments

Post a Comment

Popular posts from this blog

Coursera's Algorithmic toolbox assignment solutions( Sum of Two Digits, Maximum Pairwise Product ) :

Problem 1: Sum of Two Digits Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include < bits/stdc++.h > using namespace std ; int main () { int a , b ; cin >> a >> b ; cout << a + b ; } This code is simple. There's no need for any explanation.         Problem 2: Maximum Pairwise Product Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () {      long long n , i ;     cin >> n ;      long long a [ n ];      for ( i = 0 ; i < n ; i ++) { cin >> a [ i ]; } sort ( a , a + n ); cout <<( a [ n - 1 ]* a [ n - 2 ]); } This code is simple. There's no need for any explanation.       Guys , if you have any queries related to a question or need more explan
Read more

HackerEarth's basic programming solutions( Seating Arrangement, Zoos, Anagrams ) :

Problem 1: Seating Arrangement Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () { long long t , s , p ; //t=no. of test cases cin >> t ; // s=seat no., p=corresponding seat no. while ( t --) { cin >> s ;      p = s % 12 ; //when to use modulo see below if ( p == 1 )      {          cout << s + 11 << " WS" << endl ;      }      else if ( p == 2 )      {          cout << s + 9 << " MS" << endl ;      } else if ( p == 3 )      {          cout << s + 7 << " AS" << endl ;      }      else if ( p == 4 )      {          cout << s + 5 << " AS" << endl ;      }      else if ( p == 5 )      {          cout << s + 3 << " MS" << endl ;     
Read more

HackerEarth's basic programming solutions( Minimize Cost, Magical Word, Best Index ) :

Problem 42: Minimize Cost Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) "Still working on this problem....."         Problem 43: Magical Word Solution: (in c++) ( please guys before moving to the solution try it yourself at least 3-4 times , if you really wanna become a good coder) #include< bits/stdc++.h > using namespace std ; int main () { int t ;    cin >> t ;     while ( t --)     {        int l ;       string s ;       cin >> l >> s ;        for ( int i = 0 ; i < s . length (); i ++)         {           if ( s [ i ]<= 69 && s [ i ]>= 65 )          s [ i ]= 'C' ;           else if ( s [ i ]<= 72 && s [ i ]>= 70 )          s [ i ]= 'G' ;           else if ( s [ i ]<= 76 && s [ i ]>= 73 )          s [ i ]= 'I' ;           else if ( s [ i ]<= 81 &&
Read more