w3resource

C++ Exercises: Check whether the sequence of numbers 1, 2, 3 appears in a given array of integers somewhere

C++ Basic Algorithm: Exercise-31 with Solution

Write a C++ program to check whether the sequence of numbers 1, 2, 3 appears in a given array of integers somewhere.

Sample Solution:

C++ Code :

#include <iostream>
 
using namespace std;

bool test(int nums[], int arr_length)
        {
        	
             for (int i = 0; i < arr_length; i++)
            {
               if (nums[i] == 1 && nums[i + 1] == 2 && nums[i + 2] == 3)
                    return true;
            }
           return false;
        }
        
int main() 
 {
  int arr_length;	
  int nums1[] = {1,1,2,3,1};	
  arr_length = sizeof(nums1) / sizeof(nums1[0]);
  cout << test(nums1, arr_length) << endl; 
  int nums2[] = {1,1,2,4,1};	
  arr_length = sizeof(nums2) / sizeof(nums2[0]);
  cout << test(nums2, arr_length) << endl;
  int nums3[] = {1,1,2,1,2,3};	
  arr_length = sizeof(nums3) / sizeof(nums3[0]);
  cout << test(nums3, arr_length) << endl;
  return 0;    
}

Sample Output:

1
0
1

Pictorial Presentation:

C++ Basic Algorithm Exercises: Check whether the sequence of numbers 1, 2, 3 appears in a given array of integers somewhere.

Flowchart:

Flowchart: Check whether the sequence of numbers 1, 2, 3 appears in a given array of integers somewhere.

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a C++ program to check whether the sequence of numbers 1, 2, 3 appears in a given array of integers somewhere.
Next: Write a C++ program to compare two given strings and return the number of the positions where they contain the same length 2 substring.

What is the difficulty level of this exercise?