[Hackerrank] Solution of The Time in Words in JavaScript

[Hackerrank] Solution of The Time in Words in JavaScript

[Hackerrank] Solution of The Time in Words in JavaScript

[Hackerrank] Solution of Minimum Distances in JavaScript

[Hackerrank] Solution of Minimum Distances in JavaScript

[Hackerrank] Solution of Minimum Distances in JavaScript

[Hackerrank] Solution of Beautiful Triplets in JavaScript

[Hackerrank] Solution of Beautiful Triplets in JavaScript

[Hackerrank] Solution of Beautiful Triplets in JavaScript

If you don't pass test case 10, yes me too. Then I find this comment in discussion tab. I think it will help  you.

The 10th test case isn't satisfying the criteria of a[i] > a[i-1] at the time of solving this problem.

The test case is :

10 3
1 6 7 7 8 10 12 13 14 19

The 2 consecutive 7, 7 is the problem.

If your program is relying strictly on the fact arr[i] > arr[i-1] (like mine), then it's not your program's fault for giving wrong answer.

[Hackerrank] Solution of Modified Kaprekar Numbers in JavaScript

[Hackerrank] Solution of Modified Kaprekar Numbers in JavaScript

[Hackerrank] Solution of Modified Kaprekar Numbers in JavaScript

[Hackerrank] Solution of Encryption in JavaScript

[Hackerrank] Solution of Encryption in JavaScript

[Hackerrank] Solution of Encryption in JavaScript

[Hackerrank] Solution of Electronics Shop in JavaScript

[Hackerrank] Solution of Electronics Shop in JavaScript

[Hackerrank] Solution of Electronics Shop in JavaScript