Round 1
Questions: Given a string, split it into two substrings and check whether both substrings can be palindromes by removing at most one character.
- The solution attempted was O(n^2), which resulted in a few test cases timing out (TLE). The approach involved running a loop to create two substrings for each index and then checking if both substrings could be palindromes.
Follow-up Question
What can be a better approach to do this in O(n)?
Candidate's Approach
The candidate attempted to solve the problem by creating two substrings for each index and checking if both could be palindromes. However, this resulted in a time complexity of O(n^2), leading to time limit exceeded (TLE) errors for some test cases.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: The second question was related to next permutation but with some special features. The candidate expressed that it took time to understand the problem.
Follow-up Question
The candidate wished they had gone through the discussion section related to Amazon OA beforehand.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Additional Questions
There were also system design questions and leadership skills questions focused on tackling problems and deciding on better approaches for availability and other system design concepts.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.