Leetcode | Weekly Contest 403 | B | C | 3195 | 3196 | Dynamic Programming | Editorial | Solution.

Поділитися
Вставка
  • Опубліковано 16 лип 2024
  • Leetcode | Weekly Contest 403 | B | C | 3195 | 3196 | Dynamic Programming | Editorial | Solution.
    B Solution : leetcode.com/submissions/deta...
    C Solution : leetcode.com/contest/weekly-c...
    Weekly Contest 403
    Leetcode
    3195. Find the Minimum Area to Cover All Ones I
    3196. Maximize Total Cost of Alternating Subarrays
    Dynamic Programming
    Editorial
    #Weekly Contest 403
    #leetcode
    #leetcodecontest
    #3195. Find the Minimum Area to Cover All Ones I
    #3196. Maximize Total Cost of Alternating Subarrays
    #dynamicprogramming
    #editorial
    #3195
    #3196
    #Count the Number of Inversions
    #Minimum Operations to Make Binary Array Elements Equal to One I
    #Minimum Operations to Make Binary Array Elements Equal to One II
    #inversion
    #leetcode
    #3176
    #3177
    #BiweeklyContest
    #132
    #dp
    #segmenttree
    #lazypropogation
    #hindisolution
    #ProgrammingTutorial
    #AlgorithmExplanation
    #StringManipulation
    #codinginhindi
    #dynamicprogramming
    #CodeChefContest
    #problemsolving
    #BinaryStrings
    #programminginhindi
    #CompetitiveProgrammingTutorial
    #AlgorithmExplanationInHindi
    #StringManipulationTutorial
    #codingtutorial
    #HindiCodingTutorial
    #CodeChefContest
    #problemsolving
    #BinaryStrings
    #programminginhindi
    #CompetitiveProgrammingTutorial
    #AlgorithmExplanationInHindi
    #StringManipulationTutorial
    #codingtutorial
    #HindiCodingTutorial
    #algorithmanalysis
    #programminglogic
    #problemsolvingtechniques
    #StringManipulationTechniques
    #codeexplanation
    #HindiProgrammingTutorial
    #codingtips
    #programmingeducation
    #OnlineProgrammingContest
    #ProgrammingSkills
    #computersciencetutorial
    00:00 B Explanation
    08:55 C Explanation

КОМЕНТАРІ • 19

  • @reactcode9148
    @reactcode9148 24 дні тому +1

    Thanks for sharing

  • @_AnuragSharma
    @_AnuragSharma 23 дні тому +1

    As clear as the explanation can get. Great work

  • @ektaagrawal6031
    @ektaagrawal6031 23 дні тому +1

    Great Explanation🔥

  • @varadpanchal1231
    @varadpanchal1231 20 днів тому +1

    One of the best solution

  • @gyanikumari4973
    @gyanikumari4973 24 дні тому +1

    Pls don't stop making such amazing editorials🤩🤩

  • @ronakkriplani1838
    @ronakkriplani1838 20 днів тому +1

    can you please explain today codechef 140 tree removal problem??

    • @pretestpassed157
      @pretestpassed157  20 днів тому

      Finally uploaded : ua-cam.com/video/1qDC1fwNDXE/v-deo.html

  • @udaymourya7322
    @udaymourya7322 24 дні тому +1

    Bro Please reply is it good to use this technique in interview ❤❤
    bro i use this technique if i have choices to take or not take
    java code ->
    public long solve(int nums[] , int i, int pre){
    if(dp[i][pre] != Long.MIN_VALUE) return dp[i][pre];
    if(i == nums.length) return 0;
    long cut = Long.MIN_VALUE;
    long sum = 0;
    int count = 0;
    for(int j=i; j

    • @pretestpassed157
      @pretestpassed157  23 дні тому

      It totally depends on your interviewer. If the interviewer knows there is further an optimised method, then he is going to ask you to reduce the time complexity further.

  • @ronakkriplani1838
    @ronakkriplani1838 22 дні тому +1

    From where i can practice this type of grid question

    • @pretestpassed157
      @pretestpassed157  22 дні тому

      I didn't have an idea regarding the exact problem set, but you can search on the leetcode with the tag grid you might find the same kind of problem.

    • @ronakkriplani1838
      @ronakkriplani1838 22 дні тому

      @@pretestpassed157 ohk

  • @nanugupta1434
    @nanugupta1434 24 дні тому +1

    Amazing solution bro ,how can I contact you on any social media handle ?

    • @pretestpassed157
      @pretestpassed157  24 дні тому

      Thankyou. You can contact me on the linkedin. Link is already provided in the about section of this channel.