Drop a Ball Down the Stairs - Google Top Interview Questions
Problem Statement :
You are given an integer height and a list of integers blacklist. You are currently standing at height height and you are playing a game to move a small ball down to height 0. In even rounds (0, 2, 4, 6 etc.) you can move the ball down 1, 2, or 4 stairs down. In odd rounds, you can move the ball down 1, 3, or 4 stairs. There are some levels of the stairs where if the ball lands there, it will die as labelled in blacklist. Return number of ways you can move the ball down to height 0. Mod the result by 10 ** 9 + 7. Constraints 1 ≤ height ≤ 100,000 0 ≤ b ≤ 100,000 where b is the length of blacklist Example 1 Input height = 4 blacklist = [2] Output 2 Explanation We can move 4 stairs down on round 0. We can move 1 stair down on round 0 and then 3 stairs down on round 1. Example 2 Input height = 5 blacklist = [0] Output 0 Explanation There's no way to reach height 0 since it's on the blacklist.
Solution :
Solution in C++ :
const int MOD = 1e9 + 7;
const int even[3] = {1, 2, 4};
const int odd[3] = {1, 3, 4};
unordered_set<int> s;
vector<vector<int>> dp;
int f(int h, int round) {
// base case
if (h < 0 or s.count(h)) return 0;
// found a way
if (h == 0) return 1;
// memoization
int& ans = dp[round][h];
if (ans != -1) return ans;
ans = 0;
// even round
if (!round) {
for (auto x : even) {
ans = (ans + f(h - x, round ^ 1)) % MOD;
}
}
// odd round
else {
for (auto x : odd) {
ans = (ans + f(h - x, round ^ 1)) % MOD;
}
}
return ans;
}
int solve(int height, vector<int>& blacklist) {
s.clear();
dp.clear();
dp.resize(2, vector<int>(height + 1, -1));
for (auto x : blacklist) s.insert(x);
return f(height, 0);
}
Solution in Java :
import java.util.*;
class Solution {
long MOD = 1000000007;
public int solve(int height, int[] bList) {
DP = new Long[height + 1][2];
Set<Integer> set = new HashSet<>();
for (int num : bList) set.add(num);
return (int) dp(set, height, 0);
}
Long[][] DP;
private long dp(Set<Integer> bList, int curr, int odd) {
if (bList.contains(curr) || curr < 0)
return 0;
if (curr == 0)
return 1;
if (DP[curr][odd] != null)
return DP[curr][odd];
if (odd == 1)
return DP[curr][odd] =
(dp(bList, curr - 1, 0) + dp(bList, curr - 3, 0) + dp(bList, curr - 4, 0))
% MOD;
return DP[curr][odd] =
(dp(bList, curr - 1, 1) + dp(bList, curr - 2, 1) + dp(bList, curr - 4, 1)) % MOD;
}
}
Solution in Python :
class Solution:
def solve(self, height, blacklist):
MOD = 10 ** 9 + 7
found = set(blacklist)
if 0 in found:
return 0
@lru_cache(None)
def dp(h, rnd):
if h < 0 or h in found:
return 0
if h == 0:
return 1
ans = 0
if rnd % 2 == 0:
ans += dp(h - 2, rnd ^ 1)
else:
ans += dp(h - 3, rnd ^ 1)
ans += dp(h - 1, rnd ^ 1)
ans += dp(h - 4, rnd ^ 1)
return ans
return dp(height, 0) % MOD
View More Similar Problems
Equal Stacks
ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of
View Solution →Game of Two Stacks
Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f
View Solution →Largest Rectangle
Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle
View Solution →Simple Text Editor
In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,
View Solution →Poisonous Plants
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan
View Solution →AND xor OR
Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value
View Solution →