Learn how to use greedy algorithms to solve coding challenges. Many tech companies want people to solve coding challenges during interviews and many of the challenges can be solved using a greedy algorithm. A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. ✏️ Course from Tanishq Chaudhary. Check out his channel: https://www.youtube.com/c/TanishqChaudhary1337/ Links to coding challenges on InterviewBit: ? Highest product: https://www.interviewbit.com/problems/highest-product/ ? Bulbs: https://www.interviewbit.com/problems/interview-questions/ ? Disjoint intervals: https://www.interviewbit.com/problems/disjoint-intervals/ ? Largest permutation: https://www.interviewbit.com/problems/largest-permutation/ ? Meeting rooms: https://www.interviewbit.com/problems/meeting-rooms/ ? Distribute candy: https://www.interviewbit.com/problems/distribute-candy/ ? Seats: https://www.interviewbit.com/problems/seats/ ? Assign mice to holes: https://www.interviewbit.com/problems/assign-mice-to-holes/ ? Majority element: https://www.interviewbit.com/problems/majority-element/ ? Gas station: https://www.interviewbit.com/problems/gas-station/ ❤️ Try interactive Algorithms courses we love, right in your browser: https://scrimba.com/freeCodeCamp-Algorithms (Made possible by a grant from our friends at Scrimba) ⭐️ Course contents ⭐️ ⌨️ (0:00:00) Greedy introduction ⌨️ (0:04:32) Bulbs ⌨️ (0:12:11) Highest product ⌨️ (0:17:08) Disjoint intervals ⌨️ (0:28:43) Largest permutation ⌨️ (0:38:30) Meeting rooms ⌨️ (0:49:25) Distribute candy ⌨️ (1:03:13) Seats ⌨️ (1:19:13) Assign mice to holes ⌨️ (1:24:19) Majority element ⌨️ (1:35:28) Gas station ⌨️ (1:52:39) End -- ? Thanks to our Champion and Sponsor supporters: ? Raymond Odero ? Agustín Kussrow ? aldo ferretti ? Otis Morgan ? DeezMaster -- Learn to code for free and get a developer job: https://www.freecodecamp.org Read hundreds of articles on programming: https://freecodecamp.org/news