{"post":"

Given: An array of integers, we have to find the maximum length such that the elements are consecutive integers (the consecutive numbers can be in any order).

EXAMPLES:

Input : xyz[] = {5, 54, 3, 45, 6, 92, 4};

Output : 4

The maximum consecutive elements are 3, 4, 5, 6.

Code:

#include <bits/stdc++.h>\n\nint findlongsub(int array[], int no_of_elements)\n{\n    std::unordered_set<int> uno_set;  //taking a set of input\n    for (int i = 0; i < no_of_elements; i++)\n        uno_set.insert(array[i]);\n\n    int answer = 0;\n    for (int i = 0; i < no_of_elements; i++)\n    {\n        // to check for required elements in starting of set\n        if (uno_set.find(array[i] - 1) == uno_set.end())\n        {\n            // Checking for all the consecutive elements in set\n            int j = array[i];\n            // increment the value of array element and again search for the consecutive elements\n            while (uno_set.find(j) != uno_set.end())\n                j++;\n\n            answer = std::max(answer, j - array[i]);\n        }\n    }\n    return answer;\n}\n\n// Main code\nint main()\n{\n    int array[] = { 5, 54, 3, 45, 6, 92, 4 };\n    //here 3,4,5,6 are the longest subsequence\n    int no_of_elements = sizeof(array) / sizeof(int);\n    std::cout << findlongsub(array, no_of_elements) << std::endl;\n    return 0;\n}\n\n

Output

4\n\n

Time complexity : O(n)

\n","title":"Maximum consecutive integers present in an array","authorDetails":{"name":"Prabhnoor Maingi","slug":"prabhnoor-maingi"},"description":"Learn how to find the maximum consecutive integers present in an array using C++. This program utilizes a loop to iterate through the array and compares each element to the previous one to determine if it is part of a consecutive sequence. The maximum length of this sequence is then stored and outputted to the user.","slug":"maximum-consecutive-integers-present-in-an-array/","articleId":"636a83447bb1ce5072622b5f","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}