Add result to int array every time you finish counting the occurrence

int values[] = ...;
Multiset<Integer> ms = HashMultiset.create();
ms.addAll(Ints.asList(list));

int count0 = ms.count(Integer.valueOf(0));
int count1 = ms.count(Integer.valueOf(1));

int[] results = new int[100];

// fill map with results
for(int index = 0; index < randomNumbers.length; index++)
{
    // if number on randomnumbers is 2, this line sum +1 in position 2 of the array
    results[randomNumbers[index]] = results[randomNumbers[index]] + 1;
}

var arrays = [{
  'id': 1,
  'name': 'Bob'
}, {
  'id': 1,
  'name': 'Bob'
}, {
  'id': 1,
  'name': 'Bob'
}, {
  'id': 2,
  'name': 'Jeff'
}, {
  'id': 1,
  'name': 'Bob'
}, {
  'id': 2,
  'name': 'Jeff'
}]

let newArray = arrays.reduce(function(acc, curr, index) {
  let getIndex = acc.findIndex(function(item) {
    return item.name === curr.name;
  })
  if (getIndex === -1) {
    acc.push({
      name: curr.name,
      frequency: 1
    })
  } else {
    acc[getIndex].frequency = acc[getIndex].frequency + 1

  }
  return acc;
}, [])

console.log(newArray)

#include <stdio.h>

int main (void) {

    int buf[] = {1, 2, 5, 2},
        length = sizeof(buf) / sizeof(int), 
        count = 0,
        same = 0;

    for (int i = 0; i < length - 1; i++)    /* identify what value matches */
        for (int j = i + 1; i < length; i++)
            if (buf[i] == buf[j]) {
                same = buf[i];
                goto saved;     /* jump out of both loops when same found */
            }
    saved:;    /* the lowly, but very useful 'goto' saves the day - again */

    for (int i = 0; i < length; i++)    /* count matching numbers */
        if (buf[i] == same)
            count++;

    printf ("count = %d\n", count);

    return 0;
}

$ ./bin/arr_freq_count
count = 2

#include <stdio.h>
#include <string.h>
#include <limits.h>

int main (void) {

    int buf[] = {1, 2, 3, 4, 5, 2, 5, 6},
        n = sizeof buf / sizeof *buf,
        max = INT_MIN,
        min = INT_MAX;

    for (int i = 0; i < n; i++) {   /* find max/min for range */
        if (buf[i] > max)
            max = buf[i];
        if (buf[i] < min)
            min = buf[i];
    }

    int range = max - min + 1;      /* max-min elements (inclusive) */
    int freq[range];                /* declare VLA */

    memset (freq, 0, range * sizeof *freq); /* initialize VLA zero */

    for (int i = 0; i < n; i++)     /* loop over buf setting count in freq */
        freq[buf[i]-min]++;

    for (int i = 0; i < range; i++) /* output frequence of values */
        printf ("%d occurs %d times\n", i + min, freq[i]);

    return 0;
}

$ ./bin/freq_arr
1 occurs 1 times
2 occurs 2 times
3 occurs 1 times
4 occurs 1 times
5 occurs 2 times
6 occurs 1 times