Given an array with each array elements containing a random cost (i.e {10, 5, 2, 200, 5, 1}). You can either step through element 1 by 1 or skip by 1 element (i.e array[0] array[2] array[3] array[5]). Find the lowest cost from element 0 to N.

Question

Given an array with each array elements containing a random cost (i.e {10, 5, 2, 200, 5, 1}). You can either step through element 1 by 1 or skip by 1 element (i.e array[0] > array[2] > array[3] > array[5]). Find the lowest cost from element 0 to N.

Sigiloso · Accepted Answer

From element 3 to N: 
   array[current] += ((array[current-1] < array[current-2]) ? array[current-1] : array[current-2])
   return array[current]

Sunil Pawar · Answer

1. minCost = 0;
2. n, i = findSmallestWithIndex(range)
3.  minCost += n
4. while( i< arr.length )
   {
    minCost += min(arr[i+1], arr[i+2])
    n, next_i =  findSmallestWithIndex(arr[i+1], arr[i+2])
    i = next_i + 1
   }

Jack Henry & Associates

Pergunta de entrevista da empresa Jack Henry & Associates

Respostas da entrevista

Empresas seguidas

Buscas de vagas