Skip to content
Skein

recurrence

RU: рекуррента

The formula that expresses dp[i] in terms of earlier cells, such as dp[i-1] and dp[i-2]. It is the transition step of a DP solution and, together with the base cases, defines every cell.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?