Round 1
Questions: Specific question not provided.
Follow-up Question
- The interviewer extended the same question further, but specific follow-up questions were not detailed.
Candidate's Approach
- Initially started with an O(n^2) approach for the string and hashing question.
- After cross questioning, transitioned to an O(n * logn) solution.
- The interviewer seemed satisfied with the final approach.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
Given below pattern of license plates (Pattern only, not the actual list of license plates), Find the nth license plate. All license plates no are of size 5 chars. Eg, if n is 3, ans is - 00002 00000 00001 00002 ........ ........ 99999 0000A 0001A 0002A ........ ......... 9999A 0000B 0001B 0002B ........ ......... 9999B 0000C ........ ......... 9999Z 000AA 001AA ......... ......... 999AA 000AB .......... .......... 999ZZ 00AAA ........ ........ ZZZZZ
Candidate's Approach
- Discussed the approach with the interviewer but complicated it by covering multiple edge cases.
- Faced difficulties in coding due to the complexity of the approach.
- Managed to code it but struggled with dry running the code for all test cases provided by the interviewer.
Interviewer's Feedback
No feedback provided.