Max sum of non-adjacent value combination in an array.

Question

fgao · Accepted Answer

dp[i] = max(dp[i-1],a[i]+dp[i-2])

Sigiloso · Answer

That is a standard DP.

The sample problem of the online interviewstreet site (if you mean that with the pegs) is a simple backtracking problem doable in about 15-20 LOC. No mind-breaking stuff needed.

Meta

Pergunta de entrevista da empresa Meta

Respostas da entrevista

Empresas seguidas

Buscas de vagas