Liftoff

Phone Interview: Outputting a matrix diagonally, not difficult. The first question was finding the shortest distance between two points in a graph. I mentioned BFS, but was asked if it could be faster, so I used bidirectional BFS. I hadn't written it before, but luckily it wasn't difficult, and I wrote and tested it on the spot. The second question was about Eddington numbers, which I found online, similar to Likou Erqis. Parsing IPv4 and IPv6, which I found online, but with more conditions to consider than Likou's, making it very complicated, involving five or six cases. I barely finished it, and the interviewer said it was already very good. Completing a count store on the spot in 90 minutes, also found online. Talking with the hiring manager. Surprisingly, there was no system design question. Their company is similar to ByteDance, requiring passing each stage individually. Finally, I didn't hear back for over a month, thinking I had failed. It turned out the hiring manager felt I wasn't suitable for the position (even though he was the one who initially encouraged me to apply), so we talked to another team. This hiring manager said they would send out an offer later.