1D Arrays in C HackerRank Solution

Hello Programmers, In this post, you will know how to solve the 1D Arrays in C HackerRank Solution. This problem is a part of the HackerRank C Programming Series.

1D Arrays in C HackerRank Solution
1D Arrays in C HackerRank Solution

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

1D Arrays in C


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 nint *arr = (int*)malloc(n * sizeof(int)), where arr points to the base address of the array.In this challenge, you have to create an array of size n dynamically, input the elements of the array, sum them and print the sum of the elements in a new line.

Input Format

The first line contains an integer,n.The next line contains n space-separated integers.


  • 1<=n<=1000
  • 1<=a<=1000

Output Format

Print in a single line the sum of the integers in the array.

Input 0

16 13 7 2 1 12

Output 0


Input 1

1 13 15 20 12 13 

Output 1


1D Arrays in C HackerRank Solution

#include <stdio.h>
#include <stdlib.h>
int main()
    int n, *arr, i, sum = 0;
    scanf("%d", &n);
    arr = (int*) malloc(n * sizeof(int));
    for(i = 0; i < n; i++) {
        scanf("%d", arr + i);
    for(i = 0; i < n; i++) {
        sum += *(arr + i);
    printf("%d\n", sum);
    return 0;

Disclaimer: The above Problem (1D Arrays in C) is generated by Hackerrank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.

Next; Students Marks Sum in C HackerRank Solution

Leave a Reply

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