Layla - Edges - palidrome

[lbristol88]

The time complexity is O(n) because there is only one loop running in my solution. The space complexity is O(1) because the algorithm is just checking the string and not copying anything.

[shrutivanw]

Nice work.

Wrt time and space complexity: Always explain what n stands for while explaining your time and space complexity. That along with your explanation for reasoning behind your answer, is the complete answer for the time and space complexity. In this case, n is the number of characters in the input string parameter.

The number loops don't directly influence the time complexity. It's the number of steps or operations in your algorithm that determines the time complexity. In your algorithm, each character in the input string that is a white space is compared to a white space once, and each character that is not a white space is first compared to a white space and then compared to another character that is not a white space. So, each character is compared at the most twice. If there are n characters in the input string, then the number of comparisons would be at the most 2 times n or O(n).

Slack me if you'd like to discuss further or have any questions.