Question 1: Bridge Crossing Problem (Python)
Problem Description:
You are given a bridge represented as a list of integers where 1 is an intact section and 0 is a hole. A person must cross from start to end. Walking between two 1s is 1 step. Jumping over 0s counts as the distance between the two 1s. Find the longest jump (maximum distance) required to cross. If the bridge starts or ends with 0s, assume the person jumps from/to solid ground outside.
Sample Input: bridge = [1, 0, 0, 1, 0, 1, 0, 0, 0, 1]
Sample Output: 4