Round 1
Questions:
-
You will be given an array of strings and you have to find pairs with maximum cost that do not exceed maximum similarity.
- Similarity means the number of common characters.
- Cost means the difference between lengths.
-
The second question was a dynamic programming problem similar to Longest Increasing Subsequence (LIS) with some twists.
Candidate's Approach
- For the first question, I used a brute force approach, which successfully solved the problem.
- I solved both problems fully in 30 minutes.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- The second part was a Work Simulation and Workstyles Assessments.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.