feat: solve Striver SDE Sheet problem 234 - Is Graph Bipartite?

Author: TechnoBlogger14o3

striver-sde-sheet/234-785-Is-Graph-Bipartite/README.md

@@ -0,0 +1,22 @@
+# Is Graph Bipartite? (Medium)
+
+**Problem ID:** 785  
+**Problem Number:** 234  
+**Link:** https://leetcode.com/problems/is-graph-bipartite
+
+## Problem Statement
+
+There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array graph, where graph[u] is an array of nodes that node u is adjacent to. More formally, for each v in graph[u], there is an undirected edge between node u and node v. The graph has the following properties:
+
+
+	There are no self-edges (graph[u] does not contain u).
+	There are no parallel edges (graph[u] does not contain duplicate values).
+	If v is in graph[u], then u is in graph[v] (...
+
+## Solutions
+
+- Python: `solution.py`
+- Java: `solution.java`
+- JavaScript: `solution.js`
+
+**Note:** Solutions need to be implemented.

striver-sde-sheet/234-785-Is-Graph-Bipartite/solution.java

@@ -0,0 +1,7 @@
+// Solution for Is Graph Bipartite?
+// Problem ID: 785
+// Link: https://leetcode.com/problems/is-graph-bipartite
+
+class Solution {
+    // TODO: Implement solution
+}

striver-sde-sheet/234-785-Is-Graph-Bipartite/solution.js

@@ -0,0 +1,10 @@
+// Solution for Is Graph Bipartite?
+// Problem ID: 785
+// Link: https://leetcode.com/problems/is-graph-bipartite
+
+/**
+ * TODO: Implement solution
+ */
+var solve = function() {
+    // Implementation needed
+};

striver-sde-sheet/234-785-Is-Graph-Bipartite/solution.py

@@ -0,0 +1,8 @@
+# Solution for Is Graph Bipartite?
+# Problem ID: 785
+# Link: https://leetcode.com/problems/is-graph-bipartite
+
+class Solution:
+    def solve(self):
+        # TODO: Implement solution
+        pass