{ "data": { "question": { "questionId": "1959", "questionFrontendId": "1810", "boundTopicId": null, "title": "Minimum Path Cost in a Hidden Grid", "titleSlug": "minimum-path-cost-in-a-hidden-grid", "content": null, "translatedTitle": null, "translatedContent": null, "isPaidOnly": true, "difficulty": "Medium", "likes": 51, "dislikes": 17, "isLiked": null, "similarQuestions": "[{\"title\": \"Robot Room Cleaner\", \"titleSlug\": \"robot-room-cleaner\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Shortest Path in a Hidden Grid\", \"titleSlug\": \"shortest-path-in-a-hidden-grid\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", "exampleTestcases": "[[2,3],[1,1]]\n0\n1\n1\n0\n[[0,3,1],[3,4,2],[1,2,0]]\n2\n0\n0\n2\n[[1,0],[0,1]]\n0\n0\n1\n1", "categoryTitle": "Algorithms", "contributors": [], "topicTags": [ { "name": "Depth-First Search", "slug": "depth-first-search", "translatedName": null, "__typename": "TopicTagNode" }, { "name": "Breadth-First Search", "slug": "breadth-first-search", "translatedName": null, "__typename": "TopicTagNode" }, { "name": "Graph", "slug": "graph", "translatedName": null, "__typename": "TopicTagNode" }, { "name": "Heap (Priority Queue)", "slug": "heap-priority-queue", "translatedName": null, "__typename": "TopicTagNode" }, { "name": "Interactive", "slug": "interactive", "translatedName": null, "__typename": "TopicTagNode" } ], "companyTagStats": null, "codeSnippets": null, "stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 1750, \"totalSubmissionRaw\": 3272, \"acRate\": \"53.5%\"}", "hints": [ "The grid is at a maximum 100 x 100, so it is clever to assume that the robot's initial cell is grid[101][101]", "Run a DFS from the robot's position to make sure that you can reach the target, otherwise you should return -1.", "Now that you are sure you can reach the target and that you know the grid, run Dijkstra to find the minimum cost." ], "solution": null, "status": null, "sampleTestCase": "[[2,3],[1,1]]\n0\n1\n1\n0", "metaData": "{\n \"name\": \"findShortestPath\",\n \"params\": [\n {\n \"type\": \"integer[][]\",\n \"name\": \"grid\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"r1\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"c1\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"r2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"c2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"manual\": true,\n \"languages\": [\n \"cpp\",\n \"java\",\n \"python\",\n \"csharp\",\n \"javascript\",\n \"python3\"\n ]\n}", "judgerAvailable": true, "judgeType": "large", "mysqlSchemas": [], "enableRunCode": true, "enableTestMode": false, "enableDebugger": true, "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\\r\\n\\r\\n

Your code is compiled with debug flag enabled (/debug).

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"]}", "libraryUrl": null, "adminUrl": null, "challengeQuestion": null, "__typename": "QuestionNode" } } }