(s, left, right, count = 0)
| 126 | }; |
| 127 | |
| 128 | const isPalindromeFromCenter = (s, left, right, count = 0) => { |
| 129 | const isInBounds = () => 0 <= left && right < s.length; |
| 130 | while (isInBounds()) { |
| 131 | /* Time O(N) */ |
| 132 | const isEqual = s[left] === s[right]; |
| 133 | if (!isEqual) break; |
| 134 | |
| 135 | count++; |
| 136 | |
| 137 | left--; |
| 138 | right++; |
| 139 | } |
| 140 | |
| 141 | return count; |
| 142 | }; |
no test coverage detected