id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<bool> visited;\n bool canFinish(int n, vector<vector<int>>& prereq) {\n vector<vector<int>> base_derived(n, vector<int> ()), derived_base(n, vector<int> ());\n\n for(int i = 0; i < prereq.size(); i++){\n base_derived[prereq[i][1]].push_back(... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> graph;\n unordered_map<int, bool> visited;\n for (vector<int> prerequisite: prerequisites) {\n graph[prerequisite[0]].push_back(prerequisite[... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> graph;\n unordered_map<int, bool> visited;\n for (vector<int> prerequisite: prerequisites) {\n graph[prerequisite[0]].push_back(prerequisite[... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n int dfs(map<int, vector<int>> &graph, int curr, vector<int> &topo, vector<int> &vis){\n if(vis[curr]==1)\n {\n return true;\n }\n if(vis[curr]==2)\n {\n return false;\n }\n vis[curr] = 1;\n int an... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool detectCycle(int node, vector<bool> &pathVis, vector<bool> &visited, vector<vector<int>> &graph){\n if(pathVis[node]) return false;\n pathVis[node] = true;\n if(visited[node]){\n pathVis[node] = false;\n return true;\n }\n... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool detectCycle(int node,unordered_map<int,vector<int>> &adjList,vector<int> &visited){\n visited[node]=1;\n\n for(int adj:adjList[node]){\n if(visited[adj]==0){\n if(detectCycle(adj,adjList,visited)){\n return true;... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\n bool dfs(unordered_map<int, vector<int>>& adjList, int source, vector<bool>& visited, vector<bool>& inStack) {\n visited[source] = true;\n inStack[source] = true;\n for (auto neighbor : adjList[source]) {\n if (!visited[neighbor]) { if (!dfs(adjList, ne... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\n\n\n bool dfs(int node , vector<vector<int>>&adj , vector<bool>&visited , vector<bool>&pathVisited){\n\n visited[node] = true;\n\n pathVisited[node] = true;\n\n for(auto v : adj[node]){\n\n if(!visited[v]) {\n if(dfs(v , adj , visited,pa... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool cycle(int node,unordered_map<int,bool>&visited, unordered_map<int,bool>&dfsvis, unordered_map<int,list<int>>&adj){\n visited[node]=1;\n dfsvis[node]=1;\n\n for(auto i : adj[node]){\n if(!visited[i]){\n bool detect=cycle(i, ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\nprivate:\n bool isCycled(unordered_map<int, vector<int>>& adj, int u,\n vector<bool>& visited, vector<bool>& isRecursion) {\n visited[u] = true;\n isRecursion[u] = true;\n for (int& v : adj[u]) {\n if (!visited[v] && isCycled(adj, v, vis... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n int VISITED=2;\n int VISITING=1;\n int UNVISITED=0;\n\n bool dfs(int i, vector<int> &states, vector<vector<int>> &adj) {\n vector<int> a=adj[i];\n\n if(states[i]==VISITED) return 1;\n if(states[i]==VISITING) return 0;\n\n states[i]=VISITIN... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> graph;\n for(auto x: prerequisites) {\n int u = x[0];\n int v = x[1];\n graph[v].push_back(u);\n }\n \n v... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n void fullfillCourseInfo(\n const int& numCourses,\n const vector<vector<int>>& prerequisites,\n unordered_map<int, vector<int>>& course_children,\n unordered_map<int, int>& course_indegree) {\n\n for (int i = 0; i < numCourses; i++) {\n ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> premap(numCourses);\n for (const auto& prereq : prerequisites) {\n premap[prereq[1]].push_back(prereq[0]);\n }\n\n unordered_set<int> ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinishPrereq(int sub, vector<vector<int>> &adj, vector<bool> &isVisited, vector<bool> &isCompleted){\n isVisited[sub] = true;\n for(int i=0;i<adj[sub].size();i++){\n if(isCompleted[adj[sub][i]]) continue;\n if(!isVisited[adj[sub][i]... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n\n unordered_map<int,vector<int>>adj; \n\n for(auto edge:prerequisites){\n adj[edge[1]].push_back(edge[0]); \n }\n\n unordered_map<int,int>indegree; \n\n for(in... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> in( numCourses, 0 );\n unordered_set<int> s;\n\n unordered_map<int, vector<int>> mp;\n for( auto i : prerequisites ){\n int u = i[0], v = i[1];\n ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n // build graph\n vector<vector<int>> graph(numCourses); // adj list\n for(vector<int> pre : prerequisites) {\n graph[pre[0]].push_back(pre[1]); // all prereq are unique entr... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n int courseCount = 0;\n queue<int> bfsQueue;\n unordered_map<int, int> preReqMap;\n unordered_map<int, vector<int>> graph;\n\n for(auto preReq: prerequisites) {\n ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int n, vector<vector<int>>& edges) {\n map<int,list<int>> adj;\n for(int i=0;i<edges.size();i++){\n int u=edges[i][1];\n int v=edges[i][0];\n adj[u].push_back(v);\n }\n\n vector<int> inorder(n,0);\n ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool dfs(int course, set<int>& visited, map<int, vector<int>>& reqmap) {\n if (visited.find(course) != visited.end()) return false;\n if (reqmap[course].empty()) return true;\n\n visited.insert(course);\n\n for (int i=0;i<reqmap[course].size();i++)... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\n unordered_map<int, vector<int>> graph;\n unordered_set<int> visited;\n\n bool hasCycle(int course, vector<bool>& path) {\n visited.insert(course);\n path[course] = true;\n\n for (const int pre : graph[course]) {\n if ((!visited.count(pre) && hasCy... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int n, vector<vector<int>>& prerequisites) {\n unordered_map<int,vector<int>> adjList;\n for(auto i:prerequisites){\n adjList[i[1]].push_back(i[0]);\n }\n\n unordered_map<int,int> indegree;\n for(auto i:adjList){\n ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n queue<int> heads; // indegree 0\n int courses = numCourses; // 0 to n-1\n vector<int> indegrees(numCourses, 0);\n unordered_map<int, unordered_set<int>> graph; // prereqs -> its... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n \n \n // Create the map\n unordered_map<int, vector<int>> graph;\n unordered_map<int, int> incomingEdges;\n // Create the graph \n for(int i = 0; i <... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n \n \n // Create the map\n unordered_map<int, vector<int>> graph;\n unordered_map<int, int> incomingEdges;\n // Create the graph \n for(int i = 0; i <... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n typedef unordered_map<int, vector<int>> adj_map_t; // key - source, value - list of destinations\n\n bool isTree(int node, adj_map_t& adj_map, vector<bool>& visited, vector<bool> path)\n {\n visited[node] = true;\n path[node] = true;\n vector<int>::... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool detectCycle(vector<vector<int>>& graph, int node, vector<bool>& visited, vector<bool> currentPath) {\n if (currentPath[node])\n return true;\n if (visited[node])\n return false;\n currentPath[node] = true;\n visited[node]... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> buildGraph(int numCourses,\n vector<vector<int>>& prerequisites) {\n vector<vector<int>> graph(numCourses);\n for (int i = 0; i < prerequisites.size(); ++i) {\n int course1 = prerequisites[i][0];\n... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool isCycle(unordered_map<int,vector<int>> &graph,unordered_map<int,bool> &recst,unordered_map<int,bool> &vis,int course){\n recst[course] = true;\n vis[course] = true;\n for(auto v : graph[course]){\n if(vis[v]==false && isCycle(graph,recst,v... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool detectCycle(int i, map<int, set<int>>&graph, vector<bool>recStack, vector<bool>&visited){\n visited[i]=true;\n recStack[i]=true;\n for(auto c: graph[i]){\n if(recStack[c] || (!visited[c] && !detectCycle(c, graph, recStack, visited)))return ... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n bool canFinish(int numCourses, vector<vector<int>>& pre) {\n unordered_set<int> taken;\n unordered_map<int, unordered_set<int>> courseToRequirements;\n unordered_map<int, vector<int>> requirementToCourses;\n\n for (int i = 0; i < pre.size(); i++) {... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n bool answer = true;\n\n void DFS(int node, unordered_map<int, unordered_set<int>>& graph, unordered_map<int, int>& visited) {\n visited[node] = 1;\n for (int neighbor : graph[node]) {\n if (visited[neighbor] == 0) {\n DFS(neighbor,... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n void topSortBfs(int n, vector<int>& topoOrder,unordered_map<int , list<int> >& adjList ) {\n\t\tqueue<int> q;\n\t\tunordered_map<int,int> indegree;\n\t\t\n\t\t//initialise kardi indegree sabki\n\t\tfor( auto i : adjList) {\n\t\t\tfor(auto nbr: i.second) {\n\t\t\t\tindegree[nb... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n void toposortbfs(int n, vector<int> &toposort,unordered_map<int,list<int>> &adj){\n queue<int> q;\n map<int,int> indegree;\n\n for(auto i: adj){\n for(auto nbr: i.second){\n indegree[nbr]++;\n }\n }\n\n f... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n // Courses where I have a dependency, courses that have a dependency on me\n unordered_map<int, pair<unordered_set<int>, unordered_set<int>>> graph;\n for (int i = 0; i < numCourses;... |
207 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {\n // Courses where I have a dependency, courses that have a dependency on me\n unordered_map<int, pair<unordered_set<int>, unordered_set<int>>> graph;\n for (int i = 0; i < numCourses;... |
209 | <p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, ... | 1 | {
"code": "/* Your implementation of `Solution` goes here. */\nclass Solution {\npublic:\n int minSubArrayLen(int target, vector<int>& nums) {\n int len = nums.size();\n int j = 0;\n int sum = 0, min = len + 1;\n for(int i = 0; i < len; i++) {\n sum += nums[i];\n i... |
209 | <p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, ... | 1 | {
"code": "class Solution {\npublic:\n int minSubArrayLen(int s, vector<int>& nums) {\n int l = 0, r = 0, n = nums.size(), sum = 0, len = INT_MAX;\n while (r < n) {\n sum += nums[r++];\n while (sum >= s) {\n len = min(len, r - l);\n sum -= nums[l++]... |
209 | <p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, ... | 3 | {
"code": "class Solution {\npublic:\n int minSubArrayLen(int target, vector<int>& nums) {\n int sum=0;\n\n int start=0,end=0,total=INT_MAX;\n while(end<nums.size()){\n sum+=nums[end];\n while(sum>=target){\n total=min(total,end-start+1);\n s... |
209 | <p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, ... | 3 | {
"code": "class Solution {\npublic:\n int minSubArrayLen(int target, vector<int>& nums) {\n int res = INT_MAX;\n int left = 0;\n int sum = 0;\n for (int i = 0; i < nums.size(); i++) {\n sum += nums[i];\n while (sum >= target) {\n res = min(res, i - ... |
209 | <p>Given an array of positive integers <code>nums</code> and a positive integer <code>target</code>, return <em>the <strong>minimal length</strong> of a </em><span data-keyword="subarray-nonempty"><em>subarray</em></span><em> whose sum is greater than or equal to</em> <code>target</code>. If there is no such subarray, ... | 3 | {
"code": "class Solution {\npublic:\n int minSubArrayLen(int target, vector<int>& nums) {\n int sum = 0;\n int start = 0;\n int end = 0;\n int result = nums.size() + 1;\n while (end < nums.size()) {\n sum = sum + nums[end];\n printf(\"add %d, sum = %d\\n\",... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n \n int n=numCourses;\n queue<int> q;\n vector<int> indegree(n,0);\n\n for(auto& pre: prerequisites){\n indegree[pre[0]]++;\n }\n for(int ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n\n int indegree[numCourses];\n\n for(int i=0;i<numCourses;i++)\n {\n indegree[i]=0;\n }\n\n for(int i=0;i<prerequisites.size();i++)\n {\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n\n int indegree[numCourses];\n\n for(int i=0;i<numCourses;i++)\n {\n indegree[i]=0;\n }\n\n for(int i=0;i<prerequisites.size();i++)\n {\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n\n int indegree[numCourses];\n\n for(int i=0;i<numCourses;i++)\n {\n indegree[i]=0;\n }\n\n for(int i=0;i<prerequisites.size();i++)\n {\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\nvector<int> topo(int n, vector<vector<int>>&g){\n vector<int>ans;\n queue<int>q;\n vector<int>indegree(n,0);\n// int n=g.size();\n for(int i=0;i<g.size();i++){\n indegree[g[i][0]]++;\n }\n for(int i=0;i<n;i++){\n if(indegree[i]==0)\n q.push(... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "const int N = 2024;\nvector<int> g[N];\n\nclass Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> blocks(numCourses, 0);\n for (const auto& v : prerequisites) {\n int c = v[0];\n int dep = v[1];\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "const int N = 2005;\nvector<int>ad_list[N];\nint vis[N],col[N];\nbool cycle;\nvector<int>ans;\nvoid detectCycle(int u)\n{\n col[u] = 1;\n for(auto &j:ad_list[u])\n {\n if(!col[j])\n detectCycle(j);\n else if(col[j] == 1)\n cycle = true;\n }\n col[u] = 2;\n... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& pre) {\n \n int m = pre.size();\n\n vector<int> adj[n];\n vector<int> degree(n,0);\n for(int i=0;i<m;i++)\n {\n adj[pre[i][1]].push_back(pre[i][0]);\n deg... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> adj[numCourses]; \n vector<int> indegree(numCourses, 0); \n for (auto& pre : prerequisites) {\n int u = pre[1]; \n int v = pre[0]; \n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int V, vector<vector<int>>& pre) {\n vector<int> adj[V];\n vector<int> indeg(V,0);\n vector<int> ans;\n queue<int> q;\n\n for(int i = 0;i<pre.size();i++){\n adj[pre[i][1]].push_back(pre[i]... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int courses, vector<vector<int>>& pre) {\n vector<int> adj[courses];\n for (int i = 0; i < pre.size(); i++) {\n adj[pre[i][1]].push_back(pre[i][0]);\n }\n vector<int> indegree(courses, 0);\n for(int i=0;i<cou... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<vector<int>> adjList(numCourses);\n vector<int> indegree(numCourses, 0);\n vector<int> order;\n queue<int> q;\n \n for (const auto& prereq : prerequi... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<vector<int>> graph(numCourses);\n vector<int> indegree(numCourses, 0);\n \n // Build the graph and track the indegree of each node (course)\n for (int i = 0... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n bool dfs(int i, vector<int> g[], vector<int> &visit, vector<int> &ans){\n visit[i] = 1;\n for(int x : g[i]){\n if(visit[x] == 1 || (visit[x] == 0 && !dfs(x, g, visit, ans)))\n return false;\n }\n visit[i] = 2;\n ans... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& a) {\n vector<vector<int>> graph(n);\n\n vector<int> indegree(n, 0);\n for (int i=0; i<a.size(); i++) {\n int course_1 = a[i][0];\n int course_2 = a[i][1];\n\n graph[course... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int>indegree(numCourses,0);\n vector<vector<int>>adj(numCourses);\n for(auto &it:prerequisites){\n indegree[it[0]]++;\n adj[it[1]].push_back(it[0]);... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites)\n {\n vector<int> indegree(numCourses);\n vector<vector<int>> adj(numCourses);\n for(auto& edge: prerequisites)\n {\n adj[edge[1]].push_back(edge[0]);\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n int V=numCourses;\n vector<int> indegree(V,0);\n vector<int> adj[numCourses];\n vector<int> ans;\n for(auto it:prerequisites){\n adj[it[1]].push_back(it... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> indegree(numCourses, 0);\n vector<int> adj[numCourses];\n for (vector<int> prerequisite: prerequisites) {\n adj[prerequisite[1]].push_back(prerequisite[0]... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n int V=numCourses;\n vector<int> indegree(V,0);\n vector<int> adj[numCourses];\n vector<int> ans;\n for(auto it:prerequisites){\n adj[it[1]].push_back(it... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int>khan(int k,vector<vector<int>>& prerequisites){\n vector<int>graph[k];\n vector<int> degree(k);\n for(auto i:prerequisites){\n graph[i[1]].push_back(i[0]);\n degree[i[0]]++;\n }\n queue<int>q;\n for(int i=0;i<k;i+... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& prerequisites) {\n vector<int> adj[n];\n vector<int> indegree(n,0);\n vector<int> ans;\n for(auto x:prerequisites){\n adj[x[1]].push_back(x[0]);\n indegree[x[0]]++;\n }\... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int V, vector<vector<int>>& prerequisites) {\n vector<int>adj[V] ;\nfor(auto it : prerequisites){\n adj[it[1]].push_back(it[0]);\n}\n\t \n\t queue<int> q ;\n\t vector<int> topo ; \n\t vector<int>indeg(V,0);\n\t \n\t for(int i... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int>adj[numCourses];\n for(auto it:prerequisites )\n {\n adj[it[1]].push_back(it[0]); // for clarification see course schedule 1\n }\n int V=numCour... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> ans;\n vector<int> indegrees(numCourses);\n queue<int> q;\n vector<vector<int>> adj(numCourses);\n for(auto i: prerequisites) {\n adj[i[0]... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n void dfs(vector<int> graph[], int u, vector<bool>& visited,\n stack<int>& st) {\n visited[u] = true;\n for (int v : graph[u]) {\n if (visited[v] == false) {\n dfs(graph, v, visited, st);\n }\n }\n st... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n void dfs(vector<int> graph[], int u, vector<bool>& visited,\n stack<int>& st) {\n visited[u] = true;\n for (int v : graph[u]) {\n if (visited[v] == false) {\n dfs(graph, v, visited, st);\n }\n }\n st... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> indegree(numCourses);\n vector<vector<int>> adj(numCourses);\n for(auto it: prerequisites){\n adj[it[1]].push_back(it[0]);\n indegree[it[0]]++;... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> Kahn(int n, unordered_map<int,vector<int>>& adj, vector<int>& indegree, vector<int> order){\n queue<int>q;\n int count=0;\n for(int i=0;i<n;++i){\n if(indegree[i]==0){\n count++;\n q.push(i); //push the... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n bool iscycle(vector<int> adj[],vector<int> &vis, vector<int>& rec, vector<int>& st, int id){\n if (!vis[id]) {\n vis[id] = 1;\n rec[id] = 1;\n for (auto it: adj[id]) {\n if (!vis[it] && iscycle(adj, vis, rec, st, it))\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "// Graphs Adjacency Lists - Depth First Search (DFS) | Topological Sort approach\n// T & M: O(n + p), where n = num of courses & p = num of prerequesites\n\nclass Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n // map (key) courses -> (val) list... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> prereqs[2001];\n for (const vector<int>& pres : prerequisites)\n prereqs[pres[0]].push_back(pres[1]);\n\n vector<int> order;\n char visited[2001] =... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> prereqs[2001];\n for (const vector<int>& pres : prerequisites)\n prereqs[pres[0]].push_back(pres[1]);\n\n vector<int> order;\n char visited[2001] =... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int,vector<int>> g;\n for (vector<int> &p : prerequisites) {\n g[p[1]].push_back(p[0]);\n }\n vector<int> colors(numCourses, 0);\n vector<... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n void dfs(int i,vector<int>adj[],vector<bool>&visited,vector<int>&final)\n {\n if(visited[i])\n return;\n visited[i]=true;\n for(int j:adj[i])\n {\n dfs(j,adj,visited,final);\n }\n final.push_back(i);\n }\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\n unordered_map<int, vector<int>> edges;\n unordered_map<int, int> indegree;\n\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n // prerequisites[i] = [ai, bi]. bi -> ai\n for (const auto& prereq : prerequisites) {\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& prerequisites) {\n vector<vector<int>> adj(n);\n for (auto ar: prerequisites) {\n adj[ar[0]].push_back(ar[1]);\n }\n int cycle = 0;\n vector<int> vis(n);\n vector<int> order... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "\nclass Solution {\n\nprivate:\n\n bool dfscheck(int node, vector<vector<int>>& adj, vector<int>& vis, vector<int>& pathVis, vector<int>& result) {\n vis[node] = 1;\n pathVis[node] = 1;\n\n // Traverse for adjacent nodes\n for (auto it : adj[node]) {\n if (!vis[it]... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\nprivate:\n vector<vector<int>> createGraph(vector<vector<int>>& edges, vector<int>& ind, int v){\n vector<vector<int>> adjL(v);\n\n for(auto it:edges){\n adjL[it[1]].push_back(it[0]);\n ind[it[0]]++;\n }\n return adjL;\n }\n\n boo... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& pr) {\n vector<vector<int>> prereqs(n);\n // courses with no prereqs\n vector<vector<int>> adj(n);\n vector<int> courses;\n for(int i=0; i<pr.size(); i++){\n int a = pr[i][0];\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& pre) {\n unordered_map<int, vector<int>> adj;\n vector<int> inDegree(n,0);\n vector<int> order;\n for(auto e: pre) {\n adj[e[1]].push_back(e[0]);\n inDegree[e[0]]++;\n }... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> map;\n unordered_map<int, int> inDegree;\n vector<int> classes;\n for(int i = 0; i < numCourses; i++){\n vector<int> temp;\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, list<int>> graph;\n vector<int> indegree(numCourses, 0);\n for(auto it: prerequisites) {\n graph[it[1]].push_back(it[0]); \n indegree[... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n void topo(vector<vector<int>> &adjl, vector<int> &sorted, vector<bool> &visited, int x){\n visited[x] = true;\n\n for (int n: adjl[x]){\n if (!visited[n]){\n topo(adjl, sorted, visited, n);\n }\n }\n\n sorted.pu... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> in( numCourses, 0 );\n unordered_map<int, vector<int>> mp;\n unordered_set<int> s;\n \n for( auto i : prerequisites ){\n int u = i[0], v = i... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<int> indegree(numCourses);\n vector<vector<bool>> graph(numCourses, vector<bool>(numCourses));\n for (const auto& prerequisite : prerequisites) {\n indegree[pr... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> cpMap;\n vector<bool> visiting(numCourses, false);\n vector<int> result;\n\n for (const auto& edge : prerequisites) {\n cpMap[e... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n\n unordered_map<int,vector<int>>adj; \n\n for(auto edge:prerequisites){\n adj[edge[1]].push_back(edge[0]); \n }\n\n unordered_map<int,int>indegree; \n\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n int dfs(map<int, vector<int>> &graph, int curr, vector<int> &topo, vector<int> &vis){\n if(vis[curr]==1)\n {\n return true;\n }\n if(vis[curr]==2)\n {\n return false;\n }\n vis[curr] = 1;\n int an... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n\n int dfs(map<int, vector<int>> &graph, int curr, vector<int> &topo, vector<int> &vis){\n if(vis[curr]==1)\n {\n return true;\n }\n if(vis[curr]==2)\n {\n return false;\n }\n vis[curr] = 1;\n int an... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& edges) {\n map<int,list<int>> adj;\n for(int i=0;i<edges.size();i++){\n int u=edges[i][1];\n int v=edges[i][0];\n adj[u].push_back(v);\n }\n\n vector<int> inorder(n,... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\nprivate:\n vector<int> topologicalSort;\n bool cycleDetect(vector<vector<int>>& graph, int currentNode, vector<bool>& visited, vector<bool>& recStack) {\n visited[currentNode]=true;\n recStack[currentNode]=true;\n for(int adjNode: graph[currentNode]) {\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n vector<vector<int>> graph(numCourses);\n for(auto& a: prerequisites){\n graph[a[0]].push_back(a[1]);\n }\n vector<int> order;\n unordered_set<int> inOrd... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n set<int> visited;\n set<int> cycle;\n map <int, vector<int>> mp;\n vector<int> output;\n\n bool dfs (int Course){\n if (cycle.find (Course) != cycle.end ()){\n return false;\n }\n if (visited.find (Course) != visited.end ()){\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n void DFS(unordered_map<int,vector<int>>&mp, int course, vector<int>&ans, vector<bool>&completed, bool ¬Possible, \n vector<bool>&visited)\n {\n if(notPossible){\n return;\n }\n visited[course] = true;\n for(auto &i : mp... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n set<int> visited;\n set<int> cycle;\n map <int, vector<int>> mp;\n vector<int> output;\n\n bool dfs (int Course){\n if (cycle.find (Course) != cycle.end ()){\n return false;\n }\n if (visited.find (Course) != visited.end ()){\n ... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n int WHITE = 1;\n int GRAY = 2;\n int BLACK = 3;\n vector<int> findOrder(int numCourses, vector<vector<int>>& prerequisites) {\n unordered_map<int, vector<int>> graph;\n for(auto prereq: prerequisites){\n graph[prereq[1]].push_back(prereq[0]);... |
210 | <p>There are a total of <code>numCourses</code> courses you have to take, labeled from <code>0</code> to <code>numCourses - 1</code>. You are given an array <code>prerequisites</code> where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you <strong>must</strong> take course <code>b<sub>i<... | 3 | {
"code": "class Solution {\npublic:\n vector<int> findOrder(int n, vector<vector<int>>& pr) {\n vector<int> ans;\n vector<bool> vis(n, false);\n vector<bool> gVis(n, false);\n vector<vector<int>> v(n);\n queue<int> q;\n vector<int> tmp;\n for(auto it:pr) {\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.