/*
Challenge
Have the function CityTraffic(strArr) read strArr which will be a representation of an undirected graph 
in a form similar to an adjacency list. Each element in the input will contain an integer which will 
represent the population for that city, and then that will be followed by a comma separated list of 
its neighboring cities and their populations (these will be separated by a colon). 
For example: strArr may be 
["1:[5]", "4:[5]", "3:[5]", "5:[1,4,3,2]", "2:[5,15,7]", "7:[2,8]", "8:[7,38]", "15:[2]", "38:[8]"]. 
This graph then looks like the following picture: 
 
Each node represents the population of that city and each edge represents a road to that city. 
Your goal is to determine the maximum traffic that would occur via a single road if everyone decided to go to that city. 
For example: if every single person in all the cities decided to go to city 7, then via the upper road the 
number of people coming in would be (8 + 38) = 46. If all the cities beneath city 7 decided to go to it via 
the lower road, the number of people coming in would be (2 + 15 + 1 + 3 + 4 + 5) = 30. 
So the maximum traffic coming into the city 7 would be 46 because the maximum value of (30, 46) = 46. 
Your program should determine the maximum traffic for every single city and return the answers in a 
comma separated string in the format: city:max_traffic,city:max_traffic,... 
The cities should be outputted in sorted order by the city number. 
For the above example, the output would therefore be: 
1:82,2:53,3:80,4:79,5:70,7:46,8:38,15:68,38:45. 
The cities will all be unique positive integers and there will not be any cycles in the graph. 
There will always be at least 2 cities in the graph. 
Hard challenges are worth 15 points and you are not timed for them.
Sample Test Cases
Input:"1:[5]", "2:[5]", "3:[5]", "4:[5]", "5:[1,2,3,4]"
Output:"1:14,2:13,3:12,4:11,5:4"
Input:"1:[5]", "2:[5,18]", "3:[5,12]", "4:[5]", "5:[1,2,3,4]", "18:[2]", "12:[3]"
Output:"1:44,2:25,3:30,4:41,5:20,12:33,18:27"
*/

function CityTraffic(strArr) {
    class Graph {
        constructor() {
            this.neighbours = [];
        }
        addPath(u, v) {
            if (this.neighbours[u] === undefined) this.neighbours[u] = [];
            this.neighbours[u].push(v);
            if (this.neighbours[v] === undefined) this.neighbours[v] = [];
            this.neighbours[v].push(u);
        }
    }

    // BFS algorithm
    function getShortestPath(graph, startNode, targetNode) {
        const queue = [ startNode ];
        const visited = { startNode: true };
        let tail = 0;
        const predecessor =  {};
        while (tail < queue.length) {
            let currentNode = queue[tail];
            tail ++;
            const neighbours = graph.neighbours[currentNode];
            for (let i = 0; i < neighbours.length; i++) {
                const neighbourNode = neighbours[i];
                if (!visited[neighbourNode]) {
                    visited[neighbourNode] = true;
                    if (neighbourNode === targetNode) {
                        const path = [ targetNode ];
                        while (currentNode !== startNode) {
                            path.push(currentNode);
                            currentNode = predecessor[currentNode];
                        } 
                        path.push(currentNode);
                        path.reverse();
                        return path.join("-");
                    }
                    predecessor[neighbourNode] = currentNode;
                    queue.push(neighbourNode);    
                }
            }
        }
        return "-1";
    }

    function addPaths(graph, str) {
        str = str.replace("[", "");
        str = str.replace("]", "");
        const foo = str.split(":");
        const node1 = foo[0];
        cities.push(node1);
        const neighbourCities = foo[1].split(",");
        neighbourCities.forEach(city => graph.addPath(node1, city));
    }

    const cityGraph = new Graph();
    const cities = [];
    strArr.forEach(c => addPaths(cityGraph, c));
    cities.sort(function(a, b) {
        return Number(a) > Number(b);
    });
    cities.forEach(c => console.log(c));
}

const input = ["1:[5]", "4:[5]", "3:[5]", "5:[1,4,3,2]", "2:[5,15,7]", "7:[2,8]", "8:[7,38]", "15:[2]", "38:[8]"];
console.log(CityTraffic(input));
 

