The time complexity of checking for a subsequence is O(n), where n is the length of the string.