gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Merge pull request #15622 from beaucarnes/fix/typo-adjacency-list-challenge

Browse Source 
fix typo on challenge (#15621)
This commit is contained in:
Dylan
2017-07-11 10:41:38 -05:00
committed by GitHub
parent 94c8679e19 4004c6454d
commit 357865ce41
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-data-structure-questions.json
View File

@ -2614,9 +2614,9 @@
"<blockquote>Node1: Node2, Node3<br>Node2: Node1<br>Node3: Node1</blockquote>", "<blockquote>Node1: Node2, Node3<br>Node2: Node1<br>Node3: Node1</blockquote>",
"Above is an undirected graph because <code>Node1</code> is connected to <code>Node2</code> and <code>Node3</code>, and that information is consistent with the connections <code>Node2</code> and <code>Node3</code> show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then <code>Node2: Node1</code> would mean there the directed edge is pointing from <code>Node2</code> towards <code>Node1</code>.", "Above is an undirected graph because <code>Node1</code> is connected to <code>Node2</code> and <code>Node3</code>, and that information is consistent with the connections <code>Node2</code> and <code>Node3</code> show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then <code>Node2: Node1</code> would mean there the directed edge is pointing from <code>Node2</code> towards <code>Node1</code>.",
"We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.", "We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.",
"<blockquote>var undirectedG = {<br> Node1: [\"Node2\", \"Node3\"],<br> Node2: [\"Node1\"],<br> Node3: [\"Node3\"]<br>};</blockquote>", "<blockquote>var undirectedG = {<br> Node1: [\"Node2\", \"Node3\"],<br> Node2: [\"Node1\"],<br> Node3: [\"Node1\"]<br>};</blockquote>",
"This can also be more simply represented as an array where the nodes just have numbers rather than string labels.", "This can also be more simply represented as an array where the nodes just have numbers rather than string labels.",
"<blockquote>var undirectedGArr = [<br> [1, 2], # Node1<br> [0], # Node2<br> [2] # Node3<br>];</blockquote>", "<blockquote>var undirectedGArr = [<br> [1, 2], # Node1<br> [0], # Node2<br> [0] # Node3<br>];</blockquote>",
"<hr>", "<hr>",
"Create a social network as an undirected graph with 4 nodes/people named <code>James</code>, <code>Jill</code>, <code>Jenny</code>, and <code>Jeff</code>. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny." "Create a social network as an undirected graph with 4 nodes/people named <code>James</code>, <code>Jill</code>, <code>Jenny</code>, and <code>Jeff</code>. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny."
], ],