gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,learn): processed translations (#45123)

Browse Source
This commit is contained in:
camperbot
2022-02-16 22:48:09 +05:30
committed by GitHub
parent 51c8b065f5
commit c934590548
48 changed files with 515 additions and 492 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/greatest-subsequential-sum.md
View File

@ -1,6 +1,6 @@
---
id: 5a23c84252665b21eecc7e84
title: Greatest subsequential sum
title: La sottosequenza con la somma più alta
challengeType: 5
forumTopicId: 302278
dashedName: greatest-subsequential-sum
@ -8,31 +8,31 @@ dashedName: greatest-subsequential-sum
# --description--
Given a sequence of integers, find a continuous subsequence which maximizes the sum of its elements, that is, the elements of no other single subsequence add up to a value larger than this one.
Data una sequenza di numeri interi, trovare una sottosuccessione continua che massimizza la somma dei suoi elementi, cioè, gli elementi di nessun'altra successione sommano ad un valore superiore a questo.
An empty subsequence is considered to have the sum of \\( 0 \\); thus if all elements are negative, the result must be the empty sequence.
Si considera che una sottosuccessione vuota abbia la somma di \\( 0 \\); quindi se tutti gli elementi sono negativi, il risultato deve essere la sequenza vuota.
# --hints--
`maximumSubsequence` should be a function.
`maximumSubsequence` dovrebbe essere una funzione.
```js
assert(typeof maximumSubsequence == 'function');
```
`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return an array.
`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` dovrebbe restituire un array.
```js
assert(Array.isArray(maximumSubsequence([1, 2, -1, 3, 10, -10])));
```
`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` should return `[ 1, 2, -1, 3, 10 ]`.
`maximumSubsequence([ 1, 2, -1, 3, 10, -10 ])` dovrebbe restituire `[ 1, 2, -1, 3, 10 ]`.
```js
assert.deepEqual(maximumSubsequence([1, 2, -1, 3, 10, -10]), [1, 2, -1, 3, 10]);
```
`maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ])` should return `[ 0, 8, 10 ]`.
`maximumSubsequence([ 0, 8, 10, -2, -4, -1, -5, -3 ])` dovrebbe restituire `[ 0, 8, 10 ]`.
```js
assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [
@ -42,25 +42,25 @@ assert.deepEqual(maximumSubsequence([0, 8, 10, -2, -4, -1, -5, -3]), [
]);
```
`maximumSubsequence([ 9, 9, -10, 1 ])` should return `[ 9, 9 ]`.
`maximumSubsequence([ 9, 9, -10, 1 ])` dovrebbe restituire `[ 9, 9 ]`.
```js
assert.deepEqual(maximumSubsequence([9, 9, -10, 1]), [9, 9]);
```
`maximumSubsequence([ 7, 1, -5, -3, -8, 1 ])` should return `[ 7, 1 ]`.
`maximumSubsequence([ 7, 1, -5, -3, -8, 1 ])` dovrebbe restituire `[ 7, 1 ]`.
```js
assert.deepEqual(maximumSubsequence([7, 1, -5, -3, -8, 1]), [7, 1]);
```
`maximumSubsequence([ -3, 6, -1, 4, -4, -6 ])` should return `[ 6, -1, 4 ]`.
`maximumSubsequence([ -3, 6, -1, 4, -4, -6 ])` dovrebbe restituire `[ 6, -1, 4 ]`.
```js
assert.deepEqual(maximumSubsequence([-3, 6, -1, 4, -4, -6]), [6, -1, 4]);
```
`maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ])` should return `[ 3, 5, 6, -2, -1, 4 ]`.
`maximumSubsequence([ -1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1 ])` dovrebbe restituire `[ 3, 5, 6, -2, -1, 4 ]`.
```js
assert.deepEqual(maximumSubsequence([-1, -2, 3, 5, 6, -2, -1, 4, -4, 2, -1]), [