Google Software Engineer Internship interview questions

You are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome. Return the length of the maximum length awesome substring of s.

You are given an undirected tree T consisting of N nodes rooted at node 1.You have to assign value to each node of the tree such that:1)The assigned value must be a prime number less than or equal to 100.2)The sum of values assigned to any pair of adjacent nodes is not a prime number.Determine the total number of valid assignments.