Add solution #1791

Author: JoshCrozier

README.md

@@ -257,6 +257,7 @@
 1716|[Calculate Money in Leetcode Bank](./1716-calculate-money-in-leetcode-bank.js)|Easy|
 1748|[Sum of Unique Elements](./1748-sum-of-unique-elements.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
+1791|[Find Center of Star Graph](./1791-find-center-of-star-graph.js)|Easy|
 1832|[Check if the Sentence Is Pangram](./1832-check-if-the-sentence-is-pangram.js)|Easy|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1886|[Determine Whether Matrix Can Be Obtained By Rotation](./1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|

solutions/1791-find-center-of-star-graph.js

@@ -0,0 +1,28 @@
+/**
+ * 1791. Find Center of Star Graph
+ * https://leetcode.com/problems/find-center-of-star-graph/
+ * Difficulty: Easy
+ *
+ * There is an undirected star graph consisting of n nodes labeled from 1 to n. A star graph is a
+ * graph where there is one center node and exactly n - 1 edges that connect the center node with
+ * every other node.
+ *
+ * You are given a 2D integer array edges where each edges[i] = [ui, vi] indicates that there is an
+ * edge between the nodes ui and vi. Return the center of the given star graph.
+ */
+
+/**
+ * @param {number[][]} edges
+ * @return {number}
+ */
+var findCenter = function(edges) {
+  const set = new Set();
+  for (const edge of edges) {
+    for (const node of edge) {
+      if (set.has(node)) {
+        return node;
+      }
+      set.add(node);
+    }
+  }
+};