Пікірлер

• 
  @yubarajmohanty703 сағат бұрын

  thank u sir

• 
  @yubarajmohanty703 сағат бұрын

  thank you sir

• 
  @lgarmy788815 сағат бұрын

  best

• 
  @aditijain9423Күн бұрын

  need more videos

• 
  @aditijain9423Күн бұрын

  NEED MORE VIDEOS ON GRAPHS

• 
  @user13443fgКүн бұрын

  Impressed how you taught! I was looking for bottomup speacially for star character. I understood it because of you :)

• 
  @ganeshsakhare9498Күн бұрын

  Nice video, Thank you for sharing.

• 
  @saurabh.gupta222 күн бұрын

  Literally great detailed Insightful video of deriving the formula , Loved it♥

• 
  @anuragkumargupta75062 күн бұрын

  import java.util.*; public class Main { public static void main (String[] args) throws java.lang.Exception { int n = 3; int arr[] = {2,3,6,9,8,3,2,6,2,4,9,9}; int index = printLastIndex(0, arr,8); System.out.println(index); } public static int printLastIndex(int idx ,int arr[],int x) { if ( idx == arr.length){ return -1; } int index = printLastIndex(idx+1,arr,x); if(arr[idx] == x ) { return Math.max(idx,index); }else { return index; } } }

• 
  @mohammadarman61573 күн бұрын

  please upload NLP project

• 
  @darkpheonix65923 күн бұрын

  you know what after watching striver and some other videos I have came to conclusion that he's the best teacher just not famous enugh

• 
  @yashchoudhary97893 күн бұрын

  Starting today 20/07/24 ☺️

• 
  @nknidhi3213 күн бұрын

  thanks

• 
  @kunalkishore3283 күн бұрын

  Tabular solution -> public static int maxSumOfMNonOverlappingSubarrays(int[] arr, int m, int k) { int n = arr.length; int[] psum = new int[n]; // Calculate prefix sums for subarrays of size K int sum = 0; for (int i = 0; i < k; i++) { sum += arr[i]; } psum[0] = sum; for (int i = k; i < n; i++) { sum = sum + arr[i] - arr[i - k]; psum[i - k + 1] = sum; } // Create DP table int[][] dp = new int[n + 1][m + 1]; // Fill the DP table for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp[i][j] = dp[i - 1][j]; // Case: not taking the current subarray if (i >= k) { dp[i][j] = Math.max(dp[i][j], psum[i - k] + dp[i - k][j - 1]); } } } return dp[n][m]; }

• 
  @aryasharma68783 күн бұрын

  Your code will give wrong output if the input is "abb", This code is not working for passing the test case for not printing duplicate permutations For the correct input, before for loop create a char array[ ], then sort the array & just add one condition after the for loop:- if(i>0 && charArray[ i ]==charArray[ i-1 ]){ continue; }

• 
  @roymedia96834 күн бұрын

  this is my first video ever seen in your channel you are GOAT(Greatest of all teachers )

• 
  @saptadeepdas11884 күн бұрын

  Stock market ke jesa lag rha

• 
  @iamnoob75935 күн бұрын

  Superb understood

• 
  @Atul1311-g7e5 күн бұрын

  Is it ok to start from here, if I don't know anything about coding.....

• 
  @surajsidar32805 күн бұрын

  Why only very few KZreadrs have covered this question.

• 
  @ka238535 күн бұрын

  Your videos are too good and great explanation ❤

• 
  @pratikfake54166 күн бұрын

  sir kahan ho aap

• 
  @annushasinha62076 күн бұрын

  first mein thoda confusing laga then jo samajh mein aya last mein bhai waaahhh👏👏👏👏👏

• 
  @benzamin27797 күн бұрын

  No one puts this much effort on a youtube video knowing that viewers may leave in the middle but he still took the risk because he knew this is the real thing no one explains and it is most needed in recursion. Thank you sir We respect you 🙏.

• 
  @AKASHKUMAR-li7li7 күн бұрын

  literally dp kya kamal ki chiz hai... sidhe 2^n se n

• 
  @TusharKumar-ty8kh7 күн бұрын

  one of the toughest questions on leetcode

• 
  @TusharKumar-ty8kh7 күн бұрын

  very few people can explain 3d dp solution

• 
  @shubhambaranwal89627 күн бұрын

  okkkkkkkk

• 
  @shubhambaranwal89627 күн бұрын

  but not okkkk

• 
  @divinity86838 күн бұрын

  thank uuu sir

• 
  @divinity86838 күн бұрын

  😍😍

• 
  @user-gt7nm9iw4c8 күн бұрын

  thanks sir for making the tough problem so much easy 👌

• 
  @sandeepnaikat55988 күн бұрын

  Wonderful way of teaching great work done sir

• 
  @beastboy..9 күн бұрын

  try to keep the pace slowly sir it would be good

• 
  @garimachauhan99169 күн бұрын

  Such a beautiful video! thanks

• 
  @ShrishailGobare9 күн бұрын

  great explanation !! keep it up !

• 
  @YASH_KHICHARIYA9 күн бұрын

  Sir last me A 3 ko hate karta hai lekin 3 hi kyu A ko hate karte hai

• 
  @jatinshrivastava423110 күн бұрын

  Thank you very much.. great explanation.

• 
  @th3graduate29210 күн бұрын

  it took time but i understood it very well.

• 
  @th3graduate29210 күн бұрын

  Explanation is awesome.

• 
  @th3graduate29210 күн бұрын

  great explanation.

• 
  @anishmondal731010 күн бұрын

  (b+c-d+(c)) in this case the logic will be wrong...please try again

• 
  @itsme-z1s10 күн бұрын

  wonderful explanation I have found in whole youtube. Thank you so muchhhhhhh

• 
  @priyanshumishra194010 күн бұрын

  Average Formula Is Wrong If the average of the past four values is 8, then the sum of those four values is 8×4=32 Let's say the new number you want to add is 𝑥 When you add this new number, you'll have five values in total. The new average will be the sum of these five values divided by 5. The sum of the five values is 32+𝑥 New Average=(32+𝑥)/5 ​

• 
  @th3graduate29210 күн бұрын

  PEMDAS rule

• 
  @th3graduate29210 күн бұрын

  did it using escape sequence

• 
  @th3graduate29210 күн бұрын

  escape sequence se bhi ho jayega

• 
  @th3graduate29210 күн бұрын

  Awesome question

• 
  @th3graduate29210 күн бұрын

  Day 1

• 
  @namratamelavanki57535 күн бұрын

  Day 1

• 
  @sshree7811 күн бұрын

  Such a waste of time.