Code:
1.Write a program to get the subsequence of a bit 1 and 0 given in a array of bits.

For example:

array={1,0,1,1,0,1,1}

Output={1,0,1,0}

array={1,1,0,1,0,0,1,1}

Output={1,1,0,1,0,0}
 
2. given an array of integers divide it into two groups such that sum of
each group is equal.
e.g.

input:{1,2,3,6}
output;{1,2,3} and{6}

input:{1,7,2,8}
output:{2,7}and{1,8}

input:{1,2,7}
output:not possible
  
3. a string is given.
find if it can be converted into palindrome or not.
e.g.
input: tests
it can be converted into "tsest" which is a palindrome so
output:true