Tencent

Coding and detail about tasks, How to write a LeetCode medium problem, How to write a LeetCode medium problem, How to write a LeetCode medium problem,How to write a LeetCode medium problem

2 Weeks, 5 round tech interviews, I was on the campus interview process. One of the problems is Given a n-by-n matrix, each cell has a value of either 0 or 1. A cell indicates a wall if its value is 1. Give the length of the shortest path from M[0][0

The interviewer made a cross-sea phone call to interview me. The interview was not a typical "Q&A" mode. He hopes you can say as much as you can to impress him, or he can gather enough information about you to write down. It feels like they are just