  In this paper we mainly discuss sharp lower and upper bounds for the length
of longest consecutive switches in IID Bernoulli sequences.
  This work is an extension of results in Erd\H{o}s and R\'{e}v\'{e}sz (1975)
for longest head-run and Hao et al. (2021) for longest consecutive switches in
unbiased coin-tossing, and might be applied to reliability theory, biology,
quality control, pattern recognition, finance, etc.
