Given a list of string and numbers, rotate the string by one position to the right if the sum of squares of digits of the corresponding number is even and rotate it twice to the left if the sum of the squares of the digits of the corresponding number is odd. Given an array, find the sub array which can be a square matrix with maximum sum. If there are multiple results print the matrices in the order of their orders( i.e, 3×3 matrix will be printed first, then 2X2…so on) Given an alphanumeric string, extract all numbers, remove the duplicate digits, and from that set of digits construct the largest even number possible