1975. Maximum Matrix Sum | Pattern Recognition | Greedy

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 พ.ย. 2024

ความคิดเห็น • 6

  • @rajrajesh1669
    @rajrajesh1669 ชั่วโมงที่ผ่านมา +1

    The main key observation is realising that we can change any negative to positive if there are even number of negatives, doesn't matter if they are neighbours or far away. In case odd we cannot change 1 negative value no matter what. Thanks for the explanation. Without this observation the problem is very hard but yeah with this Idea it's definitely easy medium.

  • @Anonymous____________A721
    @Anonymous____________A721 7 ชั่วโมงที่ผ่านมา +1

    Nice

  • @arnavagarwal9054
    @arnavagarwal9054 8 ชั่วโมงที่ผ่านมา +1

    Bhai please solve the yesterday's icpc preliminary round questions. By the way love your way of problem solving.

  • @DhruvikNagotha
    @DhruvikNagotha 7 ชั่วโมงที่ผ่านมา

    great bhaii

  • @nidhi228
    @nidhi228 3 ชั่วโมงที่ผ่านมา

    if 0 is adjacent a negative number then how should we handle that situation

    • @nidhi228
      @nidhi228 3 ชั่วโมงที่ผ่านมา

      in that even if the number of negative integer is odd we can change it to all positive