JAVASCRIPT

Problem Statement:

Given an array representing a sequence in the forest, identify the maximum number of consecutive 'rabbit' elements without any intervening 'rock' elements.

Input Format:

An array forest where each element is either 'rabbit' or 'rock'.

Output Format:

An integer representing the length of the longest continuous sequence of 'rabbit'.

Examples:

Example $1$:

Input: forest $=[\text{'}$rabbit$\text{'},$ 'rabbit', 'rock', 'rabbit', 'rabbit', 'rabbit'$]$

Output: $3$

Example $2$:

Input: forest $=[\text{'}$rabbit$\text{'},$ 'rock', 'rabbit', 'rabbit', 'rock', 'rabbit'$]$

Output: $2$