NeetCode #665LC-1259Hard1-D Dynamic ProgrammingNC Algo100
← Back to All Problems#665 · #1259 · Handshakes That Don't Cross(不相交的握手)
📌 Problem Statement & Constraints
numPeople people stand in a circle and each shakes exactly one other person's hand, with no two handshakes crossing. Return the number of ways to do this, modulo 10^9 + 7. Constraints: 1 <= numPeople <= 1000, and numPeople is even.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!