Count Hills and Valleys in an Array Problem

Count Hills and Valleys in an Array Problem — ExecCode Easy DSA Practice

Solve the Count Hills and Valleys in an Array problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given a 0-indexed integer array nums. Your task is to compute the required answer and return the number of hills and valleys in nums. An index i is part of a hill in nums if the closest non-equal neighbors of i are smaller than nums[i]. Similarly, an index i is part of a valley in nums if the closest non-equal neighbors of i are larger than nums[i]. Adjacent indices i and j are part of the same hill or valley if nums[i] == nums[j]. Note that for an index to be part of a hill or valley, it must have a non-equal neighbor on both the left and right of the index.

Examples

Input {"nums": [2, 4, 1, 1, 6, 5]}; Output 3. Input {"nums": [6, 6, 5, 5, 4, 1]}; Output 0

Constraints

3 <= nums.length <= 100 1 <= nums[i] <= 100

Practice Count Hills and Valleys in an Array free on ExecCode. Browse DSA problems, topic map, and placement guides.