Please enable JavaScript.

Coggle requires JavaScript to display documents.

LeetCode Problem (Data Structures (Queue (BFS, Sliding Window, Implement…

- - - - Store Previous Result
    - - Max/Min Stack
        
        Notice: You have to store previous min /max when you see the new min max
  - - - Insert (x)
      - search(x)
      - delete (x)
      - get length
      - reverse
        
        pointers
        
        recursion
      - Check for:
        
        node is head
        
        node is tail
        
        check for ANY node for NULL
    - - LRU/LFU
        
        LRU： Doubly Linked HashMap
        
        LFU
        
        DoublyLinkedList + HashMap
    - - Fast and Slow
        
        check for fast != null && fast.next != null
- - - - Level Order
        
        Get Size of Current Level First
- - - - BFS
        
        Queue, LC117
        
        Const Space
        
        Level Order Traversal
        
        Serialize and Serialize Binary Search Tree
      - DFS
        
        Twisted version of post order
        
        Used with Level
    - - Pre-Order
        
        stack, visited current node, then pushRight child, then left child
      - In-Order
        
        Stack, push current and left child, then pop, then move pointer to the right
      - Post-Order
    - - House Rubber 3
      - Maximum Path Length