LeetCode Question · Aug 2023

Not OA: Solve Minimum cost path

SWE OA

132 views 3 replies

Question Details

Solve the following using Dijkstra with no queue. The Distance array that is computed is a 2D array. And ofcourse has to have seen /visited a 2d array. This is...

Full Details

🔒

Unlock all Square/Block questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a square/block interview for a swe role during the oa round reported in 2023.

It covers the following topics: Arrays, Graph, Matrix, Queue, Stack .

Topics

Arrays Graph Matrix Queue Stack

More Square/Block Interview Questions

← All Square/Block questions Square/Block Software Engineer Questions → All Graph Questions →