Add files via upload

Author: ankurmoh

Diff for: CourseSchedule.cpp

@@ -0,0 +1,35 @@
+class Solution {
+public:
+    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
+      int con=0,i,sz=prerequisites.size(),len,fron;
+        vector<int>indegree(numCourses,0);
+        vector<vector<int>>graph(numCourses);
+        for(i=0;i<sz;i++)
+        {
+            int from=prerequisites[i][1];
+            int to=prerequisites[i][0];
+            indegree[to]++;
+            graph[from].push_back(to);
+        }
+        queue<int>q;
+        for(i=0;i<numCourses;i++)
+        {
+            if(indegree[i]==0)
+                q.push(i);
+        }
+        while(!q.empty())
+        {
+            fron=q.front();
+            q.pop();
+            con++;
+            len=graph[fron].size();
+            for(i=0;i<len;i++)
+            {
+                indegree[graph[fron][i]]--;
+                if(indegree[graph[fron][i]]==0)
+                    q.push(graph[fron][i]);
+            }
+        }
+        return (con==numCourses);
+    }
+};

Diff for: LC_102.cpp

@@ -0,0 +1,39 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> levelOrder(TreeNode* root) {
+        vector<vector<int>>v;
+        vector<int>temp;
+        int count;
+        if(root==NULL)
+            return v;
+        queue<TreeNode*>q;
+        q.push(root);
+        while(!q.empty())
+        {
+            count=q.size();
+            temp.clear();
+            while(count>0)
+            {
+                TreeNode *x=q.front();
+                q.pop();
+                temp.push_back(x->val);
+                if(x->left)
+                    q.push(x->left);
+                if(x->right)
+                    q.push(x->right);
+                count--;
+            }
+            v.push_back(temp);
+        }
+        return v;
+    }
+};