Two code questions on HackerRank in 70 minutes.

Got them right after sending a CV, and had 5 days to enter the link and start answering them.

It's been two weeks, and I still haven't received any answer.

1. Code Question 1

Amazon Shopping provides a product search feature that makes browsing products easier. Instead of showing exact matches only, it also displays transformable results for better browsing. A word 'a' is said to be transformable to a word 'b' if 'a' is a subsequence of 'b'. Given 'searchWord' and 'resultWord', find the minimum number of characters that must be appended at the end of the 'searchWord' such that 'resultWord' is a subsequence of the modified 'searchWord'.

Note: A subsequence of a string is a string that results from deleting 0 or more characters from the string without changing the order of the remaining characters. For example, "Amazon" is a subsequence of "abcmmdaqzxopn" while "abc" is not a subsequence of "cdhbqaab".

1. Code Question 2:

Amazon Engineering maintains a large number of logs of operations across all products. A software engineer is debugging an issue in a product. An efficient way to analyze logs is to write automated scripts to check for patterns. The engineer wants to find the maximum number of times a target word can be obtained by rearranging a subset of characters in a log entry.

Given a log entry 's' and target word 't', the target word can be obtained by selecting some subset of characters from 's' that can be rearranged to form string 't' and removing them from 's'. Determine the maximum number of times the target word can be removed from the given log entry.

Note: Both strings 's' and 't' consist only of lowercase English letters.