Question: Develop a C program that given an input string s1 and a target string s2, it finds the longest matching pattern of s2 that is

Develop a C program that given an input string s1 and a target string s2, it finds the longest matching pattern of s2 that is contained in s1. Example: s1 - "abcdefghefg" s2 - "abdefghcrt" Maximum matching string: "defgh" Starting position on s1:4 Starting position on s2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
