Count the Number of Incremovable Subarrays I - DSA Problem | Talentd