LeetCode 680 | Valid Palindrome II | Greedy Algorithm Explained (Java)
Today we go over Valid Palindrome II, a continuation of the former problem that I posted. It is an easy problem on LeetCode
The description reads: "Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome."
Running Time: O(N)
Space Complexity: O(1)
Always be pluggin:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-524144127
Twitter: / elon_xavier