Skip to main content

Code_Thunder!!

Search This Blog

Showing posts with the label Daily Challenge

Posts

Number of Turns in Binary Tree Solutions

on August 14, 2022

Daily Challenge Geeks For Geeks problem of the day

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Friend Pairing Problem

on August 13, 2022

Daily Challenge Geeks For Geeks

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Friends Pairing Solutions

on August 13, 2022

Daily Challenge Geeks For Geeks

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Max length chain

on August 12, 2022

Daily Challenge Geeks For Geeks

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Max length chain Solutions In java

on August 12, 2022

Daily Challenge Geeks For Geeks

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Pots of Gold Game

on August 10, 2022

Daily Challenge Geeks For Geeks

+

Get link
Facebook
X
Pinterest
Email
Other Apps

Popular Posts

Find Reachibility

Find Reachibility -- Juspay Hiring Solutions Join Our WhatsApp Group import java.util.*; import java.lang.*; import java.io.*; class Codechef { public static void main (String[] args){ Scanner sc = new Scanner(System.in); int t = sc.nextInt(); while(t!=0){ int n = sc.nextInt(); int sum = 0, diff = 0; int[] A = new int[n]; int[]B = new int[n]; for (int i = 1; i < n; i++){ A[i] = sc.nextInt(); sum += A[i]; B[i] = A[i]; A[i] = sum; } for (int i = 0; i < n-1; i++){ diff = A[i+1] - B[i]; if(diff > 0){ B[i+1] = B[i] + diff + B[i+1]; } else{ B[i+1] = B[i] + B[i+1]; } } System.out.println(B[n-1]); t--; } } } Join Our WhatsApp Group

The Nagging React Newbie

The Nagging React Newbie -- Juspay Hiring Solutions Join Our WhatsApp Group N=int(input()) strail={} def sol(u,v): strail[u].append(v) for i in range(N): n1=int(input()) strail[n1]=[] zero=int(input()) for i in range(zero): u,v=map(int,input().split()) sol(u,v) start=int(input()) end=int(input()) trail=[] trail.append(start) def trailaverse(strail,start): for i in strail[start]: if(i==end): return if(len(strail[start])==0): return else: trail.append(i) trailaverse(strail,i) trailaverse(strail,start) trail=sorted(trail) for i in trail: print(i,end=" ") Join Our WhatsApp Group

Learn Js

Learn Js Solutions Join Our WhatsApp Group #include <iostream> #include <bits/stdc++.h> using namespace std; vector<pair<int,int>>adj[1000001]; int main() { int n; cin >> n; unordered_map<int, int>mp; for(int i =0;i<n;++i){ int x; cin>>x; mp[x] =INT_MAX; } int e; cin>>e; for(int i =0;i<e;++i){ int x,y,d; cin>>x>>y>>d; adj[x].push_back({y,d}); } int src,dest; cin>>src>>dest; set<pair<int,int>>s; mp[src]=0; s.insert({0, src}); while(!s.empty()){ pair<int, int>tmp=*(s.begin()); s.erase(s.begin()); int u = tmp.second; for(auto i = adj[u].begin();i!=adj[u].end();++i){ int v = (*i).first; int weight = (*i).second; if(mp[v]>mp[u]+weight){ if(mp[v]!=INT_MAX) s.erase(s.find({mp[v],v})); mp[v] = mp[u]+weight; s.insert({mp[v],v}); } } } if(mp[dest]==INT_MAX) cout<...

The_professional

Archive

January 20231
August 202234

Labels

codechef
Daily Challenge
Geeks For Geeks
Jobs
Juspay
juspayHiring
longchallenge
problem of the day

Report Abuse

Powered by Blogger

Theme images by Storman

ⓒ 2022, Codethunder!!. All rights reserved