My contribution back to LC folks
Code1:
1.NestedList sum values multiplied by depth
Code 2:
1.Get all subsets within int array of numbers
2.Find shortest path in 2Dmatrix with obstacles, and return the path coordinates
Fully solved working solutoins, optimal and bug free. Went few minute overtime. Had mistakes with space complexity for both questoins
Behavioral:
Proudest project
Describe when was there changing requirement in project
When did you accept feedback to improve on mistake
was 1 more
Was getting fatigue and gave bad example before fully understanding what was being asked. Was feeling and sounded low energy
System 1: design news Feed for just images, require low latency
FInished base HLD, good requirements clarifying and good questions.
I took the lead throughout, aside from interruptions pushing to finish API before deep dive. Didn't have a lot of time to go into deep dive
What's are the chances?