Helping the community
Q1. Implement cd. Given current working directory and argument move to final path E.g. cwd - /a/b/c arg - d Output - /a/b/c/d
Missed one case while explaining the solution. Interviewer corrected me. Interviewer while coding pointed out a case where solution wont work I was quickly able to understand why. Used stack
Q2. Given 2 linked list. Check whether the strings formed by the value of the linked list same.
link list A "he"->""->"ll"->"o"->""
link list B "hell"->"o"
Output -> true.
Used 2 pointer gave O(1) memory solution
Handled all the cases in one go.
Verdict -> Pass.
How to prepare for ML system Design. For full loop Coding is it LC hard or medium?
Comments (4)