Buy Maximum Stocks If i Stocks Can Be Bought On i-th Day | GFG POTD | C++ | Java | Code Kar Lo

In a stock market, there is a product with its infinite stocks. The stock prices are given for N days, where price[i] denotes the price of the stock on the ith day.
There is a rule that a customer can buy at most i stock on the ith day.
If the customer has an amount of k amount of money initially. The task is to find out the maximum number of stocks a customer can buy.

0:00 Introduction
0:11 Problem Statement
1:50 Explanation
7:04 C++ Code
11:06 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://www.geeksforgeeks.org/problems/buy-maximum-stocks-if-i-stocks-can-be-bought-on-i-th-day/1

Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Buy%20Maximum%20Stocks%20if%20i%20stocks%20can%20be%20bought%20on%20i-th%20day

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

Видео Buy Maximum Stocks If i Stocks Can Be Bought On i-th Day | GFG POTD | C++ | Java | Code Kar Lo канала CODE KAR LO