Katricia - Edges - Palindrome Check

[krsmith7]

time complexity: O(n) where n is the length of the string because we visit each character once
space complexity: O(3) which is shortened to O(1) because three new variables are instantiated

[shrutivanw]

Nice work on the algorithm.

Your space complexity will however end up being O(n) because you are deleting the white spaces and creating a new string object. To confirm, print my_phrase.object_id before and after line 7. You'll find that they are two different objects.

Can you think of an approach to avoid modifying the input string while keeping the space complexity constant? Hint: you will need to examine and ignore white spaces before line 14.

Give it some thought and then look the alternative solution here: https://github.com/Ada-C10/palindrome_check/blob/solution/lib/palindrome_check.rb

Slack me if you have any questions, or would like to discuss further.