Find maximum length of subsequence of an array where odd and even index of subsequence having same element in ### o(n*n) for eg. array=[1,2,8,1,2,8,2] maximum length of subsequence if 2,8,2,8,2

you have an array in one operation choose two different element and remove from array return minimum length of array
you can do this operation any number of times

lets we have

string s="" , k="abcd";

(1) s=s+a;

(2) s+=a;

int a=10;
int b=(++a)+(++a)
b is 24

Another

int a=10;
int b=(++a) + (++a) + (--a) + (++a);
b is 47

HOW BOTH IS WORKING