Staff Level (L6+) Dedicated Coaching Session: Shortest Path in Binary Matrix
1 هزار بار بازدید -
4 ماه پیش
-
This is a dedicated coaching
This is a dedicated coaching session with a staff-level FAANG engineer in which the candidate attempts to solve the Shortest Path in Binary Matrix problem. The targetted level is L6/E6/Staff. The aim of this session is to improve the candidate's skills in data structure & algorithm interviews. The session is conducted in Java language. Ultimately the candidate did not pass in this session but gained valuable insight into areas of improvement as well as a road map to work on.
📒 See the interviewer's feedback and transcript here: https://interviewing.io/mocks/faang-java-shortest-path-in-binary-matrix
👉 Sign up to book a mock interview just like this one or to watch more interviews in our showcase: https://www.interviewing.io/
📘 Or view other Java interviews: https://interviewing.io/mocks?language=java
❗ Disclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee, and all interviews are anonymous. interviewing.io has the sole right to distribute this content.
Timestamps:
https://www.seevid.ir/fa/w/_nuWBsy75kc Introduction and level setting
https://www.seevid.ir/fa/w/_nuWBsy75kc Question starts: Shortest Path in Binary Matrix
https://www.seevid.ir/fa/w/_nuWBsy75kc Coding begins (assisted by coach)
https://www.seevid.ir/fa/w/_nuWBsy75kc Discussing how the candidate felt about their solution
https://www.seevid.ir/fa/w/_nuWBsy75kc Feedback from the coach
https://www.seevid.ir/fa/w/_nuWBsy75kc What to do when running short on time (time/space complexity)
https://www.seevid.ir/fa/w/_nuWBsy75kc Terminating condition
https://www.seevid.ir/fa/w/_nuWBsy75kc Bonus advice from coach
https://www.seevid.ir/fa/w/_nuWBsy75kc Questions from the candidate
4 ماه پیش
در تاریخ 1403/02/21 منتشر شده
است.
1,030
بـار بازدید شده