Space Battle - Amazon Top Interview Questions
Problem Statement :
There are a bunch of rockets in space lined up in a row. You are given a list of integers nums representing each rocket's size and direction. If the number is positive it's going right, and if it's negative it's going left. The value of the number represents the rocket's size. If two rockets collide, the smaller one will disappear and the larger one will continue on its course unchanged. If they are the same size and they collide, they'll both explode (both numbers are removed). If two rockets are moving in the same direction, they will never collide. The rockets start out equally spaced in the given order and all move at the same speed and become harmless after exploding. Return the state of the rockets after all collisions. Constraints n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 5, 3, -6] Output [-6] Explanation The last rocket will collide with everything to its left. Example 2 Input nums = [1, 5, 3, -6, 7] Output [-6, 7] Explanation -6 and 7 are going in separate directions, and the -6 rocket will destroy everything to its left.
Solution :
Solution in C++ :
vector<int> solve(vector<int>& nums) {
vector<int> v;
stack<int> st;
int i = 0;
while (i < nums.size()) {
if (st.empty()) {
st.push(nums[i]);
i++;
continue;
}
int x = st.top();
if (x > 0 and nums[i] < 0) {
if (abs(x) < abs(nums[i]))
st.pop();
else if (abs(x) == abs(nums[i])) {
st.pop();
i++;
} else {
i++;
}
} else {
st.push(nums[i]);
i++;
}
}
while (!st.empty()) {
v.push_back(st.top());
st.pop();
}
reverse(v.begin(), v.end());
return v;
}
Solution in Python :
class Solution:
def solve(self, nums):
stack = []
right_to_left = []
for num in nums:
if num > 0:
stack.append(num)
else:
still_going = True
while stack and stack[-1] <= -num:
current = stack.pop()
if current == -num:
still_going = False
break
if not stack and still_going:
right_to_left.append(num)
return right_to_left + stack
View More Similar Problems
Tree : Top View
Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.
View Solution →Tree: Level Order Traversal
Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F
View Solution →Binary Search Tree : Insertion
You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <
View Solution →Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →