Sum of Two Integers - LeetCode 371 - Java

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

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

  • @lobvida7630
    @lobvida7630 8 месяцев назад +1

    great video. amazing detail in the demonstration

  • @davidmwangi4312
    @davidmwangi4312 Год назад +1

    Splendid explanation.

  • @fatlard3414
    @fatlard3414 2 года назад +1

    Super good explanation! Thanks for your help

  • @fjose8712
    @fjose8712 2 месяца назад +1

    Is it not simpler to use logarithms? Logarithms convert addtion to multiplication, so we don't need the + symbol...

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

    there is a loop present , so how its become constant time complexity? can u please clarify my doubt?

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

      because this loop will always do operation for 32 times. so here 32 is fixed , so if some thing is fixed we say it constant time

  • @1murkeybadmayn
    @1murkeybadmayn 5 месяцев назад

    I would prefer you wrote the explanation while writing the code because you did not show what happens when there is a carry i.e. when it does not equal 0 in the previous explanation. The while loop condition says while carry is not 0 so now I am confused if the carry is a single digit. Edit: In fact, I found from chatgpt that 6 + 6 does have a carry but you reversed the operations so that confused me.