I got 2 questions\n\nYou ll be given array of strings and you have to find pairs with maximum cost and doesnt exceed maximum similarity\nSimilarity means number of common character and Cost means difference between length\n\nI brute forced and solution got accepted\n\nSecond was DP problem similar to LIS with some twist in it\n\nI solved both the problems fully in 30 mins.\n\nIn the mail it was mentioned Part 1 of 2 and after completing part 1 didnt get any invite or email..How long does it take anyone as idea..This is for SDE 1 Amazon Dublin\n\nEdit : Got part 2 it was Work Simulation and Workstyles Assessments.\n\n\nSolved both the OA\'s hopefully they call me for interview :)

I got 2 questions\n\nYou ll be given array of strings and you have to find pairs with maximum cost and doesnt exceed maximum similarity\nSimilarity means number