In this tutorial, I am going to discuss a problem Is Subsequence (check if a string is subsequence of another string).
Given two strings str1 and str2, check if str1 is a subsequence of str2. Both strings consists only of lowercase characters.
Example 1:
Input: str1 = “abc”, str2 = “ahbgdc”
Output: true
Example 2:
Input: s = “axc”, t = “ahbgdc”
Output: false
How to check valid perfect square without sqrt (in-built Library function).
Given a positive integer, We have to write a code to returns true if it is a perfect square else false.
For solving this problem, we don’t have to use any built-in library function (such as sqrt).
For Example –
Example 1:
Input: 36
output: true
Example 2:
Input: 17
output: false
Example 3:
Input: 1
output: true
Write a code to find all Anagrams in a String. Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.
Both the strings only consist of lowercase English letters. The length of both strings s and p will not be larger than 20,100.
The order of output does not matter.