B. Substring and Subsequence | Educational Codeforces Round 167 Solution |

In this video, i have discussed Codeforces Educational Round 167 contest and explore the solution for the problem “B. Substring and Subsequence ” problem solution. If you aren't able to solve do watch it out .
Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨‍💻
#coding
#codeforces
#codeforcessolutions
#coding
#codeforcessolution
#codechef
#codeforcescontest
#programming #codingtips #competitiveprogramming #algorithm #problem-solving

[@44.ayushkeshri64]

Thanks, you saved my hours of solving it.

[@user-sn7mx4dk1j]

Awesome bro, keep up the good work

[@ajitkushwaha3101]

Thanks , I am superrrrr happy that you liked it . Do subscribe us for upcoming PCD :).

[@abhibhagat7767]

this was by far the best explanation with examples.

[@ajitkushwaha3101]

Thanks :) . its great that you liked it .

[@AnkitSharma-zr6gr]

hello can you help me please and tell me why my code is not working import java.util.Arrays; import java.util.Scanner; public class SubStringAndSubsequence { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for (int l = 0; l < n; l++) { String s =sc.next(); String st = sc.next(); int t [][] = new int[s.length()+1][st.length()+1]; for (int i = 1; i < s.length()+1; i++) { for (int j = 1; j < st.length()+1; j++) { if(s.charAt(i-1)==st.charAt(j-1)){ t[i][j]=1+t[i-1][j-1]; }else{ t[i][j]=Math.max(t[i-1][j],t[i][j-1]); } } } for (int [] p:t ) { System.out.println(Arrays.toString(p)); System.out.println(); } System.out.println((s.length()+st.length())-t[s.length()][st.length()]); } } }

[@kingkong76749]

same code not working

[@ajitkushwaha3101]

You can comment your code I can tell you where is the error .

[@saurabh0065]

id apki kya hai ?