q1. Find the missing words in the subsequence. t is subsequence of s. Eg: s is "LeetCode is very much amazing and good" and t is "Leetcode is amazing good". We have to find the characters in s that are not in t in the exact same order.
Ans: Use two pointer approach - Easy

q2. We have a student who runs sprints from 1->n. We are given n which represents the no of goals/checkposts we have. We are given points in an array where he starts his sprint. He starts from sprint a to b, then b to c and c to d and so on. This is represented in a list like [2,5,7,4]. This represents that he started his sprint from 2->5, then another sprint from 5->7, and lastly from 7->4. Which is the goal/checkpost he visited the most?
Ans: Use line-sweep algorithm and return the point which is visited the most - Medium/Hard

Passed both the questions with 100% accuracy, but never heard back from recruiter even after following up via mail