2.3 years ago

justiceleaguer006 • 20

There were 3 questions. First question had a time limit of 25 min. After the 25 minutes are over you cannot go back to that question and it was 35minutes each for the other 2 questions as well.

First Question: Based on string.

Q1 ) Given 2 strings , you have to tell if they are similar or not.

• a) Two string are similar if they are completely equal.(like acd acd are similar )

  b) Or we break first string in 2 equal parts say a1,b1 and second string again in equal parts a2,b2. Now if a1 is equal to any of a2 or b2 and b1 is equal to any a1 or b2 then the main string are again similar.(like abcd cdab are not equal but ac,cd is similar to cd,ab so the main string are also similar). They had mentioned that odd sized strings that are not equal are not similar

Q2) Contiguous subarray related question. Given an array [1,2,4,5,3] you have to return the number of contiguous subarray such that after removing the subarray the remaining array is a sorted increasing subarray.

Q3) A simple knapsack DP problem (no modifications).