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
Inserting a Node Into a Sorted Doubly Linked List
Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function
View Solution →Reverse a doubly linked list
This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.
View Solution →Tree: Preorder Traversal
Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's
View Solution →Tree: Postorder Traversal
Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the
View Solution →Tree: Inorder Traversal
In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func
View Solution →Tree: Height of a Binary Tree
The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary
View Solution →