Solved Course Schedule II (LeetCode 210 | Graph | Medium) and updated Readme.md (#106)

Author: MorviBhojwani

Diff for: C++/Course-Schedule-II.cpp

@@ -0,0 +1,47 @@
+//CPP BFS solution
+//Time complexity O(V+E)
+//Space Complexity O(V)
+class Solution {
+public:
+    vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {
+        int n=numCourses;
+        int m=prerequisites.size();
+        vector<int>ans;
+        vector<int>v(n,0);
+        vector<vector<int>>g(n);
+        
+        
+        for(int i=0;i<m;i++){
+            g[prerequisites[i][1]].push_back(prerequisites[i][0]);
+            v[prerequisites[i][0]]++;
+        }
+        queue<int>q;
+        for(int i=0;i<n;i++){
+            if(v[i]==0){
+                q.push(i);
+            }
+        }
+        int c=0;
+        while(!q.empty()){
+            int j=q.front();
+            q.pop();
+            ans.push_back(j);
+            cout<<j<<" ";
+            c++;
+            for(int i=0;i<g[j].size();i++){
+                v[g[j][i]]--;
+                //cout<<v[g[j][i]]<<" ";
+                if(v[g[j][i]]==0){
+                    
+                    q.push(g[j][i]);
+                }
+            }
+        }
+        if(ans.size()!=n){
+            return {};
+        }
+        else{
+            return ans;
+        }
+    }
+};

Diff for: README.md

@@ -362,6 +362,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | [C++](./C++/Critical-Path-Sum-II.cpp) | _O(V+E)_ | _O(V)_ | Medium     | Graph | DFS                    |
 | 785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)                                   | [C++](./C++/Is-Graph-Bipartite.cpp)                        | _O(V+E)_ | _O(V)_  | Medium     | Graph | BFS |
 | 947 | [Most Stones Removed with Same Row or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/)                                   | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp)         | _O(V)_ | _O(2V)_  | Medium     | Graph | Union Find |                                 | [C++](./C++/Most-Stones-Removed-with-Same-Row-or-Column.cpp)         | _O(V)_ | _O(2V)_  | Medium     | Graph | Union Find |
+| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)                                   | [C++](./C++/Course-Schedule-II.cpp)                        | _O(V+E)_ | _O(V)_  | Medium     | Graph | BFS |
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>