Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,923 questions

51,856 answers

573 users

How to count the number of strictly increasing subarrays in an array with TypeScript

1 Answer

0 votes
function countStrictlyIncreasingSubarrays(arr : any) {
    const size = arr.length;
    let count = 0;
        
    for (let i = 0; i < size; i++) {
        for (let j = i + 1; j < size; j++) {
            if (arr[j - 1] >= arr[j]) {
                break;
            }
            count++;
            let s = "";                        // for print only
            for (let k = i; k < j + 1; k++) {  // for print only
                s = s + arr[k] + " ";          // for print only
            }                                  // for print only
            console.log(s);                    // for print only
        }
    }
    return count;
}
        
const arr:number[] = [1, 3, 4, 0, 7, 2, 9];
// {1, 3}, {1, 3, 4}, {3, 4}, {0, 7}, {2, 9}
        
console.log(countStrictlyIncreasingSubarrays(arr) + " = Count of strictly increasing subarrays");

      
  
    
      
      
/*
run:
      
"1 3 " 
"1 3 4 " 
"3 4 " 
"0 7 " 
"2 9 " 
"5 = Count of strictly increasing subarrays" 
      
*/

      
  
 

 



answered Aug 21, 2022 by avibootz
...