1. Burst the balloons

Problem Statement

Burst the Balloons body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; background-color: #f6f8fa; padding: 0.2em 0.4em; margin: 0; font-size: 85%; border-radius: 3px; } pre { background-color: #f6f8fa; padding: 16px; overflow: auto; border-radius: 3px; } pre code { padding: 0; margin: 0; font-size: 100%; background-color: transparent; } strong { font-weight: 600; } 1. Burst the balloons Problem Statement Given n balloons, we need to burst balloons such that only the k -th (1-indexed) balloon remains, while all other balloons are burst. Balloons can only be burst one at a time from either the front or the back of the current arra