1727. Largest Submatrix With Rearrangements | 3 Ways | O(m*n) time

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

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

  • @ARYANMITTAL
    @ARYANMITTAL  Год назад +3

    Do, check out the last approach, that has been the follow up by Google !

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

    Bro itna jldi content bna leta h salute bro , even I am your senior in academic but i was waiting for ur video , sometime I was not able to solve in efficient way but i appreciate or dedication and work

    • @TechnicalModiG
      @TechnicalModiG Год назад +3

      I was refreshing ur channel like , i am stuck u will share and i will understand

  • @paragroy5359
    @paragroy5359 10 месяцев назад

    Really good explanation, but just thinking how we can come to this solution during the interview, if we haven't solve this problem before.

  • @GauravSingh-tn8sv
    @GauravSingh-tn8sv Год назад +3

    how do you know the followup google has asked? can you please point to the source?

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

      I have seen the same question on discuss page 🫡

  • @kajiazadali7738
    @kajiazadali7738 Год назад +3

    Histogram problem 😂

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

    me when I saw the O(n*m) solution😮‍💨😮‍💨🤧😭

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

    Got the O(n * m * logm) and O(n) space soln by myself. But still came here too learn something new. And got amazed by the most optimal approach.
    Any tips how to get those ideas? I am pretty sure if I was asked this most optimal approach in the interview then my brain would have stopped working 😂