Magic Cows | Dynamic Programming | Adhoc | Interview problem

[@marvinroche1351]

Interesting solution for the approach. Thank you for the video. Another solution : F = sum([2 ** max(d - (math.ceil(math.log2(C / x)) - 1), 0) for x in F0]) with C : max cows per farm F0 : (ex : [1,1,2,1,2]) initial cow repartition per farm d : day of control Explanation : a farm starts doubling when F0[ i ] * 2 ^ d > C. Before that it stays at 1 In a less compressed way : import math from typing import List def calculate_farms(N: int, C: int, F0: List[int], d: int) -> int: """ Calculate and print the intermediate steps for the number of farms on a specific day. :param N: Number of initial farms :param C: Maximum number of cows per farm :param F0: List of integers representing the number of cows on each initial farm :param d: The day to calculate the number of farms :return: Total number of farms on day `d` """ # Calculate threshold days for splitting dc = [math.ceil(math.log2(C / x)) - 1 for x in F0] print(f"Threshold days (when farms will split): {dc}") # Calculate the number of farms on day `d` F = [2 ** max(d - di,0) for di in dc] print(f"Number of farms on day {d}: {F}") # Total farms total_farms = sum(F) print(f"Total number of farms on day {d}: {total_farms}") return total_farms N = 6 C = 5 F0 = [1, 1, 2, 1, 2] d = 3 result = calculate_farms(N, C, F0, 0)

[@ialpha6431]

Great one ! I guess this channel is the next Khan Academy.

[@markkaravan4245]

This may be the best programming series I've seen online and I've seen a lot. Amazing work, William!

[@itsahandle]

This channel is so underrated man, I hope more people notice your hard work and learn something from u, thanks for the video keep it up!!

[@mzmzgreen]

I love this! More dp please! :) Also minimax is a topic that isn't so popular in tutorials. You're a great teacher, keep up the good work!

[@perseus1511]

Hi ,thank you so much williamFiset ,with you I learn what in university teachers never gonna teach me. Greetings from Peru and thanks for the subtitles.

[@abhishek.rathore]

Cowtosis: The process common in cows which leads to there duplication overnight. Usually caused by overeating of fresh grass.

[@pulgupta]

Thanks William, you have a very nice way of explaining things. Your animations are great at conveying the idea before looking into code

[@treyi1794]

Hey, I absolutely love your content!! can you please please do an exclusive course on dynamic programming- the theory, problem-solving methods and frequently asked interview problems.

[@kmchary1181]

The absolute best series.

[@bhawnabharti4369]

Great contents on your channel. I am big fan of your teaching style. please add some more dp problems. It is very very helpful for strugglers

[@thallium54]

Wow I didn't realized it could be solved using dynamic programming during the contest. That's such an elegant approach! Here I would like to describe my approach which may be a bit easier to think about: The key observation is that once an original farm is full for the first time, the number of farms needed to hold all the cows would double everyday. Knowing this we could calculate the answer without tracking the number of cows. The time complexity is O(NM), so either of these two approach may be faster under different constrains.

[@rithwiksrk462]

yes I did the same thing

[@sikandarbakht2076]

Please make a series of dp from scratch..... Thanks

[@shashanktiwari4442]

Awesome pls make a complete series including codeforces problems also will help a lot

[@alirezakamyab851]

Nice channel, keep the dynamic programming coming

[@mohamedshehata8972]

great work man, thanks

[@sograb]

I was trying to find some tutorial about DP. Udemy and Pluralsight has such videos but despite they're not free, they're not as good as your videos. These visual explanations are so great. Thanks a lot! Could we support you anyhow?

[@adityamishra4458]

please make competitive programming series

[@puneetkumarsingh1484]

An interesting variation of this problem will be like: Whenever the number of cows increases the maximum capacity, he creates a new farm for the extra cows with everything else remaining the same. It is like he is trying to maximize his efficiency of farm.

[@oisindavey2340]

Great video! I think that this can also be solved using fast matrix exponentiation in O(Q•logD•log^3C).

[@madhukiranattivilli2321]

If total number of farms with

[@prasannathapa1024]

Some other approaches as well #include using namespace std; #define loop(i,x,n) for(int i = x; i < n; ++i) #define inp(f,n) loop(i,0,n){cin>>f[i];} int main() { int c,n,m; cin>>c>>n>>m; int f[n], q[m]; inp(f,n); inp(q,m); loop(j,0,m){ long long ans = 0; loop(i,0,n) ans += (1LL

[@algorithmscasts902]

Excellent explanation, thank you.

[@chenjason2598]

Awesome!

[@srini2010srini]

Cool explanation. Thanks.

[@benzhang8916]

Hi are you going to illustrate some questions on LeetCode

[@runnerup15]

given the problem statement i dont even really know where to begin without watching the whole video. i think im learning this out of order maybe there must be something else i need to know before jumping into questions like this

[@uXXair]

I don't get it. How are we supposed to derive such solutions? Is it just practice, practice, and practice?

[@manngondaliya4704]

Good work man 👍👍👍👍

[@AK-vx4dy]

Maybe i'm wrong, but i think we don't need dp table to all days, but only 2 rows, if we will store the number of farms in query table and reuse rows ?

[@ialpha6431]

Hi William, Could it be possible for you to add a new playlist explaining some of the good stuff from computational geometry ?

[@RedionXhepa]

Nice work !

[@astrallee7460]

thanks !! really！！

[@Red___Beast]

amazing

[@subee128]

thanks

[@prabhavrajeev9682]

Please make a video on manachers algorithm

[@bluejay9269]

hey William, I noticed the problem vault website is down. What happened? I enjoyed using it for practice.

[@WilliamFiset-videos]

Problem vault was recently turned down because of the cost of renewing the domain was going to cost an outrageous amount, and we haven't yet bothered to find a new place to host it.

[@puneetkumarsingh1484]

@@WilliamFiset-videos What is Problem Vault?

[@lkri7951]

Isn't this a simple math problem, why use dynamic programming?, ceil((total cows on day 0 × day of visit × 2) ÷ max number of cows per farm)

[@priyanka.sarkar]

Hi William, your videos are just amazing. I had one question, I tried submitting the solution in the website but I did not get all the TCs correct. Link to the submission : open.kattis.com/submissions/6501122

[@parthsaraswat9744]

i like this intro song

[@adhishmalviya2408]

Videos are in 4K

[@ragingpahadi]

Cowmitosis 😁😁😁

[@lovesegtree]

your sound is small can you speak louder?

[@andreamengoli4656]

Cow Mitosis ahahha

[@SC1240]

this shit rules

[@aa-xn5hc]

I dislike Kitties very much because it has got a very outdated version of C#