Palindrome String Check (Handle Empty and Null)

Problem: Palindrome String Check

For a given string s, decide if reading its characters from either direction produces the same sequence.

Requirements

• Your implementation must explicitly account for both of these cases:
  • s == null
  • s == "" (the empty string)
• Include the time complexity and space complexity of your method.

Input Format

• The input consists of one line containing string s; in some interview settings, s may instead be supplied as a function argument.

Output Format

• Output either true or false.

Constraints (reasonable assumption)

• 0 <= |s| <= 1e5

Examples

• Input: abba -> Output: true
• Input: abc -> Output: false
• Input: empty string "" -> Output: true
• Input: null -> Output: false (unless the interviewer specifies otherwise)

Example

Input: abba

Output: true