GeeksForGeeks - POTD | GFG POTD Answer

26th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: double fractionalKnapsack(int W, Item arr[], int n) { vector> v; for(int i=0; i

25th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution{ public: void SieveOfEratosthenes(int n, vector &prime) { for (int p = 2; p * p <= n; p++) { if (prime[p] == true) { for (int i = p * p; i <= n; i += p) prime[i] = false; } } } int solve(int Num1, int Num2) { vector prime(10000, 1); SieveOfEratosthenes(9999, prime); int ans = 0; queue q; q.push(Num1); while (!q.empty()) { int sz = q.size(); for (int i = 0; i < sz; i++) { int val = q.front(); q.pop(); if (val == Num2) return ans; string s = to_string(val); for (int j = 0; j < 4; j++) { char c = s[j]; for (int k = 0; k < 10; k++) { if (k == 0 && j == 0) continue; s[j] = '0' + k; int temp = stoi(s); if (prime[temp]) { q.push(temp); prime[temp] = 0; } } s[j] = c; } } ans++; } } };

24th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: bool helper(int u, int par, vector &vis, vector g[]){ vis[u]=1; bool flag = 1; for (auto &c: g[u]){ if (c==par) continue; if (vis[c]) return false; flag = flag & helper(c,u,vis,g); } return flag; } int isTree(int n, int m, vector> &adj) { vector g[n]; for (int i=0; i vis(n,0); bool ans = helper(0,-1,vis,g); for (auto &v: vis){ if (v==0){ ans = 0; break; } } return ans; } };

23rd January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: vector findOrder(int n, int m, vector> a) { vector in(n, 0), topo, emptyArray; vector adj[n]; for(auto x: a) { adj[x[1]].push_back(x[0]); } for(int i=0;i q; for(int i=0;i

22nd January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { vector> res; vector ds; public: void preorder(Node* root,int sum){ if(!root) return; sum -= root->key; ds.push_back(root->key); if(sum == 0){ res.push_back(ds); } preorder(root->left,sum); preorder(root->right,sum); ds.pop_back(); } vector> printPaths(Node *root, int sum) { preorder(root,sum); return res; } };

21st January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution{ public: map>,int> mp; int solve(int n, vector> &edges,int i, vector &vis ){ if(i>=edges.size()){ return 0; } if(mp.find({i,vis})!=mp.end()){ return mp[{i,vis}]; } int a =edges[i].first; int b = edges[i].second; if(vis[a]==0 && vis[b]==0){ vis[a] = 1; int val = solve(n,edges,i+1,vis)+1; vis[a] = 0; vis[b] = 1; int val1 = solve(n,edges,i+1,vis)+1; vis[b] = 0; return mp[{i,vis}] = min(val,val1); } return mp[{i,vis}] = solve(n,edges,i+1,vis); } int vertexCover(int n, vector> &edges) { vector vis(n+1,0); return solve(n,edges,0,vis); } };

20th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: int help(Node* root,int& ans) { //base case if(!root) return 0; //recursive callls //and small calculation int left=help(root->left,ans); int right=help(root->right,ans); ans+=abs(left)+abs(right); return root->key+left+right-1; } int distributeCandy(Node* root) { int ans=0; int call=help(root,ans); return ans; } };

19th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: vector> kTop(vector& arr, int N, int K) { vector top(K + 1); vector> ans; unordered_map m; for (int i = 0; i < N; i++) { vectortemp; m[arr[i]]++; top[K] = arr[i]; auto it = find(top.begin(), top.end() - 1, arr[i]); for (int j = distance(top.begin(), it) - 1; j >= 0; --j) { if (m[top[j]] < m[top[j + 1]]) swap(top[j], top[j + 1]); else if ((m[top[j]] == m[top[j + 1]]) && (top[j] > top[j+1])) swap(top[j], top[j + 1]); else break; } for (int i = 0; i < K && top[i] != 0; ++i) temp.push_back(top[i]); ans.push_back(temp); } return ans; } };

18th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution{ public: int min_sprinklers(int gallery[], int n) { vector> range; for(int i=0;i

17th January : C++ Solution☝🏼 ———————————————————— 🙋🏻‍♂️Discussion ⁉️ Join ✅ @GFG_Answer

class Solution { public: vector> uniquePerms(vector &arr ,int n) { set>ans; sort(arr.begin(),arr.end()); ans.insert(arr); while(1) { next_permutation(arr.begin(),arr.end()); ans.insert(arr); bool flag = true; for(int i=0;iarr[i]) { flag = false; } } if(flag) { break; } } vector>res; for(auto i:ans) { res.push_back(i); } return res; } };