All Greedy Coding Problems || placement 2020 || coding || IIT/NIT/BITS

     

•     Activity Selection       Problem       

[https://practice.geeksforgeeks.org/problems/nmeetings-in-one-room/0   ]      

       

•     Job  Sequencing  Problem       

[https://practice.geeksforgeeks.org/problems/jobsequencing-problem/0   ]      

       

•     Huffman       Coding  

[https://practice.geeksforgeeks.org/problems/huffmanencoding/0        ]      

       

•     Water    Connection  Problem       

[https://practice.geeksforgeeks.org/problems/waterconnection-problem/0   ]      

       

•     Minimum     Swaps    for   Bracket Balancing    

[https://practice.geeksforgeeks.org/problems/minimu m-swaps-for-bracket-balancing/0       ]      

       

•     Fitting   Shelves  Problem       

[https://www.geeksforgeeks.org/fitting-shelvesproblem/       ]      

       

•     Minimum     cost to    connect all    cities     

[https://www.geeksforgeeks.org/minimum-costconnect-cities/    ]      

       

       

       

Max Flow       Problem        Introduction       

[       https://www.geeksforgeeks.org/max-flow-problemintroduction/     ]      

       

•     Maximum     product subset   of    an   array     

[https://www.geeksforgeeks.org/maximum-productsubset-array/      ]      

       

•     Maximize      array      sum        after       K     negations    

[https://practice.geeksforgeeks.org/problems/maximiz e-sum-after-k-negations/0]   

       

•     Maximize      the  sum        of    arr[i]*i  

[https://practice.geeksforgeeks.org/problems/maximiz e-arrii-of-an-array/0]      

       

•     Maximum     sum        of    absolute        difference     of    an array     

[https://www.geeksforgeeks.org/maximum-sumabsolute-difference-array/]  

       

•     Maximize      sum        of    consecutive differences   in    a circular array     

[https://practice.geeksforgeeks.org/problems/swapand-maximize/0]      

       

•     Minimum     sum        of    absolute        difference     of pairs      of    two arrays   

[https://www.geeksforgeeks.org/minimum-sumabsolute-difference-pairs-two-arrays/]     

Array     element moved   by   k      using      single     moves       

[https://www.geeksforgeeks.org/array-element-movedk-using-single-moves/]      

       

       

•     Program        for   Shortest Job  First       (or  SJF) CPU Scheduling   [https://www.geeksforgeeks.org/program-for-shortest-jobfirst-or-sjf-cpu-scheduling-set-1-non-preemptive/]     

       

•     Program        for   Least      Recently       Used      (LRU) Page      

Replacement       algorithm    

[https://practice.geeksforgeeks.org/problems/pagefaults-in-lru/0]      

       

•     Set  Cover     Problem       

[https://www.geeksforgeeks.org/set-cover-problemset-1-greedy-approximate-algorithm/]    

       

•     Graph    Coloring        Problem       

[https://www.geeksforgeeks.org/graph-coloring-set-2greedy-algorithm/  ]      

       

•     Fractional     Knapsack      Problem       

[https://practice.geeksforgeeks.org/problems/fractiona l-knapsack/0]    

       

•     Greedy  Algorithm     to    find Minimum     number of Coins    

[https://practice.geeksforgeeks.org/problems/coinpiles/0]

Maximum     trains     for   which    stoppage       can be        provided      

[https://www.geeksforgeeks.org/maximum-trainsstoppage-can-provided/]    

       

•     Buy Maximum     Stocks    if     i       stocks    can be   bought on   i-th day

[https://www.geeksforgeeks.org/buy-maximum-stocksstocks-can-bought-th-day/]      

       

•     Find       the  minimum     and maximum    amount to buy all    N     candies

[https://practice.geeksforgeeks.org/problems/shop-incandy-store/0]      

       

•     Minimize      Cash       Flow       among   a      given      set  of friends  who        have       borrowed     money   from each       other     

[https://www.geeksforgeeks.org/minimize-cash-flowamong-given-set-friends-borrowed-money/] 

       

•     Minimum     Cost        to    cut  a      board     into squares

[https://www.geeksforgeeks.org/minimum-cost-cutboard-squares/]  

       

•     Check     if     it     is     possible to    survive  on   Island   

[https://www.geeksforgeeks.org/survival/]   

       

•     Smallest subset   with       sum        greater  than       all other      elements      

[https://www.geeksforgeeks.org/smallest-subset-sumgreater-elements/]  

Chocolate     Distribution Problem       

[https://practice.geeksforgeeks.org/problems/left-outcandies/0]    

       

•     DEFKIN -       Defense of    a      Kingdom      

[https://www.spoj.com/problems/DEFKIN/]

       

•     DIEHARD     -       DIE HARD   

[https://www.spoj.com/problems/DIEHARD/]     

       

•     GERGOVIA   -       Wine      trading  in    Gergovia      

[https://www.spoj.com/problems/GERGOVIA/]   

       

•     Picking  Up   Chicks  

[https://www.spoj.com/problems/GCJ101BB/]    

       

•     CHOCOLA     –      Chocolate    

[https://www.spoj.com/problems/CHOCOLA/]    

       

•     ARRANGE    -       Arranging     Amplifiers   

[https://www.spoj.com/problems/ARRANGE/]    

       

•     K     Centers Problem       

[https://www.geeksforgeeks.org/k-centers-problem-set-1greedy-approximate-algorithm/]   

       

•     Minimum Cost of ropes

[https://practice.geeksforgeeks.org/problems/minimum-costof-ropes/0]

 

•     Prim’s Minimum Spanning Tree (MST)

[https://www.geeksforgeeks.org/prims-minimum-spanningtree-mst-greedy-algo-5/]

 

•     Minimum Platforms Problem

  [https://practice.geeksforgeeks.org/problems/minimumplatforms/0]

 

•     Efficient Huffman Coding for Sorted Input

[https://www.geeksforgeeks.org/efficient-huffman-codingfor-sorted-input-greedy-algo-4/]

 

•     Prim’s MST for Adjacency List Representation

[https://www.geeksforgeeks.org/prims-mst-for-adjacencylist-representation-greedy-algo-6/]

 

•     Kruskal’s Minimum Spanning Tree Algorithm

[https://www.geeksforgeeks.org/kruskals-minimumspanning-tree-algorithm-greedy-algo-2/]