Greedy Algorithms Tutorial – Solve Coding Challenges

By freeCodeCamp.org
Published: Jun 27, 2022

“
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/TanishqChau…

Links to coding challenges on InterviewBit:
• Highest product: https://www.interviewbit.com/problems…
• Bulbs: https://www.interviewbit.com/problems…
• Disjoint intervals: https://www.interviewbit.com/problems…
• Largest permutation: https://www.interviewbit.com/problems…
• Meeting rooms: https://www.interviewbit.com/problems…
• Distribute candy: https://www.interviewbit.com/problems…
• Seats: https://www.interviewbit.com/problems…
• Assign mice to holes: https://www.interviewbit.com/problems…
• Majority element: https://www.interviewbit.com/problems…
• Gas station: https://www.interviewbit.com/problems…

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

[READ MORE]

”