#greedy articles | Hashnode

LWLim Woojaejaylog.hashnode.devJul 22 · 6 min read

[CS fundamentals] Greedy - Dijkstra, Kruskal and Prim's Algorithm

Introduction In this article, we will look at popular greedy algorithms, which are Dijkstra, Kruskal and Prim's Algorithm. Think about how Google Maps finds the shortest path from your home to your fa

0

NNikhithabugfreenik.hashnode.devNov 25, 2025 · 2 min read

Boats to Save People

Hey Coders, Today we are going to understand and solve the Boats to Save People problem from LeetCode. Problem: we are given an array consisting of people’s weights , limit (capacity of a boat)and asked to find the minimum number of boats required. C...

0

CDCHAO DUleetlog-by-chao.hashnode.devNov 15, 2025 · 3 min read

✨ LeetCode 452 — Minimum Number of Arrows to Burst Balloons (Greedy Explained)

🌟 Introduction This is one of the cleanest interval-greedy problems on LeetCode. You’re given a list of horizontal balloon ranges on the x-axis. If you shoot an arrow at position x, it will burst every balloon whose interval contains x. Your goal is...

0

SSandeshsoulsync.techOct 6, 2025 · 6 min read

Greed, Jealousy, Envy: The 3 Silent Energy Drainers

Let’s be honest - most of us don’t need monsters under the bed anymore. We carry our own little villains right in our heads: greed, jealousy, and envy. They don’t scream, they don’t roar - they whisper. And before you know it, they’ve hijacked your p...

0

RRedAurtherreleetcode.hashnode.devAug 20, 2025 · 2 min read

Container With Most Water

🧠 Problem Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a co...

0

RRedAurtherreleetcode.hashnode.devAug 1, 2025 · 1 min read

Minimum Number of Operations to Convert Time

🧠 Problem You are given two strings current and correct representing two 24-hour times. 24-hour times are formatted as "HH:MM", where HH is between 00 and 23, and MM is between 00 and 59. The earliest 24-hour time is 00:00, and the latest is 23:59. ...

0

RRedAurtherreleetcode.hashnode.devAug 1, 2025 · 1 min read

Minimum Health to Beat Game

🧠 Problem 🏷️ Tags array, greedy, prefix-sum 📊 Difficulty Medium ✅ Success Rate: 58.7%📥 Submissions: 2,054📈 Accepted: 1,206 ❤️ Reactions 👍 Likes: 30👎 Dislikes: 12 💡 Hints When should you use your armor ability? It is always optimal to use ...

0

AHAnni Huanghuanganni.hashnode.devJul 18, 2025 · 6 min read

LeetCode Daily Challenge-2163: Minimum Difference in Sums After Removal of Elements(Hard, Java, DP+priorityQueue+greedy)

Problem Statement LeetCode 2163: Minimum Difference in Sums After Removal of Elements Difficulty: Hard Topics: Array, Dynamic Programming, Heap (Priority Queue) Date: 18 July 2025 You are given a 0-indexed integer array nums consisting of 3 * n el...

0

AHAnni Huanghuanganni.hashnode.devJul 13, 2025 · 2 min read

LeetCode 435 Non-overlapping Intervals - Greedy(Med, Java, O(nlogn))

Problem Statement LeetCode 435. Non-overlapping Intervals Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Exampl...

0

AHAnni Huanghuanganni.hashnode.devJul 13, 2025 · 3 min read

LeetCode 316 Remove Duplicate Letters

Problem Overview LeetCode 316 Remove Duplicate Letters Remove duplicate letters from a string such that every letter appears exactly once, and the result is the lexicographically smallest possible string. Algorithm Breakdown Step 1: Track Last Occu...

0

#greedy

#greedy

Explore Hashnode

Trending tags this week