Relaxed Prefix
Category: Algorithm
Source: ETAPS'15
Description
Given two sequences, pat and a, determine if any sequence obtained from pat by removing at most one character is a prefix of `a'.
Category: Algorithm
Source: ETAPS'15
Given two sequences, pat and a, determine if any sequence obtained from pat by removing at most one character is a prefix of `a'.