commit-live-students / fractal_hackerrank_hiring_challenge_4

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Fractal Hackerrank Hiring Challenge 4

Given two strings, one is a subsequence if all of the elements of the string occur in the same order within the other string(not necessarily contiguous).

For e.g. 'I programming' is a subsequence of 'I like programming'

Problem Statement

In this challenge, given two strings s and t, find out the longest common subsequence of s in t and report the words missing from s in the order they are missing.

About


Languages

Language:Python 84.4%Language:Jupyter Notebook 15.6%