Tuples

Staircase Hackerrank Solution in C

#include< stdio.h > int main() { int n,i,j,k; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { for (k=n- 1 ;k>i;k--) { printf( " " ); } for (j= 0 ;j<i+ 1 ;j++) { printf( "#" ); } printf( "\n" ); } return 0 ; }

Breaking the Records Hackerrank solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],x= 0 ,mn= 0 ; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } int min=a[ 0 ],max=a[ 0 ]; for (i= 0 ;i<n;i++) { if (min>a[i]) { min=a[i]; mn++; } } for (i= 0 ;i<n;i++) { if (max<a[i]) { max=a[i]; x++; } } printf( "%d %d" ,x,mn); return 0 ; }

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)

HackerRank Solutions In C

Search This Blog

Tuples

Comments

Post a Comment

Popular posts from this blog

Staircase Hackerrank Solution in C

Breaking the Records Hackerrank solution in C

String Split and Join Hackerrank Python Solution