Ttykuu

Why limits give us the exact value of the slope of the tangent line?

How do I find out the mythology and history of my Fortress?

What order were files/directories outputted in dir?

How to run automated tests after each commit?

What does it mean that physics no longer uses mechanical models to describe phenomena?

Strange behavior of Object.defineProperty() in JavaScript

How many serial port on PI3

Should there be a hyphen in the construction "IT affin"?

Triggering an ultrasonic sensor

Hangman Game with C++

How to draw/optimize this graph with tikz

What would you call this weird metallic apparatus that allows you to lift people?

What is "gratricide"?

"Lost his faith in humanity in the trenches of Verdun" — last line of an SF story

Project Euler #1 in C++

An adverb for when you're not exaggerating

Belief In God or Knowledge Of God. Which is better?

Why do we bend a book to keep it straight?

Did Deadpool rescue all of the X-Force?

How many time did Arya actually used needle?

Effects on objects due to a brief relocation of massive amounts of mass

Maximum summed subsequences with non-adjacent items

Do I really need to have a message in a novel to appeal to readers?

Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?

Determine whether array could become non-decreasing by modifying at most 1 element

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

0

$begingroup$

The task

Given an array of integers, write a function to determine whether the
array could become non-decreasing by modifying at most 1 element.

For example, given the array [10, 5, 7], you should return true, since
we can modify the 10 into a 1 to make the array non-decreasing.

Given the array [10, 5, 1], you should return false, since we can't
modify any one element to get a non-decreasing array.

const arr = [10, 5, 7];

My functional solution

const isIncreasing = arr => 
 let count = 0;
 return[...arr].every((n, i) => 
 if (arr[i + 1] && n > arr[i + 1]) ++count; 
 return count < 2;
 );
;

console.log(isIncreasing(arr));

My imperative solution

function isIncreasing2(arr) 
 let count = 0;
 for (let i = 0, len = arr.length; i < len; i++) 
 if (arr[i + 1] && arr[i] > arr[i + 1]) ++count; 
 if (count > 1) return false;
 
 return true;


console.log(isIncreasing2(arr));

javascript algorithm programming-challenge functional-programming ecmascript-6

share

asked 4 mins ago

thadeuszlaythadeuszlay

963616

$endgroup$

add a comment | 

0

$begingroup$

The task

Given an array of integers, write a function to determine whether the
array could become non-decreasing by modifying at most 1 element.

For example, given the array [10, 5, 7], you should return true, since
we can modify the 10 into a 1 to make the array non-decreasing.

Given the array [10, 5, 1], you should return false, since we can't
modify any one element to get a non-decreasing array.

const arr = [10, 5, 7];

My functional solution

const isIncreasing = arr => 
 let count = 0;
 return[...arr].every((n, i) => 
 if (arr[i + 1] && n > arr[i + 1]) ++count; 
 return count < 2;
 );
;

console.log(isIncreasing(arr));

My imperative solution

function isIncreasing2(arr) 
 let count = 0;
 for (let i = 0, len = arr.length; i < len; i++) 
 if (arr[i + 1] && arr[i] > arr[i + 1]) ++count; 
 if (count > 1) return false;
 
 return true;


console.log(isIncreasing2(arr));

javascript algorithm programming-challenge functional-programming ecmascript-6

share

asked 4 mins ago

thadeuszlaythadeuszlay

963616

$endgroup$

add a comment | 

$begingroup$

The task

Given an array of integers, write a function to determine whether the
array could become non-decreasing by modifying at most 1 element.

For example, given the array [10, 5, 7], you should return true, since
we can modify the 10 into a 1 to make the array non-decreasing.

Given the array [10, 5, 1], you should return false, since we can't
modify any one element to get a non-decreasing array.

const arr = [10, 5, 7];

My functional solution

const isIncreasing = arr => 
 let count = 0;
 return[...arr].every((n, i) => 
 if (arr[i + 1] && n > arr[i + 1]) ++count; 
 return count < 2;
 );
;

console.log(isIncreasing(arr));

My imperative solution

function isIncreasing2(arr) 
 let count = 0;
 for (let i = 0, len = arr.length; i < len; i++) 
 if (arr[i + 1] && arr[i] > arr[i + 1]) ++count; 
 if (count > 1) return false;
 
 return true;


console.log(isIncreasing2(arr));

javascript algorithm programming-challenge functional-programming ecmascript-6

share

asked 4 mins ago

thadeuszlaythadeuszlay

963616

$endgroup$

const arr = [10, 5, 7];

const isIncreasing = arr => 
 let count = 0;
 return[...arr].every((n, i) => 
 if (arr[i + 1] && n > arr[i + 1]) ++count; 
 return count < 2;
 );
;

console.log(isIncreasing(arr));

function isIncreasing2(arr) 
 let count = 0;
 for (let i = 0, len = arr.length; i < len; i++) 
 if (arr[i + 1] && arr[i] > arr[i + 1]) ++count; 
 if (count > 1) return false;
 
 return true;


console.log(isIncreasing2(arr));

share

asked 4 mins ago

thadeuszlaythadeuszlay

963616

share

asked 4 mins ago

thadeuszlaythadeuszlay

963616

asked 4 mins ago

thadeuszlaythadeuszlay

963616

asked 4 mins ago

thadeuszlaythadeuszlay

963616