Greedy Algorithms Quiz - 2 (Q-10)

#1

Complexity of checking whether “hello” can be made after deleting some characters of a given string. Find min Complexity and best Algorithm. Size of hello =5 Size of given String =15

#2

hello @vineethm1627

the time complexity will be O(n+m) where n and m are the size of given strings.

algorithm hint -> two pointers

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.