Created
March 24, 2020 22:04
-
-
Save victorkurauchi/bc96d7181a61bc492b44eb9237dacc30 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// you can write to stdout for debugging purposes, e.g. | |
// console.log('this is a debug message'); | |
function solution(A) { | |
// write your code in JavaScript (Node.js 8.9.4) | |
let distinct = 0; | |
let sorted = A.sort((a, b) => a - b); | |
let last; | |
// console.log(sorted) | |
sorted.forEach((n, index) => { | |
if (n !== last) { | |
distinct++; | |
} | |
last = n; | |
}) | |
// console.log(distinct) | |
return distinct; | |
} | |
/* | |
Write a function | |
function solution(A); | |
that, given an array A consisting of N integers, returns the number of distinct values in array A. | |
For example, given array A consisting of six elements such that: | |
A[0] = 2 A[1] = 1 A[2] = 1 | |
A[3] = 2 A[4] = 3 A[5] = 1 | |
the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3. | |
Write an efficient algorithm for the following assumptions: | |
N is an integer within the range [0..100,000]; | |
each element of array A is an integer within the range [−1,000,000..1,000,000]. | |
*/ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment