Uber Pool - Amazon Top Interview Questions
Problem Statement :
You are given a two-dimensional integer list requested_trips containing [start_x, end_x, num_passengers], and an integer capacity. Each requested trip asks to pick up num_passengers passenger at start_x and drop them off at end_x. You also have a car with the given capacity, and start at x = 0.
Given that you'd like to pick up every passenger and can only move right, return whether you can pick up and drop off everyone.
Constraints
n ≤ 100,000 where n is the length of requested_trips
Example 1
Input
trips = [
[1, 30, 2],
[3, 5, 3],
[5, 9, 3]
]
capacity = 6
Output
True
Solution :
Solution in C++ :
bool solve(vector<vector<int>>& trips, int capacity) {
vector<pair<int, int>> helper;
for (auto& v : trips) {
helper.emplace_back(v[0], v[2]);
helper.emplace_back(v[1], -v[2]);
}
sort(helper.begin(), helper.end());
for (auto& p : helper) {
capacity -= p.second;
if (capacity < 0) return false;
}
return true;
}
Solution in Python :
class Solution:
def solve(self, trips, capacity):
events = [0] * (max([_[1] for _ in trips]) + 1)
# print(len(events))
for start, end, passengers in trips:
events[start] += passengers
events[end] += -passengers
# print(events)
curr_capacity = 0
for event in events:
curr_capacity += event
if curr_capacity > capacity:
return False
return True
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 →