Javascript Online Compiler

Write, Run & Share Javascript code online using OneCompiler's JS online compiler for free. It's one of the robust, feature-rich online compilers for Javascript language. Getting started with the OneCompiler's Javascript editor is easy and fast. The editor shows sample boilerplate code when you choose language as Javascript and start coding.

About Javascript

Javascript(JS) is a object-oriented programming language which adhere to ECMA Script Standards. Javascript is required to design the behaviour of the web pages.

Key Features

  • Open-source
  • Just-in-time compiled language
  • Embedded along with HTML and makes web pages alive
  • Originally named as LiveScript.
  • Executable in both browser and server which has Javascript engines like V8(chrome), SpiderMonkey(Firefox) etc.

Syntax help

STDIN Example

var readline = require('readline');
var rl = readline.createInterface({
  input: process.stdin,
  output: process.stdout,
  terminal: false
});

rl.on('line', function(line){
    console.log("Hello, " + line);
});

variable declaration

KeywordDescriptionScope
varVar is used to declare variables(old way of declaring variables)Function or global scope
letlet is also used to declare variables(new way)Global or block Scope
constconst is used to declare const values. Once the value is assigned, it can not be modifiedGlobal or block Scope

Backtick Strings

Interpolation

let greetings = `Hello ${name}`

Multi line Strings

const msg = `
hello
world!
`

Arrays

An array is a collection of items or values.

Syntax:

let arrayName = [value1, value2,..etc];
// or
let arrayName = new Array("value1","value2",..etc);

Example:

let mobiles = ["iPhone", "Samsung", "Pixel"];

// accessing an array
console.log(mobiles[0]);

// changing an array element
mobiles[3] = "Nokia";

Arrow functions

Arrow Functions helps developers to write code in concise way, it’s introduced in ES6.
Arrow functions can be written in multiple ways. Below are couple of ways to use arrow function but it can be written in many other ways as well.

Syntax:

() => expression

Example:

const numbers = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
const squaresOfEvenNumbers = numbers.filter(ele => ele % 2 == 0)
                                    .map(ele => ele ** 2);
console.log(squaresOfEvenNumbers);

De-structuring

Arrays

let [firstName, lastName] = ['Foo', 'Bar']

Objects

let {firstName, lastName} = {
  firstName: 'Foo',
  lastName: 'Bar'
}

rest(...) operator

 const {
    title,
    firstName,
    lastName,
    ...rest
  } = record;

Spread(...) operator

//Object spread
const post = {
  ...options,
  type: "new"
}
//array spread
const users = [
  ...adminUsers,
  ...normalUsers
]

Functions

function greetings({ name = 'Foo' } = {}) { //Defaulting name to Foo
  console.log(`Hello ${name}!`);
}
 
greet() // Hello Foo
greet({ name: 'Bar' }) // Hi Bar

Loops

1. If:

IF is used to execute a block of code based on a condition.

Syntax

if(condition){
    // code
}

2. If-Else:

Else part is used to execute the block of code when the condition fails.

Syntax

if(condition){
    // code
} else {
    // code
}

3. Switch:

Switch is used to replace nested If-Else statements.

Syntax

switch(condition){
    case 'value1' :
        //code
        [break;]
    case 'value2' :
        //code
        [break;]
    .......
    default :
        //code
        [break;]
}

4. For

For loop is used to iterate a set of statements based on a condition.

for(Initialization; Condition; Increment/decrement){  
//code  
} 

5. While

While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.

while (condition) {  
  // code 
}  

6. Do-While

Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.

do {  
  // code 
} while (condition); 

Classes

ES6 introduced classes along with OOPS concepts in JS. Class is similar to a function which you can think like kind of template which will get called when ever you initialize class.

Syntax:

class className {
  constructor() { ... } //Mandatory Class method
  method1() { ... }
  method2() { ... }
  ...
}

Example:

class Mobile {
  constructor(model) {
    this.name = model;
  }
}

mbl = new Mobile("iPhone");