October 15, 2024
wp-header-logo-6.png

20 thoughts on “Aggressive Cows Problem | DSA Placement Series – Binary Search | Lecture 23

  1. I am confused bcz i have just started coding with c++ and i am a bigneer and this dsa series is for placement should i continue or ?? Bcz i am able to understood completly with the concept that is explained in lectures

  2. I know totally unrelated but didi please tell me should I go for Jadavpur University civil engineering or Jalpaiguri Government Engineering College Computer science and engineering. Please help me, I am in really big problem 😢

  3. ma’am in book allocation problem, you initialize the start from zero(str = 0) but in same type of problem painter’s partition problem,you have initialize the start from maximum of the array(str = INT_MIN).Could you tell us why, Because I could not understand that point.please

Leave a Reply

Your email address will not be published. Required fields are marked *