Please enable JavaScript.

Coggle requires JavaScript to display documents.

leet code crisps - Coggle Diagram

- - - - range([start], stop, [step])
        
        for i in range (len(myLIst)): myLis[i] + = 1
        
        for i in range (len (myLIst) -1 , -1 , -1): myLIst[I] + = 1
        
        for x in myLIst : if x %2 == 0: myLIst.remove(x)
    - - first eliminate the condion of not as assumed if (len (nums) == ): return false
      - we can also iterate towards the backwards
  - - - how many steps
        
        how can i count the steps
        
        how can i get to know i fhave reached the last one
        
        perhaps my saving the last one in a varable
        
        than comparig the status variable in if conditin with it
    - - we can move from up to down in iteration
  - - - every child has rating
      - condition are
        
        EACH CHILD GETS ATLEAST ONE
        
        HIGHER RATINGl: MORE CANDIES THAN NIEGHBORS
      - WHAT CAN I DO
        
        HOW WILL IN KNOW THE RATING OF THE LEAST RATED ?
        
        I CAN USE THE MIN FUNCTON
        
        THIS IS THE RIGHT OPTION TO CHOOSE!
        
        I CAN FIRST SORT OUT THE ARROW AND THAN SOLVE THE QUESTION
        
        WHAT PROBLEMS CAN OCCUR IF I DO SO ?
        
        THIER MAY OCCUR A PROBLEM TO FULLFILL THE SECOND CONDITION ? BUT HOW
        
        IT WILL BE AS FOR IN EXAMPLE THE 2 RATING CHILD WILL OCCUR TO GET 3 OF CANDIES
        
        HOW WILL I GET TO KNOW THE NIEGHBORS OF THE LEAST NUMBER ?
        
        I CAN PLUS 1 AND MINUS ONE IN THE INDEX
        
        I CAN COMPARE THE SET AND DO THE RECURRING ON THE NIEGHBORS TOO
    - - the condition to check at the right
        
        if ( i != rating.size() and rating[i] > rating[i+1] and candies[ i]< candies[i+1])
      - the condition to check at the left
        
        if ( i >0 and rating[i] > rating[i-1] and candies[ i]< candies[i+1])
  - - - integers of my
        
        initial
        
        intitalExperience
      - arrays of opponents
        
        energy []
        
        experience[]
      - conflict of protagnist
        
        energy[I] . experiemce[i]
        
        how to win opponnet
        
        have great of both
        
        tradeoff
        
        if uou gain experience you lose energry (if you win )
      - supporting actors
        
        you can get trained
        
        each train
        
        either initialexperience++
        
        or intialenetgy ++
    - - what i have to dp ?
        
        i have to find the minimum numvers of trainig needed to defeat the all opponets
      - how will i get it
        
        i can itertate
        
        the both of the arrays because both have the oppoennet in it
        
        i can put conditions of winnig
        
        if i win i will have to plus the experince and minus the energy
        
        i can have an artificail variabel that counts the energy surplus needed
        
        but how will i know the experience needed becuase it is not getting linearly added
      - why do i have to find it?
        
        i can use it to find the time needed to study
        
        i can use it to find the time needed to practive for a sklt
      - skill aquired after seeing the solution
        
        only focus on the returns and dont bother about the things not related with the return value
    - - arrays in python
        
        we dont neet to specify the type when initializing the array ie LIst
      - how to get the sizw of an array
        
        in C++
        
        array.size()
        
        in python
        
        len (attaname)
  - - - arrays
        
        greed[i]
        
        cookies[i]
      - condition to be succesful in the tasl
        
        s[j] > g[i]
    - - iterrate with n*n
        
        there was a problem , people were not using this but a modified version
        
        i think to make the algorithm more efficeien people were checling that if the anwer had nor exxeded the array being iterated because there could be no more children satisfied thatn the children present in the greed rate array
      - what can be the conditions
        
        if(j < g.length && s[i] >= g[j])
        
        j++;
        
        int i = 0;
        
        for(int j=0;i<g.length && j<s.length;j++) {
        
        if(g[i]<=s[j]) i++;
      - skills aquired after seeing the solution
        
        always see first that is it possible to sort the array first
    - - how to sort
        
        in jave
        
        s.sort()
        
        in c++
        
        sort(g.begin() , g.end() )
      - for loop in java
        
        there can be two ending condition in java
  - - - an array having 2n integets
        
        why 2n
        
        we have to make n pairs out of it
        
        what we have to do next ?
        
        we have to get mininum of all of it
        
        than sum it up
        
        isnt that easy?
        
        it will be more easy if we could know how to maxmize the sum of minimums
    - - 1) how will we make pairs out of array?
        
        we will itertate the form once left and once from the right in n*N form
        
        we will first sort the array
        
        in th aproach of sorting given by leet code
        
        they dont pair , they just first sort the array and than jump by 2 to add the selected onte
        
        why
        
        the think that the bigger number is not contributing in the answer so why bother it
      - 2 how will we make the optimize pairs ?
        
        we can optimize it
      - how will we sum up the minimum of the pairs?
    - - i will be able to make the best possible teams in a project with this
        
        how
        
        if i find the maximum instead of minimum i can sort out the half bests of all the team
        
        i can recognize how many teamates are not able to cope with the work so they can be given the training
      - i will be abel to
        
        the bads and goods of each team mate and can sum in how much bads m
  - - - WHAT DATA IS GIVEN?
        
        ARRAYS
        
        FLOWER BED
        
        CONTAINS ONLY 0 AND 1
        
        CONDITIONS
        
        THERE ARE NO TWO ADJACENT FLOWER IN FLOWER BED
        
        REURN VALUE
        
        N
        
        HOW MANY FLOWERS CAN BE POTTED
      - HOW AM I TRYING TO SOLVE IT ?
        
        HOW WILL I KNOW THAT THERE IS A ZERO OUT THERE WHOSE ADJCENTS ARE ALSO ZERO
        
        HOW WILL IN KNOW THAT THERE ARE THREE CONSEQUTIVES ZEROES
        
        CAN I DO IT WITH A CONDITION IN ITERATION THAT IF A NUMBER IS ZERO IN ITS MINYS 1 INDES AND PLUS 1 INDEX IS ZERO THAN WE HAVE GOT THE WAY?
      - programmin skills
        
        saving a condition
        
        bool isrightempty = (i == 0 )|| (nums[i-1] == 0)
        
        returning a conditoin 's value
        
        return count > n
    - - what data have i been given ?
        
        integers
        
        lemonade
        
        5
        
        bill
        
        5
        
        10
        
        20
        
        CONDTIONS TO WIN
        
        YOU MUST PROVIDE THE CORRECT CHANGE
        
        GIVING THE BOOL THAT IF I CAN PAY THE CHANGES OR NOT
        
        ARRAYS
        
        BILLS
      - WHY AM I TRYING TO SOLVE THIS
        
        CAN SOLVING THIS SUM HELP ME IN MAINTAINING CASH FLOW
        
        MY GETTING SUPLIES FORM TEAM AND CHCKING THAT IF THAT SUPPLY CAN SUFFICE AND QOUATAON?
        
        CAN THIS HELP ME IN MANAGING HUSSAIN SCHEME , MATCHING WHICH TIME PERIOD OF LENDING MATHCHES WHICH TIME PERIOD OF BORROWING ?
      - HOW AM I TRYING TO
      - HOW am i trying to solve the problem ?
        
        how will i know how many 5 $ have i collected so far?
        
        how will i know that a 10 dollar need a 5$ and a 20% need a 5$+ 10$
        
        can i mantain arrays of 5 and 10 dollars note as reserves of these notes?
        
        can i use that in fullfilling a condition ?
        
        how will i mark how many 10 and 20 have been filled
        
        it is not nessecaarry to mark it as those will not contribute to the answer?
        
        can i mark an starting condition that if the array is empty of it just has the 5 dollars notes we will just return it as true
