Tagged articles
11 articles
Page 1 of 1
IT Services Circle
IT Services Circle
Sep 10, 2025 · Fundamentals

How to Solve LeetCode 757: Minimum Set Intersection of Size Two with a Greedy Approach

The article first discusses common interview pitfalls before presenting a detailed greedy solution for LeetCode problem 757—finding the smallest set that intersects each interval in at least two points—complete with problem description, algorithmic reasoning, complexity analysis, and implementations in Java, C++, Python, and TypeScript.

LeetCode 757PythonTypeScript
0 likes · 11 min read
How to Solve LeetCode 757: Minimum Set Intersection of Size Two with a Greedy Approach
IT Services Circle
IT Services Circle
Mar 25, 2024 · Fundamentals

Greedy Interval Algorithm for Memory Allocation

The article explains a greedy interval‑based memory allocation problem, describes how to detect overlapping intervals, locate the smallest suitable free block within a 100‑byte heap, and provides a complete Python implementation that reads intervals, checks validity, and outputs the optimal allocation address.

algorithmic problemgreedy algorithminterval scheduling
0 likes · 6 min read
Greedy Interval Algorithm for Memory Allocation
FunTester
FunTester
Dec 1, 2020 · Fundamentals

How Pairwise, Greedy, and Fuzzy Logic Can Slash Your Test Suite Size

This article explains practical techniques—pairwise testing, clustering aggregation, greedy algorithms, and fuzzy‑logic‑based reduction—to dramatically cut the number of test cases while preserving coverage and improving testing efficiency.

Software Testingfuzzy logicgreedy algorithm
0 likes · 5 min read
How Pairwise, Greedy, and Fuzzy Logic Can Slash Your Test Suite Size
AI Code to Success
AI Code to Success
Jan 8, 2020 · Fundamentals

Mastering Greedy Algorithms: Concepts, Framework, and Classic Problems

This article explains the core idea of greedy algorithms, outlines their basic workflow, identifies problem types where they apply, presents a generic greedy framework, demonstrates a fractional knapsack implementation in C++, and lists several classic greedy problems with brief solutions.

activity selectionalgorithm examplesalgorithm fundamentals
0 likes · 9 min read
Mastering Greedy Algorithms: Concepts, Framework, and Classic Problems
DataFunTalk
DataFunTalk
Jul 3, 2019 · Artificial Intelligence

Improving Recommendation Diversity with Determinantal Point Processes and Greedy Optimization

The article explains how recommendation systems balance exploitation and exploration, introduces diversity metrics such as temporal, spatial, and coverage, and presents a determinantal point process (DPP) based algorithm accelerated by Cholesky decomposition and greedy inference, demonstrating significant speedups and improved relevance‑diversity trade‑offs in experiments.

DiversityRecommendation Systemscholesky decomposition
0 likes · 10 min read
Improving Recommendation Diversity with Determinantal Point Processes and Greedy Optimization
Qunar Tech Salon
Qunar Tech Salon
May 16, 2016 · Artificial Intelligence

Improving A/B Testing with a 20‑Line Multi‑Armed Bandit Algorithm

This article explains how a simple 20‑line multi‑armed bandit implementation can replace traditional A/B testing by continuously balancing exploration and exploitation to automatically discover the most effective UI variant, reducing manual analysis and improving conversion rates.

A/B testingExploitationexploration
0 likes · 8 min read
Improving A/B Testing with a 20‑Line Multi‑Armed Bandit Algorithm
Qunar Tech Salon
Qunar Tech Salon
Apr 4, 2015 · Fundamentals

Greedy Algorithm: Concepts, Basic Approach, Applicability, and Example Analysis

This article explains the fundamental concepts of greedy algorithms, outlines their basic design steps, discusses the conditions under which they yield optimal solutions, presents an implementation framework, and analyzes a knapsack problem example that illustrates common greedy strategies and their limitations.

algorithm analysisgreedy algorithmknapsack problem
0 likes · 6 min read
Greedy Algorithm: Concepts, Basic Approach, Applicability, and Example Analysis