Longest Palindromic Substring - Swift Solution | Interview Question From Amazon
Longest Palindromic Substring, is a LeetCode problem from dynamic-programming subdomain. This problem has also been asked in companies like Amazon during the interview. In this post we will see how we can solve this challenge in Swift
You can find the full details of the problem Longest Palindromic Substring at LeetCode
Time Complexity: O(n^2), Space Complexity: O(1)
Please check the main.swift snippet for the solution.
This solution originally posted at: Github by @soapyigu