Gap Up and Gap Down | Editorial by aksingh007

The solution is straight forward from the problem statement itself. From second day to last day simply count the total number of GAP UP & GAP DOWN as
defined in the problen statement.
finally, print them.

Time complexity: O(n)

```
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;

public class Solution {

// Complete the solve function below.
    static void solve(List<Integer> low, List<Integer> high, List<Integer> close) {
        int gu=0,gd=0;
        for(int i=1;i<low.size();i++){
            if(low.get(i)>close.get(i-1)) gu++;
            if(high.get(i)<close.get(i-1)) gd++;
        }
        System.out.println(gu+" "+gd);

}

public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

int n = Integer.parseInt(bufferedReader.readLine().trim());

List<Integer> low = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

List<Integer> high = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

List<Integer> close = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
            .map(Integer::parseInt)
            .collect(toList());

solve(low, high, close);

bufferedReader.close();
    }
}

```

Gap Up and Gap Down | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?