sum from the sublist
Melting point of aspirin, contradicting sources
Is XSS in canonical link possible?
Why do IPv6 unique local addresses have to have a /48 prefix?
THT: What is a squared annular “ring”?
Can I use my Chinese passport to enter China after I acquired another citizenship?
Global amount of publications over time
How should I respond when I lied about my education and the company finds out through background check?
Folder comparison
Is it possible to have a strip of cold climate in the middle of a planet?
Does a 'pending' US visa application constitute a denial?
Customize circled numbers
A social experiment. What is the worst that can happen?
Greco-Roman egalitarianism
Do Legal Documents Require Signing In Standard Pen Colors?
Diode in opposite direction?
Journal losing indexing services
Should I stop contributing to retirement accounts?
Is a model fitted to data or is data fitted to a model?
Can I sign legal documents with a smiley face?
What is the grammatical term for “‑ed” words like these?
Is '大勢の人' redundant?
Translation of Scottish 16th century church stained glass
Can a Necromancer reuse the corpses left behind from slain undead?
What's the difference between 違法 and 不法?
sum from the sublist
$begingroup$
The task:
Given a list of numbers L, implement a method sum(i, j) which returns
the sum from the sublist L[i:j] (including i, excluding j).
For example, given L = [1, 2, 3, 4, 5], sum(1, 3) should return
sum([2, 3]), which is 5.
You can assume that you can do some pre-processing. sum() should be
optimized over the pre-processing step.
const lst = [1, 2, 3, 4, 5];
My functional solution:
const sum = (i,j) =>
const sumSublst = (acc, x) =>
return acc + x;
;
return lst.slice(i,j).reduce(sumSublst, 0);
;
console.log(sum(1,3));
My imperative solution:
function sum2(i,j)
let sum = 0;
for(let k = i; k <j; k++)
sum += lst[k];
return sum;
console.log(sum2(1,3));
I didn't understand the last part of the task, why pre-processing and optimizing is needed for a simple task like summing up sub elements of a list.
javascript algorithm programming-challenge functional-programming
asked 1 min ago
thadeuszlaythadeuszlay
631314
$endgroup$
add a comment |
$begingroup$
The task:
Given a list of numbers L, implement a method sum(i, j) which returns
the sum from the sublist L[i:j] (including i, excluding j).
For example, given L = [1, 2, 3, 4, 5], sum(1, 3) should return
sum([2, 3]), which is 5.
You can assume that you can do some pre-processing. sum() should be
optimized over the pre-processing step.
const lst = [1, 2, 3, 4, 5];
My functional solution:
const sum = (i,j) =>
const sumSublst = (acc, x) =>
return acc + x;
;
return lst.slice(i,j).reduce(sumSublst, 0);
;
console.log(sum(1,3));
My imperative solution:
function sum2(i,j)
let sum = 0;
for(let k = i; k <j; k++)
sum += lst[k];
return sum;
console.log(sum2(1,3));
I didn't understand the last part of the task, why pre-processing and optimizing is needed for a simple task like summing up sub elements of a list.
javascript algorithm programming-challenge functional-programming
asked 1 min ago
thadeuszlaythadeuszlay
631314
$endgroup$
add a comment |
$begingroup$
The task:
Given a list of numbers L, implement a method sum(i, j) which returns
the sum from the sublist L[i:j] (including i, excluding j).
For example, given L = [1, 2, 3, 4, 5], sum(1, 3) should return
sum([2, 3]), which is 5.
You can assume that you can do some pre-processing. sum() should be
optimized over the pre-processing step.
const lst = [1, 2, 3, 4, 5];
My functional solution:
const sum = (i,j) =>
const sumSublst = (acc, x) =>
return acc + x;
;
return lst.slice(i,j).reduce(sumSublst, 0);
;
console.log(sum(1,3));
My imperative solution:
function sum2(i,j)
let sum = 0;
for(let k = i; k <j; k++)
sum += lst[k];
return sum;
console.log(sum2(1,3));
I didn't understand the last part of the task, why pre-processing and optimizing is needed for a simple task like summing up sub elements of a list.
javascript algorithm programming-challenge functional-programming
asked 1 min ago
thadeuszlaythadeuszlay
631314
$endgroup$
The task:
Given a list of numbers L, implement a method sum(i, j) which returns
the sum from the sublist L[i:j] (including i, excluding j).
For example, given L = [1, 2, 3, 4, 5], sum(1, 3) should return
sum([2, 3]), which is 5.
You can assume that you can do some pre-processing. sum() should be
optimized over the pre-processing step.
const lst = [1, 2, 3, 4, 5];
My functional solution:
const sum = (i,j) =>
const sumSublst = (acc, x) =>
return acc + x;
;
return lst.slice(i,j).reduce(sumSublst, 0);
;
console.log(sum(1,3));
My imperative solution:
function sum2(i,j)
let sum = 0;
for(let k = i; k <j; k++)
sum += lst[k];
return sum;
console.log(sum2(1,3));
I didn't understand the last part of the task, why pre-processing and optimizing is needed for a simple task like summing up sub elements of a list.
javascript algorithm programming-challenge functional-programming
javascript algorithm programming-challenge functional-programming
asked 1 min ago
thadeuszlaythadeuszlay
631314
asked 1 min ago
thadeuszlaythadeuszlay
631314
asked 1 min ago
thadeuszlaythadeuszlay
631314
asked 1 min ago
thadeuszlaythadeuszlay
631314
asked 1 min ago
thadeuszlaythadeuszlay
631314
631314
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
);
);
, "mathjax-editing");
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216124%2fsum-from-the-sublist%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216124%2fsum-from-the-sublist%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
