text: Java program to find the longest subsequence possible that starts and ends with 1 and filled with 0 in the middle
code: import java . io . * ; class GFG { static void longestSubseq ( String s , int length ) {