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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1259. Handshakes That Don't Cross

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact