/* Given a series of numbers, find the longest sequence in the series. A sequence could be one of the following: AN ASCENDING SEQUENCE Example: input:836926 output:369 A DESCENDING SEQUENCE Example: input:2995316 output:9531 A EQUAL SEQUENCE Example: input:255566 output:555*/ // Enter number(1,2or3) space number(in which you want to find the sequence) 0(to end the program) // This is the first program that took me over a week to finish. I HOPE YOU LIKE IT. // P.S : IF YOU FIND ANY BUG PLESAE LET ME KNOW IN THE COMMENTS !! #include using namespace std; // FUNCTION PROTOTYPING int longest_asc(int); int longest_dsc(int); int longest_eql(int); int makeInt(int [], int); int pow(int, int); void credits(void); // MAIN FUNCTION int main() { int n, choice; while (1) { cout << "Press 1. To find the ascending sequence.\nPress 2. To find the descending sequence.\nPress 3. To find the equal sequence.\nPress 0. To Exit" << endl; cin >> choice; switch (choice) { case 1 : cout << "\nEnter a number : " ; cin >> n; cout << "\n"; cout << "Longest ascending sequence : " << longest_asc(n) << "\n" << endl; break; case 2 : cout << "\nEnter a number : " ; cin >> n; cout << "\n"; cout << "Longest descending sequence : " << longest_dsc(n) << "\n" << endl; break; case 3 : cout << "\nEnter a number : " ; cin >> n; cout << "\n"; cout << "Longest equal sequence : " << longest_eql(n) << "\n" << endl; break; case 0 : credits(); exit(0); default : cout <<"Invalid input"<=0; i--) { *(arr+j)=temp[i]; j++; } for (int i=0; i=0; i--) { *(arr+j)=temp[i]; j++; } for (int i=0; i*(arr+j)) { x=*(arr+j); s++; ar[s]=x; int_size++; } sequence=makeInt(ar, int_size); if(longest_seq=0; i--) { *(arr+j)=temp[i]; j++; } for (int i=0; iPLEASE UPVOTE IF YOU LIKE<----------"<< endl; }

#longestSequence