CodeNation | Round 1 Problem 2 | SDE | 1st August

Problem Description You are given two sequences of integers, say S1 and S2. In a single operation you can insert any single integer at any position in sequence S1. Find minimum number of operations required such that sequence S2 becomes a subsequence of string S1. Sample S1 = "{3,8,9,3,7,10}" S2 = "{8,7,3,9}" then minimum number of operations required = 2. Op1 = insert "3" at end of sequence. "{3,8,9,3,7,10}" => "{3,8,9,3,7,10,3}". Op2 = insert "b" at end of sequence. "{3,8,9,3,7,10,3}" ...