1D Arrays in C | HackerRank Solution

Hello there coderz, today we will be solving 1D Arrays in C HackerRank Solution.

1D Arrays in C HackerRank Solution


An array is a container object that holds a fixed number of values of a single type. To create an array in C, we can do int arr[n];. Here, arr, is a variable array which holds up to 10 integers. The above array is a static array that has memory allocated at compile time. A dynamic array can be created in C, using the malloc function and the memory is allocated on the heap at runtime. To create an integer array, arr of size n, int *arr = (int*)malloc(n * sizeof(int)), where arr points to the base address of the array. When you have finished with the array, use free(arr) to deallocate the memory.

In this challenge, create an array of size n dynamically, and read the values from stdin. Iterate the array calculating the sum of all elements. Print the sum and free the memory where the array is stored.

While it is true that you can sum the elements as they are read, without first storing them to an array, but you will not get the experience working with an array. Efficiency will be required later. 

Input Format

The first line contains an integer, n.

The next line contains n space-separated integers.


1 <= n <= 1000

1 <= a[i] <= 1000

Output Format

Print the sum of the integers in the array.

Sample Input 0

16 13 7 2 1 12 

Sample Output 0


Sample Input 1

1 13 15 20 12 13 2

Sample Output 1


Solution – 1D Arrays in C HackerRank Solution

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int n,sum=0;
    int ar[n];
    for(int i=0 ; i<n ; i++)
        sum = sum+ar[i];
    return 0;
1D Arrays in C HackerRank Solution
1D Arrays in C HackerRank Solution

Disclaimer: The above Problem (1D Arrays in C) is generated by Hacker Rank but the Solution is provided by CodingBroz.

Broz Who Code


Leave a Comment

Your email address will not be published. Required fields are marked *