How to find out below solution in JavaScript

Question

I am a new web developer and need assistance generating a given output to a problem:

var totalNumberofRows = 5; 
var output = '';
for (var i = 1; i <= totalNumberofRows; i++) {
    for (var j = 1; j <= i; j++) {
        output +=  i;
     }
    console.log(output+' ');
    output = '';
}

Output:

Expected Output:

How would I be able to make my code produce the target output?

Why do you expect a non-sequential output when the loop is sequential? — Yogi, Sep 25 '22 at 07:13
Can you explain more about the expected output ? Right now, just doing ```console.log(1); console.log(22);...``` is a solution, but i guess it's not what you want — JeanJacquesGourdin, Sep 25 '22 at 07:13
Does this answer your question? [Generating Fibonacci Sequence](https://stackoverflow.com/questions/7944239/generating-fibonacci-sequence) — Yogi, Sep 25 '22 at 07:45

score 3 · Answer 1 · answered Sep 25 '22 at 07:23

3

For non-sequential numbers you could use an array with the String.repeat method:

[1, 2, 3, 5, 8].forEach(n => console.log(n.toString().repeat(n)));

answered Sep 25 '22 at 07:23

Yogi

6,241
3
24
30

score 1 · Answer 2 · answered Sep 25 '22 at 07:32

1

If you want to output the fibonachi sequence you can do :

let current = 1
let last = 0

for (let i = 0; i < 5; i++) {
  console.log(Array(current+last).fill(current+last).join(''))
  let toLast = current
  current += last
  last = toLast
}

answered Sep 25 '22 at 07:32

JeanJacquesGourdin

1,496
5
25

Jaejoon Han · Accepted Answer · 2022-09-25T14:20:54.763

0

Have you intended something similar to the Fibonacci sequence?

var totalNumberofRows = 5;
var output = '';

for (var i = 1; i <= totalNumberofRows; i++) {
    var next = fibo(i + 1);
    
    for (var j = 1; j <= next; j++) {
        output += next;
    }

    console.log(output + ' ');
    output = '';
}

function fibo(n) {
  let result = [0, 1];

  for (let i = 2; i <= n; i++) {
    const a = result[i - 1];
    const b = result[i - 2];

    result.push(a + b);
  }

  return result[n];
}

edited Sep 25 '22 at 14:20

answered Sep 25 '22 at 07:26

Jaejoon Han

66
5

I feel really bad because of this answer, you are computing again and again the same values, this is a typical use case of dynamic programming. Please edit with an optimised version, you just need to add an array holding the preceding values of the sequence, so that you dont have to compute it again. This edit will make the time complexity ~O(N) instead of something like ~O(n^2) – JeanJacquesGourdin Sep 25 '22 at 11:31
Thanks ! That's almost it ! The thing with your current solution is that you still compute again every value of the sequence for every new number asked to fibo(), you need put the array outside of the fibo() function so that it is remembered. – JeanJacquesGourdin Sep 26 '22 at 05:36

score 0 · Answer 4 · answered Sep 26 '22 at 04:09

0

[1, 2, 3, 5, 8].map(item => console.log(item.toString().repeat(item)));

answered Sep 26 '22 at 04:09

Asif vora

3,163
3
15
31

How to find out below solution in JavaScript

4 Answers4