{"id":34534,"date":"2024-11-01T09:29:05","date_gmt":"2024-11-01T09:29:05","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=34534"},"modified":"2024-11-01T11:40:52","modified_gmt":"2024-11-01T11:40:52","slug":"javascript-coding-test-course-finding-the-order-of-building","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/34534\/","title":{"rendered":"JavaScript Coding Test Course, Finding the Order of Building"},"content":{"rendered":"

<\/p>\n

This article will discuss the ‘Building Order Problem’ among JavaScript coding test questions. This problem is an interesting one that can be solved using concepts from graph theory and topological sorting. Before we begin, let’s review the problem’s definition and requirements.<\/p>\n

Problem Definition<\/h2>\n

The problem is to determine the order in which all buildings must be constructed based on the given N buildings and their dependencies. If building A must be constructed before building B, then there is a dependency relationship between these two buildings.<\/p>\n

Input<\/h3>\n
\nInput is in the following format:\n- First line: N (number of buildings), M (number of dependencies)\n- Next M lines: A B (indicates that building A must be constructed before building B)\n    <\/code><\/pre>\n
Output<\/h3>\n
\nPrint a possible construction order of buildings, separated by spaces in one line. If the order is not possible, print \"Impossible\".\n    <\/code><\/pre>\n
Examples<\/h2>\n
Example 1<\/h3>\n
\nInput:\n4 2\n1 2\n2 3\n\nOutput:\n1 2 3 4\n    <\/code><\/pre>\n
Example 2<\/h3>\n
\nInput:\n3 3\n1 2\n2 3\n3 1\n\nOutput:\nImpossible\n    <\/code><\/pre>\n
Problem Solving Process<\/h2>\n
Topological Sorting<\/h3>\n
The most important concept for solving this problem is topological sorting. Topological sorting is a method of ordering the vertices of a directed graph considering their precedence relationships. For a topological sorting result to exist, the graph must not contain cycles. In other words, all dependencies must be clear to determine the order.<\/p>\n
Problem Solving Algorithm<\/h3>\n
The algorithm to solve the problem can be structured as follows.<\/p>\n
    \n
  1. Read the number of vertices (N) and the number of edges (M) in the graph.<\/li>\n
  2. Create an adjacency list for the graph while counting the number of buildings required to be constructed for each building (in-degree).<\/li>\n
  3. Add buildings with an in-degree of 0 to the queue.<\/li>\n
  4. Remove one building at a time from the queue, add it to the result list, and decrease the in-degree of the buildings that depend on it.<\/li>\n
  5. Add buildings whose in-degree becomes 0 to the queue.<\/li>\n
  6. After processing all buildings, if the length of the result list equals N, print the possible construction order; otherwise, print “Impossible”.<\/li>\n<\/ol>\n
    JavaScript Code Implementation<\/h3>\n
    \nfunction getConstructionOrder(N, M, dependencies) {\n    const graph = Array.from({ length: N + 1 }, () => []);\n    const indegree = Array.from({ length: N + 1 }, () => 0);\n    \n    \/\/ Add dependencies to the graph\n    for (const [a, b] of dependencies) {\n        graph[a].push(b);\n        indegree[b]++;\n    }\n    \n    const queue = [];\n    \n    \/\/ Add nodes with in-degree of 0\n    for (let i = 1; i <= N; i++) {\n        if (indegree[i] === 0) {\n            queue.push(i);\n        }\n    }\n    \n    const order = [];\n    \n    while (queue.length > 0) {\n        const current = queue.shift();\n        order.push(current);\n        \n        for (const neighbor of graph[current]) {\n            indegree[neighbor]--;\n            if (indegree[neighbor] === 0) {\n                queue.push(neighbor);\n            }\n        }\n    }\n\n    return order.length === N ? order : \"Impossible\";\n}\n\n\/\/ Test example\nconst N = 4;\nconst M = 2;\nconst dependencies = [[1, 2], [2, 3]];\nconst result = getConstructionOrder(N, M, dependencies);\nconsole.log(result.join(' ')); \/\/ Output: 1 2 3 4\n    <\/code><\/pre>\n
    Conclusion<\/h2>\n
    In this tutorial, we learned the concept of topological sorting and how to solve the ‘Building Order Problem’ in JavaScript. Through the process of constructing a graph based on arbitrary input and deriving the possible construction order from it, we hope to enhance your algorithm problem-solving skills. Similar problems may appear in various technical interviews, so continuous practice and understanding are necessary. Thank you!<\/p>\n
    References<\/h2>\n
    If you wish to deepen your understanding of related materials and algorithms, please refer to the resources below.<\/p>\n