5. Longest Palindromic Substring
Problem statement:
Given a string s, return the longest palindromic substring in s.
Logic:
my code:
class Solution {
public String longestPalindrome(String s) {
int i=1;
int length=1;
for(int i=1 , i++, i< s.length -2){
...
gateandroidandexploration.hashnode.dev1 min read