Tagged articles
greedy
20 articles · Page 1 of 1
This tutorial walks through implementing core algorithms and data structures in Go, covering language basics, arrays, slices, linked lists, stacks, queues, trees, graphs, sorting and searching techniques, as well as dynamic programming and greedy strategies, with concrete code examples and performance considerations.
AlgorithmsDynamic ProgrammingGo
0 likes · 32 min read

Multi‑armed bandit models illustrate the core exploration‑exploitation dilemma in reinforcement learning, covering greedy, ε‑greedy, and optimistic‑initial‑value strategies, as well as sample‑average and incremental Q‑value estimation methods with practical examples and visual illustrations.
Q-value estimationReinforcement Learningexploration vs exploitation
0 likes · 15 min read

This article walks through the difference between greedy and non‑greedy regular expression patterns in Python, shows practical code examples, visual output, and even demonstrates how to use named groups for more precise matching.
Named GroupsPythongreedy
0 likes · 4 min read

This article presents four algorithmic interview problems covering travel scheduling with priority constraints, optimal homework task ordering, maximizing distinct garden beauty scores after a single flip operation, and reconstructing insertion sequences for a linear‑probing hash table, each with detailed analysis, solution ideas, and reference Python code.
Simulationcoding interviewgreedy
0 likes · 15 min read

This article explains the principles of A/B testing and the ε‑greedy multi‑armed bandit algorithm, illustrates their practical use in e‑commerce recommendation optimization, and draws broader life lessons about balancing exploration and exploitation for better personal and professional decisions.
A/B testingexploration vs exploitationgreedy
0 likes · 6 min read

Given a binary string, you may color some '1's red and some '0's blue but adjacent opposite bits cannot both be colored; this article presents O(N) dynamic‑programming and greedy algorithms that compute the maximum number of characters that can be colored, with full code examples in Python, Java, and C++.
AlgorithmDynamic Programmingbinary string
0 likes · 9 min read

This article explains a coding problem where a merchant trades multiple goods over several days, describes the input and output formats, demonstrates how each product can be handled independently using a greedy approach identical to LeetCode 122, provides a full Python implementation, and analyzes its time and space complexity.
AlgorithmDynamic Programmingcoding interview
0 likes · 8 min read

This article provides a comprehensive overview of fourteen algorithmic strategies—including greedy, recurrence, recursion, enumeration, backtracking, divide‑and‑conquer, and dynamic programming—explaining their characteristics, typical use cases, inter‑relationships, and the types of problems each approach best addresses.
AlgorithmsDivide and ConquerDynamic Programming
0 likes · 9 min read

This article explains the LeetCode 1402 problem of maximizing the total satisfaction score by arranging dishes, describes the greedy approach of sorting and using suffix sums, and provides a Java implementation that iteratively adds positive suffix sums to compute the optimal result.
AlgorithmJavaLeetCode
0 likes · 4 min read

This article explains the difference between greedy and non‑greedy patterns in Python regular expressions, demonstrates their behavior with practical code examples, shows how to capture HTML tags, and introduces named group techniques, helping readers master regex matching nuances.
Named Groupsgreedynon-greedy
0 likes · 4 min read

This article explains how to parse Chinese ID numbers to extract gender and age, demonstrates the checksum calculation, and then walks through classic algorithm challenges—including climbing stairs, longest palindrome, trapping rain water, and greedy cookie allocation—providing clear JavaScript implementations for each.
AlgorithmsDynamic ProgrammingLeetCode
0 likes · 18 min read

This article presents a classic stock‑like profit maximization problem using mooncake prices, explains the input and expected output, and walks through three solution strategies—brute‑force enumeration, a greedy linear scan, and a dynamic‑programming approach—complete with Go code examples and visual illustrations.
AlgorithmDynamic Programmingbrute-force
0 likes · 6 min read

This article explains the classic circular gas‑station challenge, presents its key constraints, walks through a concrete example, and compares three solution strategies—brute‑force, reverse (backtrack) greedy, and a cumulative‑sum graphical method—highlighting their trade‑offs and insights.
Algorithmbrute-forcecoding interview
0 likes · 7 min read

This comprehensive guide explores core algorithmic strategies for finding optimal solutions—including recursion, greedy methods, divide-and-conquer, dynamic programming, backtracking, and branch-and-bound—explaining their principles, use-cases, and providing concrete Java and C++ code examples to illustrate implementation details.
AlgorithmsDivide and Conquerbacktracking
0 likes · 54 min read

Given an array where each element indicates the maximum jump length from that position, this article explores multiple strategies—depth‑first search, dynamic programming, greedy, and reverse‑tracking—to determine whether the frog can reach the last board, comparing their efficiency and implementation details.
AlgorithmDFSDynamic Programming
0 likes · 7 min read

This article explains Python regular expression special characters such as $ and ?, demonstrates greedy and non‑greedy matching with step‑by‑step examples and screenshots, and shows how to extract substrings correctly using appropriate patterns, helping readers master precise string extraction for web crawling.
Pythongreedynon-greedy
0 likes · 6 min read

This article revisits fundamental algorithmic strategies—divide‑and‑conquer, dynamic programming, greedy methods, backtracking, and branch‑and‑bound—detailing their core ideas, applicable problem characteristics, key considerations, procedural steps, and illustrative examples such as merge sort, coin change, Huffman coding, and shortest‑path problems.
AlgorithmsDivide and ConquerDynamic Programming
0 likes · 7 min read


ITPUBMay 2, 2017 · Fundamentals
This guide presents concise explanations of essential algorithms—including quick sort, merge sort, bucket and radix sorts, depth‑first and breadth‑first searches, shortest‑path and minimum‑spanning‑tree methods—along with their stability, time‑complexity analyses, greedy strategies, bit‑manipulation tricks, and asymptotic notation, and points to a GitHub repository for reference implementations.
AlgorithmsComplexityGraph
0 likes · 10 min read


ITPUBApr 24, 2017 · Fundamentals
This article provides a concise reference of core algorithms—including sorting methods, graph traversals, shortest‑path techniques, greedy strategies, bit‑level manipulations, and asymptotic notation—detailing their stability, time complexities, key concepts, and practical examples for interview preparation.
AlgorithmsComplexityGraph Algorithms
0 likes · 8 min read

The article revisits fundamental algorithmic strategies—including divide‑and‑conquer, dynamic programming, greedy methods, backtracking, and branch‑and‑bound—detailing their core ideas, applicable problem characteristics, key considerations, procedural steps, and illustrative examples such as merge sort, coin change, Huffman coding, minimum spanning trees, and shortest‑path problems.
AlgorithmsDivide and ConquerDynamic Programming
0 likes · 7 min read
