Counting Valleys Hackerrank Solution In C

Counting Valleys Hackerrank Solution In C

 Here is How you can solve the Counting Valleys Hackerrank Solution In C.

Problem:

Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike, he took exactly  steps. For every step he took, he noted if it was an uphill, , or a downhill,  step. Gary's hikes start and end at sea level and each step up or down represents a  unit change in altitude. We define the following terms:
  • A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level.
  • A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level.
Given Gary's sequence of up and down steps during his last hike, find and print the number of valleys he walked through.
For example, if Gary's path is , he first enters a valley  units deep. Then he climbs out an up onto a mountain  units high. Finally, he returns to sea level and ends his hike.

Function Description
Complete the countingValleys function in the editor below. It must return an integer that denotes the number of valleys Gary traversed.
countingValleys has the following parameter(s):
  • n: the number of steps Gary takes
  • s: a string describing his path
Input Format
The first line contains an integer , the number of steps in Gary's hike.
The second line contains a single string , of  characters that describe his path.
Constraints
Output Format
Print a single integer that denotes the number of valleys Gary walked through during his hike.
Sample Input
8
UDDDUDUU
Sample Output
1
Explanation
If we represent _ as sea level, a step up as /, and a step down as \, Gary's hike can be drawn as:
_/\      _
   \    /
    \/\/
He enters and leaves one valley.

Counting Valleys Hackerrank Solution In C:

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

char* readline();

// Complete the countingValleys function below.
int countingValleys(int n, char* s) {
 int count=0,v=0;
    for(int i=0;s[i] !='\0';i++)
    {
        if(s[i] == 'D')
            count--;
        else if(s[i] == 'U')
        {
            count++;
            if(count == 0 && s[i] == 'U')
                v++;
        }
    }
    return v;
}

int main()
{
    FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
    char* n_endptr;
    char* n_str = readline();
    int n = strtol(n_str, &n_endptr, 10);
    if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
    char* s = readline();
    int result = countingValleys(n, s);
    fprintf(fptr, "%d\n", result);
    fclose(fptr);
    return 0;
}

char* readline() {
    size_t alloc_length = 1024;
    size_t data_length = 0;
    char* data = malloc(alloc_length);
    while (true) {
        char* cursor = data + data_length;
        char* line = fgets(cursor, alloc_length - data_length, stdin);
        if (!line) { break; }
        data_length += strlen(cursor);
        if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') { break; }
        size_t new_length = alloc_length << 1;
        data = realloc(data, new_length);
        if (!data) { break; }
        alloc_length = new_length;
    }
    if (data[data_length - 1] == '\n') {
        data[data_length - 1] = '\0';
    }
    data = realloc(data, data_length);
    return data;
}





Hope I have Helped you in Solving counting valleys hackerrank problem. Please feel free to Share it.




















































Comments











Post a Comment























Popular posts from this blog









No Idea hackerrank solution




















Image







      Hi,  Here I solve the No Idea hackerrank solution in Python.     Problem - No Idea hackerrank solution       There is an array of   integers. There are also    disjoint sets ,   and  , each containing   integers. You like all the integers in set   and dislike all the integers in set  . Your initial happiness is  . For each   integer in the array, if  , you add   to your happiness. If  , you add   to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end.   Note:  Since   and   are sets, they have no repeated elements. However, the array might contain duplicate elements.   Constraints           Input Format      The first line contains integers   and   separated by a space.  The second line contains   integers, the elements of the array.  The third and fourth lines contain...








Read more