Leetcode 1259. Handshakes That Don't Cross

Given an even number of people seated around a circle, count the ways to pair them up with handshakes so that no two handshakes cross; the solution reduces to counting non-crossing perfect matchings (Catalan-like structures) under any additional pairing constraints and typically requires interval dynamic programming and modular arithmetic for large n.