Set .difference() Operation Hackerrank Solution in Python 3

Migratory Birds HackerRank Solution in C

#include< stdio.h > int main() { long int n,i,b[ 10000 ],j,count= 0 ,t,k; long int a[ 100000 ],c[ 100000 ],p[ 100000 ]; scanf( "%ld" ,&n); for (i= 0 ;i<n;i++) { scanf( "%ld" ,&a[i]); } for (i= 0 ;i<n;i++) { if (a[i]== 1 ) { b[ 1 ]++; } if (a[i]== 2 ) { b[ 2 ]++; } if (a[i]== 3 ) { b[ 3 ]++; } if (a[i]== 4 ) { b[ 4 ]++; } if (a[i]== 5 ) { b[ 5 ]++; } } int max=b[ 1 ]; for (j= 1 ;j<= 5 ;j++) { if (max<b[j]) { max=b[j]; } } long int z= 1 ; for (j= 1 ;j<= 5 ;j++) { if (max==b[j]) { c[j]=j; count++; t=j;...

String Split and Join Hackerrank Python Solution

def split_and_join(line): line=line.split() line= '-' .join(line) return line if __name__ == '__main__' : line = input () result = split_and_join(line) print (result)

Birthday Chocolate HackerRank Solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],dt,m,temp,count= 0 ,sum= 0 ,j; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } scanf( "%d%d" ,&dt,&m); for (i= 0 ;i<n;i++) { sum= 0 ; temp= 0 ; for (j=i;j<n;j++) { if (temp<m) { sum=sum+a[j]; temp++; } } if (sum==dt) { count++; } } printf( "%d" ,count); return 0 ; }

HackerRank Solutions In C

Search This Blog