Topic: Searching
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Roof Top</td><td>Easy</td></tr></tbody></table>

<details><summary>Question</summary><div data-type="detailsContent">Input: N = 4 A[] = {1,2,3,4} Output: 3 Explanation: 1 to 2 to 3 to 4 is the jump of length 3 to have maximum number of buildings with increasing heights, so maximum steps with increasing altitude becomes 3.</div></details>

<pre><code class="lang-java"> static int maxStep(int A[], int N)
 {
 int count = 0;
 int zount = 0;


 for(int i=0;i&lt;N-1;i++){
 if(A[i+1]&gt;A[i])

 {count++;
 if(count&gt;zount){
 zount = count;
 }}
 else{
 count = 0;
 }
 }
 return zount;
 }
</code></pre>
Thank you for reading :)

Topic: **Searching**

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Roof Top</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

<details data-node-type="hn-details-summary"><summary>Question</summary><div data-type="detailsContent">Input: N = 4 A[] = {1,2,3,4} Output: 3 Explanation: 1 to 2 to 3 to 4 is the jump of length 3 to have maximum number of buildings with increasing heights, so maximum steps with increasing altitude becomes 3.</div></details>

```java
 static int maxStep(int A[], int N)
 {
 int count = 0;
 int zount = 0;
 
 
 for(int i=0;i<N-1;i++){
 if(A[i+1]>A[i])
 
 {count++;
 if(count>zount){
 zount = count;
 }}
 else{
 count = 0;
 }
 }
 return zount;
 }
```

Thank you for reading :)

DSA Day 73/100