Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1359. Count All Valid Pickup and Delivery Options
Count the number of permutations of 2n events (n pickups and n deliveries) such that for each order i the delivery appears after its pickup — a combinatorics/permutation counting problem with rapidly growing results, return the count modulo 10^9+7 (1 ≤ n ≤ 500).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.