Breaking News: Grepper is joining You.com. Read the official announcement!

longest common substring

Add Answer

ujjwal sotra answered on November 9, 2021 Popularity 10/10 Helpfulness 2/10

answer longest common substring

related longest common subsequence (str, str)

related The longest substring

related longest substring

related Length longest common substring

longest common substring

Comment

int findLength(vector<int>& nums1, vector<int>& nums2) 
    {
        int n=nums1.size();
        int m=nums2.size();
        vector<vector<int>>dp(n+1,vector<int>(m+1));
        for(int i=0;i<=n;i++)
        {
            dp[i][0]=0;
        }
        for(int i=0;i<=m;i++)
        {
            dp[0][i]=0;
        }
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(nums1[i-1]==nums2[j-1])
                {
                    dp[i][j]=1+dp[i-1][j-1];
                    ans=max(ans,dp[i][j]);
                }
                else
                {
                    dp[i][j]=0;
                }
            }
        }
        return ans;
    }

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++ substring

Link to this answer
Share Copy Link

Contributed on Apr 05 2022

ujjwal sotra

0 Answers Avg Quality 2/10

Closely Related Answers

longest common subsequence (str, str)

Comment

int LongestRepeatingSubsequence(string str){
  // Code here
  int n=str.length();

  vector<int> prev(n+1,0), cur(n+1,0);

  for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
      if(str[i-1]==str[j-1])cur[j]=1+prev[j-1];
      else cur[j]=max(cur[j-1], prev[j]);
    }
    prev=cur;
  }
  return cur[n];
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 18 2023

Mridu Pawan

0 Answers Avg Quality 2/10

The longest substring

Comment

function func(line) {
  let reg = /(\w)\1+/g;
  let longest = line.match(reg).sort((a, b) => {
    a.length - b.length
  }).pop();
  console.log(line + ' : ' + longest);
}

func('ddvvrwwwrggg');
func('sdsffffse');
func('abababaab');
func('aaabbcaaaa');
func('aaaasdfbbbbyyyweryyyuurweuuuuuu');
 Run code snippet

Popularity 10/10 Helpfulness 2/10 Language java

Source: stackoverflow.com

Tags: java

Link to this answer
Share Copy Link

Contributed on Nov 09 2021

Troubled Tamarin

0 Answers Avg Quality 2/10

longest substring

Comment

Copy
class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        if s == '':
            return 0;
        
        l = set();
        m = 0;
        i = 0;
        j = 0;
        
        while(i<len(s)):
            if(s[i] not in l):
                l.add(s[i])
                i+=1
            else:
                m = max(m,len(l));
                l.remove(s[j])
                j+=1
                
        m = max(m,len(l));
        return m;

Popularity 10/10 Helpfulness 1/10 Language python

Source: zyrastory.com

Tags: longest-substring longest-substrin

Link to this answer
Share Copy Link

Contributed on Jul 22 2022

Thoughtless Thrush

0 Answers Avg Quality 2/10

Length longest common substring

Comment

using System;
using System.Collections.Generic;

class Program
{
    static int LcsUtil(string s1, string s2, int ind1, int ind2, List<List<int>> dp)
    {
        if (ind1 < 0 || ind2 < 0)
            return 0;

        if (dp[ind1][ind2] != -1)
            return dp[ind1][ind2];

        if (s1[ind1] == s2[ind2])
            return dp[ind1][ind2] = 1 + LcsUtil(s1, s2, ind1 - 1, ind2 - 1, dp);
        else
            return dp[ind1][ind2] = Math.Max(LcsUtil(s1, s2, ind1, ind2 - 1, dp), LcsUtil(s1, s2, ind1 - 1, ind2, dp));
    }

    static int Lcs(string s1, string s2)
    {
        int n = s1.Length;
        int m = s2.Length;

        List<List<int>> dp = new List<List<int>>();
        for (int i = 0; i < n; i++)
        {
            dp.Add(new List<int>());
            for (int j = 0; j < m; j++)
            {
                dp[i].Add(-1);
            }
        }

        return LcsUtil(s1, s2, n - 1, m - 1, dp);
    }

    static void Main(string[] args)
    {
        string s1 = "acd";
        string s2 = "ced";

        Console.WriteLine("The Length of Longest Common Subsequence is " + Lcs(s1, s2));
    }
}

Popularity 9/10 Helpfulness 1/10 Language csharp

Source: chat.openai.com

Tags: c# c

Link to this answer
Share Copy Link

Contributed on Jun 29 2023

Magnificent Millipede

0 Answers Avg Quality 2/10

longest common substring

Contents

More Related Answers

longest common substring

Closely Related Answers

longest common subsequence (str, str)

The longest substring

longest substring

Length longest common substring

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.