Please enable JavaScript.

Coggle requires JavaScript to display documents.

Problem Solving (Listen (Example (Brute Force (Optimize (Walk Through…

- - - - Optimize
        
        Walk Through
        
        Implement
        
        Test
        
        appropriate code reuse
        
        modular
        
        error checking
        
        After figuring out optimal algo, before diving into code, understand the algorithm
        
        Sometimes storing extra state helps in saving time. May be use a hash table
        
        Precompute Information like sorting
        
        Avoid bottlenecks
        
        Figure out the work that is done repeatedly like searching
        
        Find out part of the algorithm that is taking most time like sorting
        
        Unnecessary and Duplicated work
        
        Figure out the work which looks duplicated. Can we optimize it?
        
        DIY - how you would solve the problem manually
        
        try to fit all data structures you know
        
        Linked List or
        
        Array or
        
        Binary Tree or
        
        Heap or
        
        something else
        
        Knowing the Best conceivable runtime sometimes help in solving the problem