C++ Solution to Leetcode 1359. Count All Valid Pickup and Delivery Options

Problem statement Given n orders, each order consists of pickup and delivery services. Count all valid pickup/delivery possible sequences such that delivery(i) is always after pickup(i). Since the answer may be too large, return it modulo 10^9 + 7....