In a coding interview, you're asked to implement a function to check if a given string is a palindrome. How would you design your algorithm, considering both time and space complexity?

Option 4 is the optimal solution as it has O(n) time complexity and O(1) space complexity. By comparing characters from both ends simultaneously, we avoid the need for additional data structures or string manipulations, optimizing both time and space.