Programming homework: problem on the Daiksta algorithm, the distance between a given pair of vertices. Additional condition: we are asked to return an error if there are several shortest distances. Behavioral Interview: a typical conversation about experience, motivation, previous job, etc.