24 - Amazon Top Interview Questions
Problem Statement :
You are given a list of four integers nums, each between 0 and 9, in a fixed order. By placing the operators +, -, *, and / (where / is integer division) between the numbers, and grouping them with parentheses, determine whether it is possible to get the value 24. Constraints n = 4 where n is the length of nums 0 ≤ nums[i] ≤ 9 Example 1 Input nums = [5, 2, 7, 8] Output True Explanation We can do (5 * 2 - 7) * 8 = 24 Example 2 Input nums = [7, 9, 7, 4] Output True Explanation We can make 24 with (7 - (9 / 7)) * 4. Note that / is integer division so the result of 9 / 7 is floored.
Solution :
Solution in C++ :
vector<int> count(vector<int>& nums, int l, int r) {
if (l == r) return {nums[l]};
vector<int> ret;
for (int j = l; j < r; j++) {
vector<int> left = count(nums, l, j);
vector<int> right = count(nums, j + 1, r);
for (auto& n : left) {
for (auto& p : right) {
ret.push_back(n + p);
ret.push_back(n * p);
ret.push_back(n - p);
if (p != 0) ret.push_back(n / p);
}
}
}
return ret;
}
bool solve(vector<int>& nums) {
int l = 0, r = 3;
auto dos = count(nums, l, r);
int ret = 0;
for (auto& n : dos) ret += n == 24;
return ret > 0;
}
Solution in Java :
import java.util.*;
class Solution {
char[] ops = {'+', '-', '*', '/'};
public boolean solve(int[] nums) {
return check(nums);
}
private boolean check(int[] arr) {
if (arr.length == 1) {
return arr[0] == 24;
}
for (int i = 0; i < arr.length - 1; i++) {
for (char op : ops) {
int[] res = operate(arr, i, op);
if (check(res)) {
return true;
}
}
}
return false;
}
private int[] operate(int[] orig, int idx, char op) {
int[] res = new int[orig.length - 1];
for (int i = 0; i < idx; i++) {
res[i] = orig[i];
}
if (op == '+') {
res[idx] = orig[idx] + orig[idx + 1];
} else if (op == '-') {
res[idx] = orig[idx] - orig[idx + 1];
} else if (op == '*') {
res[idx] = orig[idx] * orig[idx + 1];
} else {
res[idx] = orig[idx + 1] == 0 ? 0 : orig[idx] / orig[idx + 1];
}
for (int i = idx + 2; i < orig.length; i++) {
res[i - 1] = orig[i];
}
return res;
}
}
Solution in Python :
class Solution:
def solve(self, nums):
self.res = False
def go(i, ops, postfix):
# no. of ops. used is never more than
# index
if i == 4 and ops == 3:
if self.postorder_eval(postfix) == 24:
self.res = True
if ops < i - 1:
for op in "+-/*":
postfix.append(op)
go(i, ops + 1, postfix)
postfix.pop()
if i < len(nums):
postfix.append(nums[i])
go(i + 1, ops, postfix)
postfix.pop()
return
go(0, 0, [])
return self.res
# postfix is easy to evaluate and no brackets ;)
def postorder_eval(self, postfix):
res = []
for c in postfix:
if isinstance(c, str):
b = int(res.pop())
a = int(res.pop())
if c == "+":
c = a + b
elif c == "-":
c = a - b
elif c == "*":
c = a * b
elif c == "/":
if b == 0:
c = 0
else:
c = a // b
res.append(c)
else:
res.append(c)
return res[-1]
View More Similar Problems
Subsequence Weighting
A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =
View Solution →Kindergarten Adventures
Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti
View Solution →Mr. X and His Shots
A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M
View Solution →Jim and the Skyscrapers
Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space
View Solution →Palindromic Subsets
Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t
View Solution →Counting On a Tree
Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n
View Solution →
