From ffef3863d9fab7cf92a8d28ab5d7af2b767a1498 Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Sun, 25 Jan 2026 11:41:44 -0500
Subject: [PATCH 1/2] Create courseSchedule.cpp

---
 courseSchedule.cpp | 38 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 courseSchedule.cpp

diff --git a/courseSchedule.cpp b/courseSchedule.cpp
new file mode 100644
index 00000000..172b965e
--- /dev/null
+++ b/courseSchedule.cpp
@@ -0,0 +1,38 @@
+class Solution {
+public:
+    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
+        vector<int> inorder(numCourses, 0);
+        unordered_map<int, vector<int>> um;
+
+        for (vector<int> courses : prerequisites) {
+            um[courses[1]].push_back(courses[0]);
+            inorder[courses[0]]++;
+        }
+
+        queue<int> q;
+
+        for (int i=0;i<inorder.size();i++) {
+            if (inorder[i] == 0) {
+                q.push(i);
+            }
+        }
+
+        int count = 0;
+
+        while (!q.empty()) {
+            int node = q.front();
+            count++;
+            q.pop();
+
+            for (auto itr: um[node]){
+                inorder[itr]--;
+                if (inorder[itr] == 0) {
+                    q.push(itr);
+                }
+            } 
+        }
+
+        return count == numCourses;
+
+    }
+};

From 55c045351cf1a1589175887a3704a804a73f4672 Mon Sep 17 00:00:00 2001
From: SUJAY GIJRE <sujaygijre@gmail.com>
Date: Sun, 25 Jan 2026 11:42:56 -0500
Subject: [PATCH 2/2] Create levelOrderTraversal.cpp

---
 levelOrderTraversal.cpp | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 levelOrderTraversal.cpp

diff --git a/levelOrderTraversal.cpp b/levelOrderTraversal.cpp
new file mode 100644
index 00000000..82cd67bd
--- /dev/null
+++ b/levelOrderTraversal.cpp
@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    vector<vector<int>> levelOrder(TreeNode* root) {
+        queue<TreeNode*> q;
+        if (root) q.push(root);
+
+        vector<vector<int>> answer;
+
+        while (!q.empty()) {
+            int size = q.size();
+            vector<int> temp;
+            while (size--) {
+                TreeNode *node = q.front();
+                q.pop();
+
+                temp.push_back(node->val);
+
+                if (node->left) q.push(node->left);
+                if (node->right) q.push(node->right);
+            }
+            answer.push_back(temp);
+        }
+        return answer;
+    }
+};