Adding Ones | GFG POTD | C++ | Java | 2-Methods | Code Kar Lo

You start with an array A of size N. Initially all elements of the array A are zero. You will be given K positive integers. Let j be one of these integers, you have to add 1 to all A[i], where i ≥ j. Your task is to print the array A after all these K updates are done.
Note: 1-based indexing is used everywhere in this question.

0:00 Introduction
0:12 Problem Statement
1:14 Brute Approach
4:19 Optimal Approach
8:24 C++ Code
11:02 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/adding-ones3628/1

Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Adding%20Ones

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