- - - - linked lis
        
        list 1
        
        list 2
      - condtition to wil
        
        merge these two lists
        
        join the two by splicing together the nodes of two
    - - i can merge two operation teams like this together
        
        for discussion on inovation
        
        as the congruitu in order can be symbolize as the hierchy of anti hierchy
      - i can merge the verse of two qasidas and know the common ordered themes among them
    - - i wil have to know
        
        how is a list joined togethoe
        
        how can a forloop be used on a linked list
        
        HOW CAN I ACCESS THE MEMBER OF LINKED LIST
        
        HOW CAN I
      - CAN I ITERATE THE TWO AND JOINED LIKE THID?
        
        IS ANY OF THE ITERATION BE NEEDING THE ACCESS TO THE HEAD POINTER ?
      - how are they solving it ?
        
        they make a temp and a dummy node
        
        they are moving the head of list in a condition
        
        of list 1 is less than list2
        
        than list 1 is gona move
        
        if list 2 is less than list1
        
        list 2 is gonna move
  - - - a linked list holding in its noded a binary number
      - the condition to win
        
        getting the decimal number from it and retyring in integer form
    - - i can start to decode things that are shatterd like the secret messege survice does
      - while sending a secret messege i can scatter it while giving a clue with each node of messege about the next clue
    - - how will i traverse the link list ?
        
        i can use the while loop and use the link->next pointer
        
        can i use a forloop for that?
      - how am i going to decode the messeg ? is there a fumction to do so?
        
        i will use the convert funtion chapa chapi
      - why are they saying the most significant number is the head node
        
        is it that we may not miss it?
        
        is it so we when decode the function the first number should be that
      - how will i make an integer مستخرجا from the link list
      - am i doing the smart thing by iterating just to convert it from the linked list to array
      - how are they solving the problem ?
        
        what
        
        the placed the airthematic of nums = nums *2 + head->next->val
    - - what are the words used for loops
        
        traverse
        
        iterate
        
        parse
      - divide the problem into subproblem giving a concrete defination for both
      - the looping process in linked list is to make the while loop indefinate and continously advance the list with head->next
      - the value is got by head->val
  - - - i can make a set library out of it
      - i can analyze the effect of a sentence without takraar
    - - if the then of the if statement is in the same line than curly brakets are not neccassary:
  - - - a linked list whose middle needs to be given
    - - it will help in finding the middle of a set whole definite number is not
    - - i will iterate from up and down
        
        when the i and j bec
    - - first put the parisng aparatus than put the magic of solutiion
  - - - pointers
        
        pos for the index
        
        pos is not passed
        
        next for the following node
    - - i can find wastage of resources in a administrative department by this? work expands with the time
      - ninaweza tafuta mahusiano katika kundi la watu
      - ninaweza kupata mundo wa tarifaa katika kundi la maloomati
    - - naweza kutumia moja whilw loop
        
        kwa nini ?
        
        kwa kupata takrari katika linked list
        
        naweza kutumia ikiwa nodi inapatikana tene
      - neweza kuweka hali kwenye braket ya hali
        
        anakuna hali function , katika function moja kurudia ambayo kupata la node ambayo umepwa kwyenye orodha
  - - - mbili raas ya orodha wamapewa
        
        hakuna mzunguko katika orodha zote mblil
      - nini lazimi ninafanya?
        
        lazimi ninapate makutona
        
        lazima wanahafizi zote orodha shakli yake asli(mbili orodha zinapaswa kuhafidhi muundo asli)
    - - naweza kutumia kuturudhi ?
        
        katika ordho awwali naweza kuturudhi orodha sani
        
        ikiwa node la orodha zote mbili zitakuna sawa , tumefute jabi yetu
      - kututoa hilli kwa codeleet
        
        while a!=b
        
        a = a==null? headB: a.next;
        
        b = b==null? headA : b.next;
  - - - umepewa
        
        head
        
        na integer val
      - nina lazima ninafanya
        
        lazima ninaondoe tote node ambazo ni sawa na val
    - - ninatotua tatizo hilli kama ninaatasali node sabiqi kwa node baadi , lini anakuna sawa val na node ambaya nodi kupatikana
    - - nini tarifu wampewa ?
        
        tarifu umepewa kama hilli
        
        orodha moja
        
        nini lazima ninafanya ?
        
        lazima ninatabadalishe utartibu ya orodha
        
        lazima ninakupata orodha katika hali ya kutabadalisha
      - vipi nintotua tatizo hilli ?
        
        ninatotua tatizo hilli kama hilli
      - vipi ninatotua tatizo hilli ?
        
        ninakutimai kuturudhi
        
        naweza kuwaanza kutoka mwanzo
        
        naweza
      - reverse link 2
        
        data gani imitolewa
        
        data imitolewa kama hilli
        
        pointer kesho
        
        pointer koshoto
        
        i
        
        gani lazima nafanya ?
        
        lazima natabadilshe utartibu le orodha kotoku koshoto kwende kulia
        
        kwanini nitotua tatizo hili ?
        
        kwasababy mimi naweza kupata mambo mambaya kutoka kundi ya mambo nzuri
        
        vipi ?
        
        mimi ni naweza kufikia kwende nodi koshoto na natuaanza kubadalishe nodi na nodi kwende pointer kulia
        
        vipi nifakia nodi koshoto ?
        
        naweza kufikia nodi kushotu kwa kutumia while loop
        
        a
        
        baadi haapo nini?
        
        baadi haapo naweza kutaanza kutabadilishe nodi bada ya nodi