w3resource

C++ Exercises: Check if a triple is presents in an array of integers or not

C++ Basic Algorithm: Exercise-36 with Solution

Write a C++ program to check if a triple is present in an array of integers or not. If a value appears three times in a row in an array it is called a triple.

Sample Solution:

C++ Code :

#include <iostream>
 
using namespace std;

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

Sample Output:

0
0
1

Pictorial Presentation:

C++ Basic Algorithm Exercises: Check if a triple is presents in an array of integers or not.

Flowchart:

Flowchart: Check if a triple is presents in an array of integers or not.

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a C++ program to count the number of two 5's are next to each other in an array of integers. Also count the situation where the second 5 is actually a 6.
Next: Write a C++ program to compute the sum of the two given integers. If the sum is in the range 10..20 inclusive return 30.

What is the difficulty level of this exercise?



Follow us on Facebook and Twitter for latest update.

C++ Programming: Tips of the Day

Converting an int to std::string

You can use std::to_string in C++11

int i = 3;
std::string str = std::to_string(i);

Ref : https://bit.ly/3vd2Kjy





We are closing our Disqus commenting system for some maintenanace issues. You may write to us at reach[at]yahoo[dot]com or visit us at Facebook