|All-time Popular Problems|
|Inorder Successor in BST|
|Maximum Product Subarray|
|Is Binary Number Multiple of 3|
|Pairwise swap elements of a linked list by swapping data|
|Largest Number formed from an Array|
|Reverse an Array|
|Boundary Traversal of binary tree|
|Leaders in an array|
Given two strings str1 and str2, find the shortest common shortest common subsequence of the two strings.
The first line of input contains an integer T denoting the number of test cases.Each test case contains two space separated strings.
Output the length of the shortest common supersequence.