Maximum sub array no description in videos

#1

CANT UNDERSTAND EVEN ONE WORD OF THIS VIDEO AND THE PREVIOUS VIDEO. WHO CREATED THIS VIDEO ??
SO POOR DESCRIPTION IS GIVEN BY THE ONE WHO IS TEACHING THE SUBARRAYS… KINDLY EXPLAIN THE SUBARRAY AND THE SUBARRAY SUM FROM STARTING.
POOR VIDEOS POOR !!!
YOU GYS HAVE MADE VIDEO THINKING WE ALREADY KNOW THE CONCEPTS BUT THIS IS NOT LIKE THAT WE ARE BEIGNNERS.

#2

@Madhavendra-Gupta-2240591552663161 hey krishna
A subarray of an n-element array is an array composed from a contiguous block of the original array’s elements
if input is given like
5
1 2 3 4 5
so subarrays will be like
1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
2
2 3
2 3 4
2 3 4 5
3
3 4
3 4 5
4
4 5
5
the order is like above example it not like that below given
1 3
1 5 3
this is not a subarray order.
for maximum subarray sum 1 video bhaiya declare a current sum variable every time new subarray is generated he was directly sum all the value into current sum.
here is the link of the code

#3

if we will run 2 for loops only

#4

if we will run 2 for loops only for eg:#include using namespace std; int main() { int n,i; cin>>n; int a[1000]; for(int i=0;i<n;i++) { cin>>a[i]; } for(int i=0;i<n;i++) { for(int j=i;j<n;j++) { cout<<a[j]; } cout<<endl; } }

#5

than our o/p is not same.

#6

@Madhavendra-Gupta-2240591552663161 hey Madhavendra let discuss it again you have to tag me so that I will notify that you asking something if you didn’t mention me by using @ followed by my tag name I have no idea about that you query something and doubt remains pending please discuss it again what are you taking about your doubt.

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.