Commit 86adc6d

committed

problme 67 solved

1 parent c0bcdcb commit 86adc6dCopy full SHA for 86adc6d

File tree

+15

-0

lines changed

+15

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,3 +2,18 @@`
`2`	`2`
`3`	`3`	`Example Input: [3, 5, 2, 5, 3, 3, 1, 4, 5] Example Output: 3 */`
`4`	`4`
	`5`	`+const findMostFrequent = arrayOfNums => {`
	`6`	`+ const frequency = {};`
	`7`	`+ arrayOfNums.map(element => frequency[element] = frequency[element] + 1 \|\| 1);`
	`8`	`+`
	`9`	`+ const allNumbers = Object.keys(frequency);`
	`10`	`+ const NumbersRepetition = Object.values(frequency);`
	`11`	`+ const maxFrequentValue = Math.max(...NumbersRepetition);`
	`12`	`+ const maxFrequentsIndex = NumbersRepetition.findIndex ( x => x === maxFrequentValue);`
	`13`	`+`
	`14`	`+ const mostFrequentElement = allNumbers[maxFrequentsIndex];`
	`15`	`+ return mostFrequentElement;`
	`16`	`+ }`
	`17`	`+`
	`18`	`+`
	`19`	`+ console.log(findMostFrequent([3, 5, 2, 5, 3, 3, 1, 4, 5]));`

Comments

(0)