Given two strings ‘X’ and ‘Y’, find the length of the longest common substring.

preview_player
Показать описание
Given two strings ‘X’ and ‘Y’, find the length of the longest common substring.


Input : X = "abcdxyz", y = "xyzabcd"

Output : 4

The longest common substring is "abcd" and is oflength 4.

Input : X = "zxabcdezy", y = "yzabcdezx"
  1. Pooja Bisen
Рекомендации по теме
Is Subsequence - 0:08:29

Is Subsequence - Leetcode 392

Greatest Common Divisor 0:09:16

Greatest Common Divisor of Strings - Leetcode 1071 - Python

Given two strings, 0:11:04

Given two strings, find if first string is a subsequence of second

Longest Common Subsequence 0:18:25

Longest Common Subsequence - Dynamic Programming - Leetcode 1143

HackerRank Two Strings 0:08:27

HackerRank Two Strings Explained - Java

Multiply Strings - 0:17:44

Multiply Strings - Leetcode 43 - Python

Valid Anagram - 0:12:01

Valid Anagram - Leetcode 242 - Python

Check if two 0:03:33

Check if two given strings are isomorphic to each other | GeeksforGeeks

string methods, string 0:57:10

string methods, string conversion methods, string operators, class,chandle,void data types

Interleaving Strings - 0:18:19

Interleaving Strings - Dynamic Programming - Leetcode 97 - Python

Isomorphic Strings (LeetCode 0:15:27

Isomorphic Strings (LeetCode 205) | Full solution using a HashMap | Easy to understand

Longest Common Subsequence 0:25:31

Longest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems

String Interleaving Dynamic 0:07:47

String Interleaving Dynamic Programming

Print common characters 0:02:29

Print common characters of two Strings in alphabetical order | GeeksforGeeks

Add Strings Leetcode 0:09:46

Add Strings Leetcode || Intuition + Code + Explanation || August Daily Challenge

DP 30. Minimum 0:07:30

DP 30. Minimum Insertions/Deletions to Convert String A to String B

Add Binary - 0:08:01

Add Binary - Leetcode 67 - Python

Greatest Common Divisor 0:08:11

Greatest Common Divisor of Strings | Leetcode - 1071

Longest Common Subsequence 0:07:55

Longest Common Subsequence

Minimum Edit Distance 0:09:47

Minimum Edit Distance Dynamic Programming

Find the Index 0:09:38

Find the Index of the First Occurrence in a String - Leetcode 28 - Python

Determine if two 0:08:22

Determine if two strings/phrases are valid Anagrams | Study Algorithms

Minimum Window Substring 0:25:41

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

DP 27. Longest 0:14:01

DP 27. Longest Common Substring | DP on Strings 🔥