1. Valid palindrome
   https://leetcode.com/problems/valid-palindrome-ii/ - Solved this in optimal way, explained time and space complexity.

2. Length of longest subsequesnce increasing by 1 (it can skip some inputs but is still taking them in order)
   ex - 8,5,6,2,0,3,4,4,5,7,1 output is 2,3,4,5
   I could not solve this. Just told the brute force approach which will be very costly.

Ping here if any one faced similar situation. Haven't heard anything from recruiter yet.