Menu
CLCompetitive ProgrammingRoadmapContestsToolsBlog
GitHub
🌜
🌞
CLCompetitive Programming
  • Roadmap
  • Contests
  • Tools
  • Blog
  • GitHub
  • Basics
    • Learn C++
    • Time and Space Complexity
    • Some other important things
  • STL
    • STL Tutorials
    • Practice Problems for STL
    • Editorials to STL practice problems
    • Implementation and Regular Contests
  • Number Theory
    • Number Theory Tutorials
    • Practice Problems for Number Theory
  • Binary Search
    • Binary Search Tutorials
    • Practice Problems for Binary Search
  • Graph Theory
    • Graph Theory Tutorials
    • Practice Problems for Graph Theory
  • Programming Techniques
    • Greedy Tutorials
    • DP Tutorials
    • Practice Problems
  • Advanced
    • DP on Graphs
    • DP with Bitmasks

Greedy Tutorials

  1. Read hackerearth article on greedy technique

  2. Whiteboard slides used during the session can be found here

tip

Note: Generally, greedy techniques are used to solve either Optimisation problems (Problems where we need to minimise or maximise something) or Yes/No problems (Problems where the answer to the problem is Yes or No).

Edit this page
Previous
« Practice Problems for Graph Theory
Next
DP Tutorials »

Roadmap

  • Basics
  • STL
  • Number Theory
  • Binary Search
  • Graph Theory
  • Programming Techniques

Important Tools

  • Coding Schedule
  • OEIS
  • CP Editor
  • Diff Checker
  • CSAcademy online IDE
  • VisuAlgo
  • Algorithm Visualizer

More

  • Blog
  • Contests
  • GitHub
Copyright © 2020 Cyber Labs. All Rights Reserved.