GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing github.com — 50DaysOfJavaScript/Day-34 at main · syedsohan/50DaysOfJavaScript

Expand file tree

Day-34

Copy path

Directory actions

More options

Directory actions

More options

Latest commit

History

Day-34

Copy path

Folders and files

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
mostFreq.js		mostFreq.js

README.md

Outline

Write a program to find the most frequent item of an array.

Instructions

Input

const arr = [3, 'a', 'a', 'a', 2, 3, 'a', 3, 'a', 2, 4, 9, 3];

Output

a 5

Challenges (0/2 done)

mostFreq([1, 2, 2, 4, 5, 6, 6]) returns 2 2.
mostFreq([3, 'a', 'a', 'a', 2, 3, 'a', 3, 'a', 2, 4, 9, 3]) returns a 5.

function mostFreq(arr) {
	// write your code here
	return
}

const arr = [1, 2, 2, 4, 5, 6, 6];

console.log(mostFreq(arr));

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.

GeezerVison

Expand file tree

Day-34

Directory actions

More options

Directory actions

More options

Latest commit

History

Day-34

Folders and files

parent directory

README.md

Write a program to find the most frequent item of an array.

Instructions

Challenges (0/2 done)