Its an online test Questions will be like the attached sample question only. 3questions will be there for 40mins duration. Timing is 11am to 11:40am est 9:30pm to 10:10pm Ist

Looking the Longest Common Substring

Problem: Given two strings X and Y, find the length of the longest common substring. For example X="abcd" Y="bbc", answer is "bc".

1) Propose a 'fast derived' algorithm.

Find the size of the search space. Provide Big O.

2) Propose an improved version of (1)

Provide Big O.

Its an online test Questions will be like the attached sample question only. 3questions will be there for 40mins duration. Timing is 11am to 11:40am est 9:30pm to 10:10pm Ist