Empresas
Empleos
  • Sobre nosotros
  • Soluciones
    • Publicación de vacantes
      Publica tu vacante y recibe candidatos calificados en 48h.
    • Evaluación de candidatos
      500+ pruebas técnicas y psicológicas, más anti-fraude.
    • Headhunting
      Búsqueda ejecutiva a la medida de principio a fin.
    • Nómina + EOR
      Dispersión de nómina y EOR en más de 15 países de LATAM.
  • Precios
  • Empleos

0

331
Vistas
Combination problem - Given two integers n and k, write a program to return all possible combinations of k numbers out of 1 2 3 n

I am trying to solve simple algorithm using JS:

Given two numbers n and k and you have to find all possible combination of k numbers from 1…n.

Input : n = 5 
        k = 3

Output : 1 2 3 
         1 2 4 
         1 2 5 
         1 3 4 
         1 3 5 
         1 4 5 
         2 3 4 
         2 3 5 
         2 4 5 
         3 4 5 

However, when I tried this code using JS, I am not getting the expected output:

let ans = [],
  arr = [];

function makeCombination(n, k, low = 1) {
  if (k == 0) {
    ans.push(arr);
    console.log(...arr);
    return;
  }

  for (let i = low; i <= n; i++) {
    arr.push(i);
    makeCombination(n, k - 1, i + 1);
    arr.pop();
  }
  return ans;
}

var n = 5;
var k = 3;

makeCombination(n, k);

Output:

1 2 3
1 2 4
1 2 5

Can you please help, why I am not getting the expected output? I would appreciate any of your assistance.

about 4 years ago · Juan Pablo Isaza
2 Respuestas
Responde la pregunta

0

let ans = [],
  arr = [];

function makeCombination(n, k, low = 1) {
  if (k == 0) {
    ans.push(arr.slice());
//    console.log(...arr); commenting out the console log to demonstrate that the returned value is correct
    return;
  }

  for (let i = low; i <= n; i++) {
    arr.push(i);
    makeCombination(n, k - 1, i + 1);
    arr.pop();
  }
  return ans;
}

var n = 5;
var k = 3;

makeCombination(n, k).map(a => console.log(...a));
.as-console-wrapper { max-height: 100% !important; top: 0; }

You need to make a copy of the partial results array. Otherwise you push a reference to the same array to the results array and remove the elements from it during your backtracking algorithm.

One telltale sign of the problem was that your function wrote the correct results to the console but the returned result array was populated with empty arrays. Using slice() you make a copy which avoids this problem.

Edit: Copied Nina Scholz's console formatting technique because it just looks much better.

about 4 years ago · Juan Pablo Isaza Denunciar

0

Beside using some other variables outside of the function, you could take a function which returns a single array.

function makeCombination(n, k, i = 1) {
    const result = [];
    while (i <= n - k + 1) {
        if (k === 1) result.push([i]);
        else result.push(...makeCombination(n, k - 1, i + 1).map(a => [i, ...a]));
        i++;
    }
    return result;
}

makeCombination(5, 3).map(a => console.log(...a));
.as-console-wrapper { max-height: 100% !important; top: 0; }

about 4 years ago · Juan Pablo Isaza Denunciar
Responde la pregunta
Encuentra empleos remotos

¡Descubre la nueva forma de encontrar empleo!

Top de empleos
Top categorías de empleo
Empresas
Publicar vacante Precios Comercial
Legal
Términos y condiciones Política de privacidad
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Recomiéndame algunas ofertas
Necesito ayuda