Given a string s
, return the longest
Example 1:
Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer.
Example 2:
Input: s = "cbbd" Output: "bb"
Constraints:
1 <= s.length <= 1000
s
consist of only digits and English letters.
Code(C++):-
class Solution {public: string longestPalindrome(string s) { int n=s.size(); int dp[n][n]; memset(dp,0,n*n*sizeof(int)); for(int i=0;i<n;i++) dp[i][i]=1; int maxlength=1; int starting =0; for(int i=0;i<n-1;i++) { if(s[i]==s[i+1]) { starting=i; dp[i][i+1]=1; maxlength=2; } } // for substring greater than 2 for(int k=3;k<=n;k++) { for(int i=0;i<=n-k;i++) { int j=i+k-1; if(dp[i+1][j-1] and s[i]==s[j]) { if(k>maxlength) { maxlength=k; starting=i; } dp[i][j]=1; } } } string ans=""; for(int i=starting;i<starting+maxlength;i++) { ans+=(s[i]); } return ans; }};
class Solution {
public:
string longestPalindrome(string s) {
int n=s.size();
int dp[n][n];
memset(dp,0,n*n*sizeof(int));
for(int i=0;i<n;i++)
dp[i][i]=1;
int maxlength=1;
int starting =0;
for(int i=0;i<n-1;i++)
{
if(s[i]==s[i+1])
{
starting=i;
dp[i][i+1]=1;
maxlength=2;
}
}
// for substring greater than 2
for(int k=3;k<=n;k++)
{
for(int i=0;i<=n-k;i++)
{
int j=i+k-1;
if(dp[i+1][j-1] and s[i]==s[j])
{
if(k>maxlength)
{
maxlength=k;
starting=i;
}
dp[i][j]=1;
}
}
}
string ans="";
for(int i=starting;i<starting+maxlength;i++)
{
ans+=(s[i]);
}
return ans;
}
};
Recommended Post :-
HCL Coding Questions:-
Capgemini Coding Questions:-
iMocha coding Questions:-
Tech Mahindra coding questions:-
Unthinkable Solutions coding questions:-
- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value
Must check this:-
Companies interview:-
- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.
Full C course:-
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.
Cracking the coding interview:-
Array and string:-
Tree and graph:-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments