Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5761 |

@blackshadows | 5701 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4944 |

@saiujwal13083 | 4506 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3516 |

@sushant_a | 3459 |

@verma_ji | 3341 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@aroranayan999 | 938 |

@bt8816103042 | 739 |

@SHOAIBVIJAPURE | 428 |

@codeantik | 412 |

@SherlockHolmes3 | 407 |

@neverevergiveup | 348 |

@mahlawatep | 347 |

@shalinibhataniya1097 | 343 |

@murarry3625 | 333 |

@saiujwal13083 | 326 |

@rohitanand | 314 |

Complete Leaderboard |

Given an array of **N** integers **Arr _{1}, Arr_{2}, ….Arr_{N}**, count number of subarrays of

A subarray

**Example 1:**

**Input:
**N = 6
Arr[] = {1, 3, 3, 2, 3, 5}
**Output:** 4
**Explanation:**
(1,3), (2, 3), (3, 5) and (2, 3, 5)
are the only increasing subarrays.

**Example 2:**

**Input: **
N = 2
Arr[] = {1 5}
**Output:** 1
**Explanation:**(1, 5) is the only increasing
subarray.

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **countIncreasing()** which takes the array of integers **arr[]**** **and** n **as parameters and returns a integer denoting the answer.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <= 10^{7}

1 <= Arr_{i} <= 10^{7}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Count increasing Subarrays

...