Відео

👍🏻👍🏻is there any way we can solve it in n*n using any data structure?? Btw your explanation is amazing . Thanks!

Hloo bhaiya, we meet in bfit college.... thanks for your guidance and this vedios is very useful for us

Isn't there more efficient way to do it?

Hi sir, nice explanation can make all videos in the same way of explanation

bhai kaha job hai?

public class array_Question { static void subarray(int arr[]){ for(int i=0;i<arr.length;i++){ for (int j = i; j < arr.length; j++) { for (int k = i; k<=j; k++) { System.out.print(arr[k]+ " "); } System.out.println(" "); } } } public static void main(String[] args) { int arr[]={1,2,3,4,5}; subarray(arr); } }

The algorithm is good but it is not dynamic. if we use a different array of values the function will not give expected values

❤❤❤

❤❤❤

Bro if we run this code it is giving sub array but I want to know how i,j,k nd k are working here? int arr[]={1,2,3,4}; for(int i=0;i<arr.length;i++){ for(int j=i;j<arr.length;j++){ for(int k=i;k<=j;k++){ System.out.print(arr[k]);

Use red pen ... blue makes ur writing invisble

can anyone tell me why there is no {0,3} or {0,2} subarrays and likewise subarrays in his answers?

Much simpler way is !!! Start j from i , n run the third loop from start to end that is from i to j , that's all

the way you explain is so deep , it helps

public void findSummArray() { int[] arr = { 5,3,4,2,7}; string result=""; for(int i=0; i<arr.Length; i++) { for(int j=i;j<= arr.Length; j++) { for (int k = i; k <j; k++) { result += arr[k].ToString() + ","; } result += " "; } } Console.WriteLine(result); } It Works .. My logic

Can i have your contact details i.e number of email ?

Very helpful

Thanks bro

very helpful

thanks bud

Well explained.

Good work

Need Help In Coding Please Reply Soon.

Need Help In Coding Please Reply Soon.

Need Help In Coding Please Reply Soon.

Need Help In Coding And Reply Soon Plz.

: there are n elements in an array . all the elements have their initial values , and their values increase with an element having a non zero value increasing the value of surrounding element by 2 each day.for example if the value of ith element is non zero then the value of(i-1) th element will get inceremented by 2 as well the value of(i+1) th element will get incremented by 2(if they exist) lets call the initial days,day0 and after that each consecutive will be reffered to as day 1,day2 and so on.now you have to find total extra value of all elements that would have been increased on day p compared to day 0(input 1st line :5 2 Sec line: 0 5 0 4 0 output- 24..] Plzzz solve this que

Given an array A of N integers A1, A2, A3,.... AN, you have to answer Q queries. Each query consists of two integers L and R ( 1< or equal to L < or equal to R < or equal to N) let Di be the smallest integer greater than 1 that divides Ai. Find out DL+DL+1+DL+2+..... +DR for each query.. (Explanation sample1 first query: D1+D2=2+2=4..... Sec D3+ D4+D5=2+17+2=21 Third D6 = 5 ( code in java)

Nice one bro👏

Hello make vedios from starting ( Hackerearth Dsa) nd make the playlist

Sir you make it more easy to understand Through your amazing explanation

💯💯

We'll done beta , keep it up 👍🏻👍🏻👍🏻💖🎉

👏👍

👍👍👍

coool 👍👍👍

explanation is too good 💯💯💯

Solve the maximize the sum hackerearth in java( with Array)and provide code

amazing dod thx ❤❤👌👌

n you please do the seclore exam code

😇🙂 I have learnt alot from u,, the way make us understand basics of topics and problem solving skill ,,, are amazing really ,,, best teacher glad be your student

nice way of explaining things.. m your student from NS

Superb👍👍

Seems very easy after watching this, thankyou😇

Nicely explained 👌

Awesome😄🔥🔥

Very helpful videos, excited after watching these rockstar videos💪

💫

Very well explained Sir🔥

Oh sir ... learn so many new things through this thank u sir .... me NEETU