Handshakes GFG problem of the day Dynamic Programming Amazon Interview Problem | GeeksforGeeks

Timestamps: 0:00 Reading the problem 0:44 Examples 5:00 Intuition to solve with n=8 9:00 DP Logic 10:30 Code We have N persons sitting on a round table. Any person can do a handshake with any other person. 1 2 3 4 Handshake with 2-3 and 1-4 will cause cross. In how many ways these N people can make handshakes so that no two handshakes cross each other. N would be even. Check out our other playlists: Dynamic Programming: https://www.youtube.com/playlist?list=PLLT4EuYB4kIY_DWiiFY_TW3Egm9pmZPuS Trees: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZzjDUX5VKsU9ECdIlsOdkd Heaps and Maps: https://www.youtube.com/playlist?list=PLLT4EuYB4kIatB7uwwkTDq9m-KQkD_out Arrays and Maths: https://www.youtube.com/playlist?list=PLLT4EuYB4kIb0G4k2LxdIs2dCaj9vebqC Bit Manipulation: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZGBE71Udl0m68uFxRiMhGS Greedy Algorithms: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZaOVWhgBnQr9w5JxgHAEld Sorting and Searching: https://www.youtube.com/playlist?list=PLLT4EuYB4kIaWgO_-unJeY4huZlP3Uln9 Strings: https://www.youtube.com/playlist?list=PLLT4EuYB4kIah6F-m0v-zfrQKg1G1zAJC Linked Lists: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZp5ApjgO_5K69Jv4GAGUYt Stack and Queues: https://www.youtube.com/playlist?list=PLLT4EuYB4kIY2nfXL0sxzHbDHReuMw_sE Two Pointers: https://www.youtube.com/playlist?list=PLLT4EuYB4kIbclnecGeKq8vmMdaFYdNyu Graphs, BFS, DFS: https://www.youtube.com/playlist?list=PLLT4EuYB4kIb5er32BqvSqnFFxJ0Ciqf7 Backtracking: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZfNt7M9FMfcJEiE5E8pmFL Non- DSA playlists: Probability: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZWrGlLjATLbuX7CRitUrq6 SQL-Basic Join functions: https://www.youtube.com/playlist?list=PLLT4EuYB4kIZZxUKWLLufuviTI4jWhSHN SQL-Basic Aggregate functions: https://www.youtube.com/playlist?list=PLLT4EuYB4kIa5OBKfvrPRZB6tSVcxhVJN