Company: CoinSwitch_2Dec
Difficulty: medium
Prime Jump Navigation 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, h3 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } h1 { font-size: 2em; } h2 { font-size: 1.5em; } h3 { font-size: 1.25em; } 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; } ul { padding-left: 20px; } Prime Jump Navigation Problem Description You are given an array of N positive integers representing checkpoints on a number line. You begin at position 0 and must reach position N-1 using