Count All Valid Pickup and Delivery Options at DoorDash
Hard64.9% acceptance
This problem has 50.0% frequency at DoorDash.
Problem Description
Given `n` orders, each order consists of a pickup and a delivery service. Count all valid pickup/delivery possible sequences such that delivery(i) is always after of pickup(i). Since the answer may be too large, return it modulo 10^9 + 7.
Read full problem and hintsTopics
Also asked at 2 companies
More DoorDash Questions
Binary Tree Maximum Path SumHardLongest Increasing Path in a MatrixHardMaximum Profit in Job SchedulingHardNext Greater Element IIIMediumBasic CalculatorHard
View all DoorDash questions