👑 VIP Practice Test

CodeSignal Technical Assessment Matrix Traversal and Logic 4 is part of the expanded VIP practice test library — only for VIP members.

Question 1👑 VIP

In a matrix DP problem for counting paths from top-left to bottom-right (moving only right or down), the recurrence is dp[i][j] = dp[i-1][j] + dp[i][j-1]. What are the base cases?

Remaining questions and full explanations are VIP-exclusive.

Already a VIP member? Enter your email to unlock instantly: