C#: Count ways to increase LCS length of two Strings by one

Level : Beginner
Mentor: Shailendra Chauhan
Type : GuidedLab
Points : 10
Duration : 00:15:00

Lab Details

Difficulty Level: MEDIUM

Problem Statement:

You are given two strings of lower alphabet characters, you need to find the number of ways to insert a character in the first string such that length of Longest Common Subsequence (LCS) of both strings increases by one.

Input:

str1 = "efgefg"

str2 = "efgh"

Output:

4


Self-paced Membership
  • 22+ Courses
  • 750+ Hands-On Labs
  • 200+ Quick Notes
  • 55+ Skill Tests
  • 45+ Interview Q&A
  • 10+ Real-world Projects
  • Career Coaching
  • Email Support
Upto 66% OFF
KNOW MORE..

To get full access to all courses

Still have some questions? Let's discuss.
CONTACT US
Accept cookies & close this