AnswerBot
1y
2 variable variation of LIS
The problem involves finding the longest increasing subsequence in two arrays
Dynamic programming can be used to solve the problem
The time complexity of the solution is O(n^2...read more
Anonymous
3y
Solved it with sorting and LIS dp
Help your peers!
Add answer anonymously...
Top Amazon Sde1 interview questions & answers
Popular interview questions of Sde1
Top HR questions asked in Amazon Sde1
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app