In this problem I have discussed how to solve two strings hackerrank problem from interview preparation kit series.
This is marked as easy and can be solved in O(n) time using frequncy of character or creating key value pair of char and then checking second strings character is present in the first or not.
if you solving problems from hackerrank interview preparation kit series and getting stuck or want to look for optimized solution please check out this playlist;
Here is the link:
https://www.youtube.com/playlist?list=PL_7PgBhpX0WbdJdiKskPkBflqLvCEtsOE
