Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions solutions/126.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
//Natalie Lockhart
//Find most frequent value in array

const solution = (arr) => {
function count(index){
var tempCounter = 0;
for (var a = 0; a < arr.length; a++){
if (arr[a] == arr[index]){
tempCounter++;
}
if (tempCounter > counter){
counter = tempCounter;
mostFrequent = arr[index];
}
}
}

if (arr.length == 0){
return null;
}

var counter = 0;
var mostFrequent = arr[0];
for (var i = 0; i < arr.length; i++){
count(i);
}
return mostFrequent;
};

module.exports = {
solution,
};
21 changes: 21 additions & 0 deletions test/126.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
const expect = require('chai').expect;
let solution = require('../solutions/125').solution;

describe('most frequent value in array', () => {
it('should return null for []', () => {
const result = solution([]);
expect(result).to.equal(null);
});
it('should return 1 for [1]', () => {
const result = solution([1]);
expect(result).to.equal(1);
});
it('should return 3 for [1,1,2,2,2,3,3,3,3,4]', () => {
const result = solution([1,1,2,2,2,3,3,3,3,4]);
expect(result).to.equal(3);
});
it('should return 2 for [2,1]', () => {
const result = solution([2,1]);
expect(result).to.equal(2);
});
});