Please enable JavaScript.

Coggle requires JavaScript to display documents.

temp - Coggle Diagram

- - - - trivial cases
        
        nth day
        
        at least one such day
      - name such days as prime days
    - - topic K
        
        studied all topics from 1 to K including both
  - - - student has studied only and exactly m topics
        
        why becuase everyday one topic
      - if prime day
        
        student must not have studied any topic from m+1 to n
        
        but student must have studied m topics by now so student must have studied all the topics from 1 to m
        
        also any day lets say l th day ahead of the mth day will be prime only if student studied all the topics from m+1 to l within the extra days
        
        CONCLUSION
        
        the function schedule defined in a restricted domain 1 to m must be one one and onto function with range = domain
        
        BUT SUFFICIENTLY YOU JUST NEED TO CHECK THAT MAX TOPIC TILL NOW = M OR THE SUM OF THE TOPICS TILL NOW = M(M+1)/2
- - - - which return the largest element of the tree which is rooted at that given tree node object in other words tree which has the root at the object for which this method has been called
      - base case if no branches then self.x return
      - max of the self and the values returned when we call the getLargest on the left and right branches of the tree