1. String Palindrome Verification Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters. Input: The input is a single string without any leading or trailing spaces. All characters are in lowercase. Output: The output should be a single line printing 'true' if the string is a palindrome, otherwise 'false'. Example: Input: "malayalam"Output: trueExplanation: The string "malayalam" reads the same forward and backward, hence it is a palindrome. Constraints: 0 <= N <= 10^6 N is the length of the input string. Time Limit: 1 second Note: Your implementation should return a boolean value. Printing is handled internally.

2. Solve Java 8 Stream API questions based on an Employee object.

3. What are some common OOPS questions you have been asked?