Egg Drop Problem!

• Time : $O(nlogk)$
• Space : $O(nk)$

int Solution::solve(int n, int k) {
    int dp[10101][101] = {}, m = 0;
    while(dp[m][n] < k) {
        m++;
        for (int x = 1; x <= n; x++) dp[m][x] = 1 + dp[m - 1][x - 1] + dp[m - 1][x];
    }
    return m;
}