Find maximum sum possible equal sum of three stacks | Greedy | DSA Sheet | Amazon 🔥

Поделиться
HTML-код
  • Опубликовано: 12 сен 2024
  • #greedy #competitiveprogramming #coding #dsa
    Hey, Guys in this video I have explained with code how we can solve the problem 'Find maximum sum possible equal sum of three stacks'.
    CODE-- ideone.com/B22D4L
    Join our Telegram Channel for more Information
    🔰 Telegram Channel Link = t.me/CodeLibrary1
    🔰 Telegram Discussion Group Link = t.me/CodeLibra...
    🔰 Get 10% OFF on all GeeksforGeeks Courses
    Coupon Code = CODELIBRARY
    🔰 Array Playlist = • Love Babbar DSA 450 Qu...
    🔰 String Playlist = • Love Babbar DSA 450 Qu...
    🔰 Searching and Sorting Playlist = • Love Babbar DSA 450 Qu...
    🔰 Binary Tree Playlist = • Love Babbar DSA 450 Qu...
    🔰 Linked List Playlist = • Love Babbar DSA 450 Qu...
    🔰 Graph Playlist = • Love Babbar DSA 450 Qu...
    🔰 Dynamic Programming Playlist = • Love Babbar DSA 450 Qu...
    🔰 Informative Videos = • Informative Videos
    🔰 Love Babbar DSA Sheet: drive.google.c...
    Follow us on Instagram:
    🔰 Shailesh Yogendra : / shaileshyogendra
    🔰 Yogesh Yogendra : / i_am_yogesh_here
    Follow us on LinkedIn:
    🔰 Yogesh Yogendra : / yogesh-yogendra-26bbb518a
    🔰 Shailesh Yogendra : / shailesh-yogendra-8b13...
    Hope you like it. Comment if you have any doubt
    LIKE | SHARE | SUBSCRIBE

Комментарии • 20

  • @movieRevy
    @movieRevy Год назад

    Superb explanation

  • @hariharibolll3459
    @hariharibolll3459 Год назад +1

    You were supposed to do in O(1)space

  • @tejasjoshi1907
    @tejasjoshi1907 3 года назад +5

    Okay so , finally after 4 days (exactly at 4 th day ) I had completed this greedy playlist ... Thank u ❤️✨

  • @tanmayjain5821
    @tanmayjain5821 11 месяцев назад

    bro how can we calculate sum given that we can only pop an element from
    top of the stack?

  • @pritishpattnaik4674
    @pritishpattnaik4674 Год назад

    can we do this by a priority queue

  • @sharuk3545
    @sharuk3545 3 года назад

    thnk bro bcz of this i completed greedy with all questions

  • @Flash-qr5oh
    @Flash-qr5oh 3 года назад

    Ye series krne k liye thank you so much puri complete Krna please ❤️

  • @yogendrasrivastava3850
    @yogendrasrivastava3850 3 года назад +1

    Bhaiya coding mai khud se seekkh raha hoo aur sawal ho hi nahi rahe hai.. mai kya karu aap ko coding karte dekhta hoo to siochta ho kaise kar lete ho aap..please kuch bta do aap kaise seekh ho aap..

    • @justanaverageguy4739
      @justanaverageguy4739 3 года назад +1

      practice karo bhai ho jayega aasan lagega

    • @BruhhMoment-ij5uo
      @BruhhMoment-ij5uo Год назад

      @@justanaverageguy4739 bro ye code jo bhai ne karaya ye time limit exceeded dikha Raha hai. maine bhi yehi logic likha tha but thoda alag uska bhi time limit exceeded aaraha tha. Fir ye dekhke kiya to bhi same.

  • @arghyamitra3281
    @arghyamitra3281 3 года назад

    Bhaiya please ek course banao interview preparation ka . .. bdw super as usual 🙏

  • @Prodcater
    @Prodcater 3 года назад

    Huffman Encoding(Greedy) pe bhi video bana do plz

  • @ravulaakhilsurya8569
    @ravulaakhilsurya8569 3 года назад +1

    Bro can you upload your codes somewhere like in github so that we can refer them before few days of interview??

  • @ravulaakhilsurya8569
    @ravulaakhilsurya8569 3 года назад

    Bro please make a video on which algorithm is used in which cases 🙏🙏
    Just like you explain dp significance in the problem while solving

  • @shouvikdatta6831
    @shouvikdatta6831 3 года назад

    Please make a video about how much competitive programming should we do to clear coding rounds?

  • @_ankit_9937
    @_ankit_9937 3 года назад

    Plz sir tell about any online internship which is madantory for my 5th sem

  • @kushalbanik1313
    @kushalbanik1313 2 года назад

    The rate might be the factor so tried with this way ->
    #include
    using namespace std;
    bool check(int arr[]){
    for(int i=1;i pr2.first;
    }
    int main(void){
    int tcs{0};
    cin>>tcs;
    while(tcs--){
    int n1,n2,n3;
    cin>>n1>>n2>>n3;
    int no;
    pair arr[3];
    vector v(3);
    int sum[3] = {0};
    for(int i=0;i>no;sum[0]+=no;v[0].push(no);}
    for(int i=0;i>no;sum[1]+=no;v[1].push(no);}
    for(int i=0;i>no;sum[2]+=no;v[2].push(no);}

    for(int i=0;i