---
title: "#greedy articles | Hashnode"
description: "Explore 46 articles tagged #greedy on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/greedy"
---

Tag

# #greedy

46 posts · 0 followers

[Sk Shoyeb](https://hashnode.com/@skshoyebjs) · [Sep 18](https://hashnode.com/posts/maximum-number-of-non-overlapping-substrings-java-solution-greedy/6aacbe1a35039607ed5ba109)

### [Maximum Number of Non-Overlapping Substrings | Java Solution | Greedy](https://skshoyebjavascript.hashnode.dev/maximum-number-of-non-overlapping-substrings-java-solution-greedy?utm_source=hashnode&utm_medium=feed)

Given a string s of lowercase letters, you need to find the maximum number of non-empty substrings of s that meet the following conditions: The substrings do not overlap, that is for any two substrin

3 min read · [skshoyebjavascript.hashnode.dev](https://skshoyebjavascript.hashnode.dev/maximum-number-of-non-overlapping-substrings-java-solution-greedy?utm_source=hashnode&utm_medium=feed)

[Vijay Ram Enaganti](https://hashnode.com/@vijay-ram-enag) · [Aug 31](https://hashnode.com/posts/sequential-attention/6a958669cc91e42ff4ace729)

### [Reproducing Sequential Attention](https://vijay-ram.hashnode.dev/sequential-attention?utm_source=hashnode&utm_medium=feed)

(and finding out where my reproduction disagrees with Google's)

9 min read · [vijay-ram.hashnode.dev](https://vijay-ram.hashnode.dev/sequential-attention?utm_source=hashnode&utm_medium=feed)

[Lim Woojae](https://hashnode.com/@jaylog) · [Jul 22](https://hashnode.com/posts/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm/6a60dee33bf038f7b9a8f2af)

### [\[CS fundamentals\] Greedy - Dijkstra, Kruskal and Prim's Algorithm](https://jaylog.hashnode.dev/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm?utm_source=hashnode&utm_medium=feed)

Think about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph

6 min read · [jaylog.hashnode.dev](https://jaylog.hashnode.dev/cs-fundamentals-greedy-dijkstra-kruskal-and-prim-s-algorithm?utm_source=hashnode&utm_medium=feed)

[Nikhitha](https://hashnode.com/@BugFreeNik) · [Nov 25, 2025](https://hashnode.com/posts/boats-to-save-people/6925e5827040fdfa90b5eb53)

### [Boats to Save People](https://bugfreenik.hashnode.dev/boats-to-save-people?utm_source=hashnode&utm_medium=feed)

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...

2 min read · [bugfreenik.hashnode.dev](https://bugfreenik.hashnode.dev/boats-to-save-people?utm_source=hashnode&utm_medium=feed)

[CHAO DU](https://hashnode.com/@chaos789) · [Nov 15, 2025](https://hashnode.com/posts/leetcode-452-minimum-number-of-arrows-to-burst-balloons-greedy-explained/6917e321e917b1d4a967e4ed)

### [✨ LeetCode 452 — Minimum Number of Arrows to Burst Balloons (Greedy Explained)](https://leetlog-by-chao.hashnode.dev/leetcode-452-minimum-number-of-arrows-to-burst-balloons-greedy-explained?utm_source=hashnode&utm_medium=feed)

Learn the greedy interval strategy to solve LeetCode 452. Shrink overlaps, minimize arrows, and burst all balloons efficiently with Java.

3 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/leetcode-452-minimum-number-of-arrows-to-burst-balloons-greedy-explained?utm_source=hashnode&utm_medium=feed)

[Sandesh](https://hashnode.com/@sandesh641) · [Oct 6, 2025](https://hashnode.com/posts/greed-jealousy-envy-the-3-silent-energy-drainers/68e3c755ba06a78ae8f4d32e)

### [Greed, Jealousy, Envy: The 3 Silent Energy Drainers](https://soulsync.tech/blog/greed-jealousy-envy-the-3-silent-energy-drainers?utm_source=hashnode&utm_medium=feed)

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.

6 min read · [soulsync.tech](https://soulsync.tech/blog/greed-jealousy-envy-the-3-silent-energy-drainers?utm_source=hashnode&utm_medium=feed)

[RedAurther](https://hashnode.com/@RedAurther) · [Aug 20, 2025](https://hashnode.com/posts/container-with-most-water/68a60b701084dc46466cd658)

### [Container With Most Water](https://releetcode.hashnode.dev/container-with-most-water?utm_source=hashnode&utm_medium=feed)

🧠 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...

2 min read · [releetcode.hashnode.dev](https://releetcode.hashnode.dev/container-with-most-water?utm_source=hashnode&utm_medium=feed)

[RedAurther](https://hashnode.com/@RedAurther) · [Aug 1, 2025](https://hashnode.com/posts/minimum-number-of-operations-to-convert-time/688d1af3033cd55665c69689)

### [Minimum Number of Operations to Convert Time](https://releetcode.hashnode.dev/minimum-number-of-operations-to-convert-time?utm_source=hashnode&utm_medium=feed)

🧠 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. ...

1 min read · [releetcode.hashnode.dev](https://releetcode.hashnode.dev/minimum-number-of-operations-to-convert-time?utm_source=hashnode&utm_medium=feed)

[RedAurther](https://hashnode.com/@RedAurther) · [Aug 1, 2025](https://hashnode.com/posts/minimum-health-to-beat-game/688d1aed18ab28f21f2ff086)

### [Minimum Health to Beat Game](https://releetcode.hashnode.dev/minimum-health-to-beat-game?utm_source=hashnode&utm_medium=feed)

🧠 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 ...

1 min read · [releetcode.hashnode.dev](https://releetcode.hashnode.dev/minimum-health-to-beat-game?utm_source=hashnode&utm_medium=feed)

[Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 18, 2025](https://hashnode.com/posts/leetcode-daily-challenge-2163-minimum-difference-in-sums-after-removal-of-elementshard-java-dppriorityqueuegreedy/6879c39e8768b04af3a6ad99)

### [LeetCode Daily Challenge-2163: Minimum Difference in Sums After Removal of Elements(Hard, Java, DP+priorityQueue+greedy)](https://huanganni.hashnode.dev/leetcode-daily-challenge-2163-minimum-difference-in-sums-after-removal-of-elementshard-java-dppriorityqueuegreedy?utm_source=hashnode&utm_medium=feed)

TC O(n log n) SC O(n) using minHeap, maxHeap and DP

6 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-2163-minimum-difference-in-sums-after-removal-of-elementshard-java-dppriorityqueuegreedy?utm_source=hashnode&utm_medium=feed)
