52 - Longest Palindromic Substring - Dynamic Programming approach 1

@backstreetbrogrammer Pseudo code: String s; int L = left, R = right; while (L is greater than or equal to 0 && R is less than s.length() && s.charAt(L) == s.charAt(R)) { L--; R++; } return R - L - 1; Leetcode: https://leetcode.com/problems/longest-palindromic-substring/ Github: https://github.com/backstreetbrogrammer/08_DynamicProgramming/blob/main/src/main/java/com/backstreetbrogrammer/dynamic/LongestPalindromicSubstring.java - Dynamic Programming Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTilRgmNUQ632OrD-wfRLUR_ - Dynamic Programming Github: https://github.com/backstreetbrogrammer/08_DynamicProgramming - Java Serialization Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTjGLkI8kd2d0bfNHx0v7dTy - Java Serialization Github: https://github.com/backstreetbrogrammer/05_Persistence #java #javadevelopers #javaprogramming #algorithms #datastructuresandalgorithms #dynamicprogramming #onemonthofdynamicprogramming

Видео 52 - Longest Palindromic Substring - Dynamic Programming approach 1 автора Java: просто и доступно