Find Maximum Equal sum of Three Stacks | Hindi | GFG POTD | C++ | Java

29 Просмотры

  • Спасибо! Поделитесь с друзьями!

    Вам не понравилось видео. Спасибо за то что поделились своим мнением!

admin
Издатель
Given three stacks S1, S2 & S3 of size N1, N2 & N3 respectively, having only Positive Integers. The task is to find the possible equal maximum sum of the stacks with the removal of top elements allowed. Stacks are represented as an array, and the first index of the array represents the top element of the stack.

0:00 Introduction
0:14 Problem Statement
1:01 White Board Explanation
4:36 Complexity Analysis
5:03 C++ Code
9:33 Java Code

My DSA Journey:- https://youtu.be/quZBBv12mCQ

How to Earn By GFG Articles:- https://youtu.be/XjvEgkd49Gk

Infosys Coding Questions:- https://youtube.com/playlist?list=PLq3GlRZI14HuZlfpLmVY915bolizB8O2-

Problem Link:-https://practice.geeksforgeeks.org/problems/find-maximum-equal-sum-of-three-stacks/1

Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Find%20Maximum%20Equal%20sum%20of%20Three%20Stacks

Playlist Link:-https://youtube.com/playlist?list=PLq3GlRZI14Hui2ILGsfF1Uf2RnbNu9wT3

Linkedin:- https://www.linkedin.com/in/shubham-kashyap-65a29a218/

Instagram:- https://instagram.com/im_shubham_kashyap?igshid=YmMyMTA2M2Y=

My GFG Profile:- https://auth.geeksforgeeks.org/user/shubhamrajput6156/practice

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg


#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming
Категория
Язык программирования C++
Комментариев нет.