Intuit SDE Interview Question 2023 April | Advanced String Algorithms | Off-campus

Question 1: Longest Palindromic Substring Problem Statement Given a string s, return the longest palindromic substring in s. While an O(N^2) expand-around-center approach is standard, top-tier companies will ask you for an algorithm that runs in strictly O(N) Linear Time. Implement this optimized algorithm. Constraints 1 <= s.length <= 1000 s consist of only digits and English letters. Example Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer.