Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 662 |

@arpitsatnalika | 629 |

@code_it_ | 591 |

@prakharxyz | 583 |

@tujhekya | 542 |

@Rahul Jadhav 1 | 458 |

@sivanandh03 | 448 |

@satyam0460 | 433 |

@iamronak | 424 |

@imnm | 424 |

@18eumc107 | 421 |

Complete Leaderboard |

Given two strings **A **and **B**, find if **A** is a subsequence of **B**.

**Input:**

The first line of input contains an integer **T** denoting the no of test cases. Then** T** test cases follow. Each test case contains two space separated strings **A and B**.

**Output:**

For each test case, in a new line, **print 1** if a is sub-sequences of b else **print 0**.

**Constraints:**

1 <= T <= 900

1<= |A|,|B| <=10^{4}

**Example:
Input:**

2

AXY YADXCP

gksrek geeksforgeeks

**Output:**

0

1

**Explanation:
Testcase1:**

Input: A = "axy", B = "yadxcp"

Output: 0 (A is not a subsequence of B)

Input: A = "gksrek", B = "geeksforgeeks"

Output: 1 (str1 is a subsequence of str2)

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Check for subsequence

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.