355. String Array Consecutive Character Count

Given an array of strings strs and a single character char, find the length of the longest contiguous subarray where every string in that subarray contains the specified character char at least once. If no string contains the character, return 0.

Example:
Input: strs = ["apple", "banana", "cherry", "date"], char = "a"
Output: 2 (Because ["apple", "banana"] is the longest sequence where both contain 'a'.)

Run this challenge interactively in Python or JavaScript when the app loads.