Find Missing Observations - Leetcode 2028 Weekly Contest Problem - Python

Поделиться
HTML-код
  • Опубликовано: 28 окт 2024

Комментарии • 13

  • @drakata27
    @drakata27 11 месяцев назад +5

    Only neetcode and Chuck Norris can get 7 on a 6 sided dice🙌

  • @aadil4236
    @aadil4236 Год назад +8

    At 3:56 how could we roll a 3 and a 7? (I mean it's a 6 sided dice right) I think it's a mistake some people might get confuse by it. Actually I god confuse by it. Thanks for the video though.

  • @JudoboyAlex
    @JudoboyAlex 3 года назад

    Hey NeetCode, were you able to finish in top 10% from Leetcode Weekly contest? Are you currently faang engineer? Thanks for the quality instructions!

  • @manishkumar-cu3sb
    @manishkumar-cu3sb 3 года назад +1

    Very nice ..Already solved the question but still waited for your video to learn something new and my time get paid off thank you😍😊

  • @masternobody1896
    @masternobody1896 3 года назад +6

    wish me luck to get a job at fang. I hope everyones gets a job in fang

  • @ygwg6145
    @ygwg6145 Год назад

    Distributing as evenly as possible among the n dices leads to an O(1) solution.

  • @juda550
    @juda550 3 года назад +1

    Hi neetcode, could you please cover the stone game series of problems?

  • @UdayKiran-mw4cr
    @UdayKiran-mw4cr 3 года назад +5

    May be forgot to edit the video 😂🙂😂🙂. Finally got the secret behind it.

  • @sankhadip_roy
    @sankhadip_roy 9 месяцев назад

    4:04 catch the mistake !

  • @algosavage7057
    @algosavage7057 3 года назад

    Hey there. Can u plz make a video about problem from the save contest.

  • @KaranSharma-ew7io
    @KaranSharma-ew7io 3 года назад

    thank you

  • @sumitbisht4161
    @sumitbisht4161 3 года назад

    We need Max no. of ways to partition an array pls.