From 8d12087c64507c7bfc965e8d78016749b0385b8c Mon Sep 17 00:00:00 2001 From: Shreya Prasad Date: Sun, 17 May 2020 20:49:46 +0530 Subject: [PATCH] Create LongestPalindromicSubsequence.cpp --- .../LongestPalindromicSubsequence.cpp | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 Famous-Coding-Interview-Problems/LongestPalindromicSubsequence.cpp diff --git a/Famous-Coding-Interview-Problems/LongestPalindromicSubsequence.cpp b/Famous-Coding-Interview-Problems/LongestPalindromicSubsequence.cpp new file mode 100644 index 0000000..4f712e3 --- /dev/null +++ b/Famous-Coding-Interview-Problems/LongestPalindromicSubsequence.cpp @@ -0,0 +1,22 @@ +class Solution { +public: + int longestPalindromeSubseq(string s) + { + vector> dp(s.size() + 1, vector(s.size() + 1)); + for(int i = 1; i <= s.size(); i++) + { + for(int j = 1; j <= s.size(); j++) + { + if(s[i - 1] == s[s.size() - j]) //imp line + dp[i][j] = dp[i - 1][j - 1] + 1; + else + dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]); + } + } + return dp[s.size()][s.size()]; + } + +}; + +//Time Complexity: O(n^2) +//LeetCode: https://leetcode.com/problems/longest-palindromic-subsequence/