Algorithms

Basic Graph Theory:

    1. Degree Of Node
    2. Breadth-first search
    3. Depth-first search
    4. Topological Sorts using indegree (Kahn's algorithm)
    5. Minimum spanning tree (Kruskal's algorithm)
    6. Second best MST (using Kruskal)
     
       Some Graph Problems


Basic Digit DP:

    1. Given n & sum find all the n digit numbers with sum of digit as sum with no leading zero
    2. Count all numbers up to A that have sum of digits equal to S