1190. Reverse Substrings Between Each Pair of Parentheses - Day 11/31 Leetcode July Challenge

Поділитися
Вставка
  • Опубліковано 21 жов 2024
  • Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!
    Problem: leetcode.com/p...
    Twitch: / larryny
    Discord: / discord
    Instagram: / larrysomewhere
    #leetcode #coding #programming

КОМЕНТАРІ • 6

  • @Algorithmist
    @Algorithmist  3 місяці тому +5

    Were you able to establish all the pairs?

    • @thegreatgoodbadandtheugly
      @thegreatgoodbadandtheugly 3 місяці тому

      I mean while solving I got the idea of reversing only in odd depth but i didn't implement it, I am being lazy, should I be working hard and stop being lazy?

    • @Hope-ck6hy
      @Hope-ck6hy 3 місяці тому

      Why do we need to set i = right-lookup[i]?

    • @Algorithmist
      @Algorithmist  3 місяці тому

      @@Hope-ck6hy I think you have atypo

  • @rohitkumarpilania94
    @rohitkumarpilania94 3 місяці тому

    thanks for O(n), i was delusional in thinking my n^2 is n

  • @Agent_BlackSting
    @Agent_BlackSting 3 місяці тому

    just a question.... is there any copyright issue with leetcode?