Skip to content
Tagged articles

Algorithm

500 articles · Page 5 of 5
NiuNiu MaTe
NiuNiu MaTe
Oct 27, 2021 · Fundamentals

Master the House Robber Problem with Dynamic Programming

This article explains the classic House Robber interview question, detailing the problem constraints, illustrating why a naive alternating‑house approach fails, and presenting a clear dynamic‑programming solution with recurrence, base cases, and a concise code example.

AlgorithmDPDynamic Programming
0 likes · 5 min read
Master the House Robber Problem with Dynamic Programming
TikTok Frontend Technology Team
TikTok Frontend Technology Team
Oct 22, 2021 · Fundamentals

Understanding DAG Basics and the Dagre Layout Algorithm with Perfect-Process

This article introduces the fundamentals of directed acyclic graphs (DAGs), explains adjacency representations, details the Dagre layout algorithm’s concepts, computation steps, and constraints, and presents the Perfect‑Process front‑end library that implements these techniques for interactive pipeline diagram rendering and editing.

AlgorithmDAGfrontend
0 likes · 13 min read
Understanding DAG Basics and the Dagre Layout Algorithm with Perfect-Process
ITFLY8 Architecture Home
ITFLY8 Architecture Home
Oct 20, 2021 · Backend Development

Why Rate Limiting Matters: Strategies, Algorithms, and Real-World Implementations

Rate limiting protects services from overload by controlling traffic, using techniques such as circuit breaking, degradation, buffering, privilege handling, and algorithms like counters, leaky bucket, and token bucket, with implementations ranging from Guava in Java to Nginx+Lua for distributed systems.

Algorithmrate limitingtraffic control
0 likes · 14 min read
Why Rate Limiting Matters: Strategies, Algorithms, and Real-World Implementations
21CTO
21CTO
Oct 17, 2021 · Fundamentals

Mastering Interview Math: Implement a Custom Square Root Function Without Libraries

This article explores how to solve a common interview coding challenge—implementing a square‑root function without using library calls—by discussing problem analysis, linear and binary‑search approaches, optimization techniques, testing strategies, and the broader skills interviewers aim to assess.

AlgorithmInterviewbinary search
0 likes · 15 min read
Mastering Interview Math: Implement a Custom Square Root Function Without Libraries
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Oct 12, 2021 · Backend Development

Backend Interview Questions and Answers: HTTP, HTTPS, TCP, Virtual Memory, Eureka, Hystrix, Zookeeper, and Longest Substring Algorithm

This article compiles a series of backend interview questions covering HTTP header fields, HTTPS handshake, TCP connection states, virtual and physical memory concepts, TCP connection limits, Eureka architecture and consistency, Hystrix fault‑tolerance mechanisms, Zookeeper's Zab protocol and leader election, and provides a Java solution for finding the longest substring without repeating characters.

AlgorithmEurekaHTTPS
0 likes · 19 min read
Backend Interview Questions and Answers: HTTP, HTTPS, TCP, Virtual Memory, Eureka, Hystrix, Zookeeper, and Longest Substring Algorithm
NiuNiu MaTe
NiuNiu MaTe
Oct 12, 2021 · Fundamentals

How Many Peaches Did the Monkeys Start With? A Math & Code Puzzle

This article presents a classic monkey‑and‑peach puzzle, derives the minimal initial peach count using mathematical reasoning, and then demonstrates a brute‑force Python program that searches for the solution, illustrating how loops and modular checks solve the problem.

AlgorithmMath PuzzlePython
0 likes · 7 min read
How Many Peaches Did the Monkeys Start With? A Math & Code Puzzle
MaGe Linux Operations
MaGe Linux Operations
Oct 4, 2021 · Artificial Intelligence

Build a Simple AI‑Powered Tetris Game with Python

This tutorial shows how to create a Tetris mini‑game with AI using a straightforward algorithm, Python 3.6, PyQt5, and detailed code that evaluates board states based on cleared lines, holes, heights, and other metrics to select optimal moves.

AIAlgorithmPyQt5
0 likes · 5 min read
Build a Simple AI‑Powered Tetris Game with Python
Architecture Digest
Architecture Digest
Sep 27, 2021 · Backend Development

Understanding Rate Limiting: Concepts, Algorithms, and Implementations

This article explains why rate limiting is needed in both physical venues and online systems, describes common limiting strategies such as circuit breaking, service degradation, delayed processing, and privileged handling, and details three major algorithms—counter, leaky bucket, and token bucket—along with practical Java and Nginx‑Lua code examples.

AlgorithmConcurrencyDistributed Systems
0 likes · 13 min read
Understanding Rate Limiting: Concepts, Algorithms, and Implementations
NiuNiu MaTe
NiuNiu MaTe
Sep 15, 2021 · Fundamentals

How to Maximize Mooncake Profit: Brute Force, Greedy, and DP Solutions

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
How to Maximize Mooncake Profit: Brute Force, Greedy, and DP Solutions
Selected Java Interview Questions
Selected Java Interview Questions
Sep 13, 2021 · Fundamentals

Understanding Merge Sort and Merging Two Sorted Arrays in C#

This article explains the merge sort algorithm’s divide‑and‑conquer principle, analyzes its O(n log n) time complexity, and provides two complete C# code examples—one for a generic merge sort and another for merging two already sorted arrays—along with visual illustrations of the merging process.

AlgorithmC++Divide and Conquer
0 likes · 6 min read
Understanding Merge Sort and Merging Two Sorted Arrays in C#
Hulu Beijing
Hulu Beijing
Sep 7, 2021 · Fundamentals

Hulu 2022 Campus Recruitment: 5 Algorithmic Challenges with Solutions

This article presents five programming problems from Hulu's 2022 campus recruitment—including particle simulation, Sophie‑N number counting, optimal activity point on a tree, devil‑maze navigation, and non‑intersecting triangles—complete with problem statements, input/output specifications, sample cases, and detailed solution approaches.

AlgorithmDynamic ProgrammingGraph
0 likes · 18 min read
Hulu 2022 Campus Recruitment: 5 Algorithmic Challenges with Solutions
Top Architect
Top Architect
Sep 1, 2021 · Backend Development

Rate Limiting Strategies, Algorithms, and Implementations in Backend Systems

This article explains the concepts, strategies, and algorithms of rate limiting—including circuit breaking, service degradation, leaky‑bucket and token‑bucket methods—and provides practical Java, Guava, and Nginx + Lua implementations for controlling concurrency and protecting backend services.

AlgorithmBackendDistributed Systems
0 likes · 13 min read
Rate Limiting Strategies, Algorithms, and Implementations in Backend Systems
php Courses
php Courses
Aug 27, 2021 · Backend Development

Implementing Redis-Based Rate Limiting in PHP

This article presents a PHP implementation of Redis-based rate limiting, explaining how to limit the number of requests per time interval by using timestamp-modulo keys, atomic increment operations, and key expiration, along with detailed code and step-by-step commentary.

AlgorithmRedisrate limiting
0 likes · 3 min read
Implementing Redis-Based Rate Limiting in PHP
Alimama Tech
Alimama Tech
Aug 25, 2021 · Artificial Intelligence

Calibration Techniques for User Response Prediction in Online Advertising

Alibaba Mama’s talk explains how calibrated probability models—evolving from simple Platt scaling to Bayesian isotonic regression and real‑time wave‑adjusted variants—improve click‑through and conversion predictions, enabling more accurate bidding, stable auctions, and fairer ad allocation despite data drift and sparsity.

AlgorithmCalibrationOnline Advertising
0 likes · 20 min read
Calibration Techniques for User Response Prediction in Online Advertising
JavaEdge
JavaEdge
Aug 17, 2021 · Fundamentals

Detecting Cycles in a Linked List with Fast and Slow Pointers (Java)

This article explains how to determine whether a singly linked list contains a cycle using the fast‑slow pointer technique, derives the mathematical reasoning for locating the cycle entry point, and provides a complete Java implementation that returns the node where the cycle begins or null if none.

AlgorithmLinked Listcycle detection
0 likes · 4 min read
Detecting Cycles in a Linked List with Fast and Slow Pointers (Java)
IT Architects Alliance
IT Architects Alliance
Aug 9, 2021 · Backend Development

Mastering Rate Limiting: Algorithms, Strategies, and Practical Guava & Nginx Implementations

This article explains why rate limiting is essential for system stability, compares it with caching and degradation, details three core algorithms—counter, leaky bucket, and token bucket—and provides concrete Guava, Java, and Nginx + Lua code examples for implementing both local and distributed throttling.

AlgorithmBackendDistributed Systems
0 likes · 14 min read
Mastering Rate Limiting: Algorithms, Strategies, and Practical Guava & Nginx Implementations
Liangxu Linux
Liangxu Linux
Jul 27, 2021 · Fundamentals

Finding the Poison Bottle with Minimum Rabbits: Binary Encoding Explained

This article explores how to identify a single poisonous bottle among 1,000 using the fewest rabbits and the shortest time by analyzing pure‑time, pure‑space, balanced strategies, and finally applying binary encoding to solve the classic interview puzzle in just one day.

AlgorithmInterviewOptimization
0 likes · 5 min read
Finding the Poison Bottle with Minimum Rabbits: Binary Encoding Explained
NiuNiu MaTe
NiuNiu MaTe
Jul 27, 2021 · Fundamentals

Three Clever Ways to Solve the Circular Gas Station Problem

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
Three Clever Ways to Solve the Circular Gas Station Problem
Java Interview Crash Guide
Java Interview Crash Guide
Jul 24, 2021 · Backend Development

Mastering Rate Limiting in Go: Algorithms, Implementations, and Best Practices

This article explains why rate limiting is essential for high‑availability services, describes HTTP 429 standards and response headers, classifies rate‑limiting strategies by granularity, target, and algorithm, and provides detailed Go code examples using the time/rate library for fixed‑window, sliding‑window, leaky‑bucket, and token‑bucket implementations.

AlgorithmBackendGo
0 likes · 28 min read
Mastering Rate Limiting in Go: Algorithms, Implementations, and Best Practices
Beike Product & Technology
Beike Product & Technology
Jul 8, 2021 · Fundamentals

Understanding HyperLogLog: Algorithm Principles, Redis Implementation, and Experimental Analysis

This article explores the HyperLogLog algorithm for cardinality estimation, tracing its development from Linear and LogLog counting, detailing its Redis implementation with sparse and dense encodings and command workflows, and presenting experiments that demonstrate its memory efficiency and analyze observed error rates versus the theoretical 0.81% standard deviation.

AlgorithmHyperLogLogRedis
0 likes · 13 min read
Understanding HyperLogLog: Algorithm Principles, Redis Implementation, and Experimental Analysis
Selected Java Interview Questions
Selected Java Interview Questions
Jul 5, 2021 · Fundamentals

Heap Sort: Theory, Steps, and Java Implementation

This article explains heap sort's time and space complexities, introduces max‑heap and min‑heap concepts, details the algorithmic steps for building and maintaining the heap, and provides a complete Java implementation with accompanying code examples.

AlgorithmComplexityData Structures
0 likes · 8 min read
Heap Sort: Theory, Steps, and Java Implementation
NiuNiu MaTe
NiuNiu MaTe
Jun 25, 2021 · Fundamentals

How to Identify a Poisoned Bottle with Minimal Rabbits Using Binary Logic

This article explores a classic puzzle where one must locate a single poisonous bottle among 1000 using rabbits as testers, comparing time‑focused, space‑focused, and balanced strategies before revealing an optimal binary‑encoding solution that finds the poison in one day with just ten rabbits.

AlgorithmOptimizationbinary
0 likes · 5 min read
How to Identify a Poisoned Bottle with Minimal Rabbits Using Binary Logic
New Oriental Technology
New Oriental Technology
Jun 21, 2021 · Fundamentals

Understanding Recursion: Concepts, Code Examples, Visualization, and Common Pitfalls

This article explains the fundamental concept of recursion using a cinema‑seat analogy, demonstrates array‑sum and Fibonacci implementations in JavaScript, shows how to visualize recursive calls, discusses stack‑overflow and redundant computation issues, and presents iterative and memoized alternatives.

AlgorithmStack Overflowmemoization
0 likes · 10 min read
Understanding Recursion: Concepts, Code Examples, Visualization, and Common Pitfalls
ByteFE
ByteFE
Jun 15, 2021 · Frontend Development

Generating Chinese Character Stroke Order Animations from Font Files

This article details a technical approach to automatically generating stroke order animation data for Chinese characters from standard font files, covering SVG rendering, coordinate transformations, deep learning-based stroke decomposition, and CSS animation techniques.

AlgorithmFont ParsingSVG animation
0 likes · 20 min read
Generating Chinese Character Stroke Order Animations from Font Files
macrozheng
macrozheng
Jun 11, 2021 · Backend Development

How a Faster CRC-64 Boosted Redis Performance: The CRCSpeed Story

An in‑depth look at how mattsta’s CRCSpeed implementation replaced Redis’s original CRC algorithm, delivering up to four‑fold speed gains, the history of its development from 2014 to its 2020 integration, and the performance impact on RDB generation and cluster slot hashing.

AlgorithmCRCPerformance Optimization
0 likes · 14 min read
How a Faster CRC-64 Boosted Redis Performance: The CRCSpeed Story
iQIYI Technical Product Team
iQIYI Technical Product Team
Jun 4, 2021 · Artificial Intelligence

Intelligent Video Budget Pacing System for Online Video Platforms

An ecosystem‑wide intelligent promotion system applies a budget‑pacing algorithm with probabilistic throttling and fine‑ranking score adjustments in 5‑minute slots, guaranteeing uniform video exposure while minimizing impact on overall consumption, boosting daily exposure completion from under 5 % to up to 70 % and reducing watch‑time loss.

AlgorithmBudget PacingContent Distribution
0 likes · 10 min read
Intelligent Video Budget Pacing System for Online Video Platforms
Python Programming Learning Circle
Python Programming Learning Circle
May 31, 2021 · Game Development

Python Pygame Missile Auto‑Tracking Algorithm Tutorial

This article explains how to implement a missile auto‑tracking system in a 2D shooting game using Python and Pygame, covering the underlying differential‑equation‑based algorithm, step‑by‑step calculations, handling of coordinate systems, and code for rotation and rendering.

AlgorithmMissile TrackingPhysics Simulation
0 likes · 9 min read
Python Pygame Missile Auto‑Tracking Algorithm Tutorial
NiuNiu MaTe
NiuNiu MaTe
May 28, 2021 · Fundamentals

How to Win the Apple‑Picking Game: Recursive and DP Strategies Explained

This article walks through the classic “pick‑from‑both‑ends” apple game, analyzing why greedy choices fail, and presents recursive, memoized, and dynamic‑programming solutions in Go, complete with code examples and step‑by‑step explanations to help you determine the winning strategy.

AlgorithmDynamic Programminggame theory
0 likes · 8 min read
How to Win the Apple‑Picking Game: Recursive and DP Strategies Explained
vivo Internet Technology
vivo Internet Technology
May 26, 2021 · Backend Development

Dynamic Load Balancing Algorithms in the TARS Microservice Framework

The Vivo Internet Server Team extended TARS with a dynamic load‑balancing algorithm that recalculates each node’s weight every minute using metrics such as 5‑minute average response time, timeout and exception rates, CPU, memory and network load, automatically adapting traffic distribution beyond the built‑in round‑robin, weighted round‑robin and consistent‑hash methods.

AlgorithmC++Dynamic Weight
0 likes · 13 min read
Dynamic Load Balancing Algorithms in the TARS Microservice Framework
DataFunTalk
DataFunTalk
May 26, 2021 · Artificial Intelligence

Evolution, Algorithms, and Architecture of Qingteng FM's Recommendation System

This article details how Qingteng FM’s recommendation system progressed from manual curation to strategy‑based and personalized recommendations, explains the multi‑stage algorithm pipeline, describes the three‑layer deployment architecture, and outlines future challenges and opportunities in audio content recommendation.

Algorithmarchitectureaudio streaming
0 likes · 12 min read
Evolution, Algorithms, and Architecture of Qingteng FM's Recommendation System
Ops Development Stories
Ops Development Stories
May 25, 2021 · Backend Development

Master Rate Limiting: Counter, Sliding Window, Leaky & Token Bucket Algorithms

This article introduces common rate‑limiting algorithms—counter, sliding‑window, leaky bucket, and token bucket—explains their principles, compares their advantages and drawbacks, and provides Java code examples, including how Sentinel 1.8.0 implements each technique using structures such as LeapArray and WarmUpController.

AlgorithmJavaSentinel
0 likes · 17 min read
Master Rate Limiting: Counter, Sliding Window, Leaky & Token Bucket Algorithms
Programmer DD
Programmer DD
May 24, 2021 · Fundamentals

Master Red‑Black Trees: From 2‑3‑4 Trees to Practical Implementation

This article walks through the fundamentals of red‑black trees, explains their equivalence to 2‑3‑4 trees, details insertion and deletion rules, compares their performance to plain binary search trees, and shares practical debugging tips for implementing a balanced tree in code.

2-3-4 TreeAlgorithmData Structures
0 likes · 12 min read
Master Red‑Black Trees: From 2‑3‑4 Trees to Practical Implementation
Intelligent Backend & Architecture
Intelligent Backend & Architecture
May 15, 2021 · Fundamentals

Mastering Algorithms: Definitions, Design Principles, and Complexity

This article introduces the core concepts of algorithms, covering their definition, five essential properties, design principles such as correctness and readability, methods for analyzing time and space complexity, common complexity classes, and a variety of algorithmic strategies including recursion, dynamic programming, greedy and divide‑and‑conquer techniques.

AlgorithmComplexityDesign Principles
0 likes · 23 min read
Mastering Algorithms: Definitions, Design Principles, and Complexity
Full-Stack Internet Architecture
Full-Stack Internet Architecture
May 14, 2021 · Fundamentals

Comprehensive Guide to 69 High‑Frequency Algorithm Interview Questions with Solutions

This article presents a curated collection of 69 frequently asked algorithm and data‑structure interview questions, each accompanied by concise English explanations, solution ideas, and illustrative diagrams to help readers master core programming concepts and improve their interview performance.

AlgorithmData StructuresInterview
0 likes · 38 min read
Comprehensive Guide to 69 High‑Frequency Algorithm Interview Questions with Solutions
Java Backend Technology
Java Backend Technology
May 12, 2021 · Fundamentals

Master Bitwise Operations: From Basics to Classic Interview Problems

This article introduces the fundamentals of bitwise operations, explains each operator with clear rules and examples, demonstrates practical tricks such as parity checks and value swapping, and walks through classic interview problems—including addition without arithmetic, counting set bits, and finding unique numbers—complete with Java code snippets and visual illustrations.

AlgorithmInterviewbinary
0 likes · 15 min read
Master Bitwise Operations: From Basics to Classic Interview Problems
NiuNiu MaTe
NiuNiu MaTe
May 11, 2021 · Fundamentals

Can a Frog Jump Across All Platforms? Jump Game Solutions with DFS, DP, Greedy

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
Can a Frog Jump Across All Platforms? Jump Game Solutions with DFS, DP, Greedy
21CTO
21CTO
May 10, 2021 · Fundamentals

What to Expect in Google’s 7‑Round Interview: A Candidate’s Journey and Tips

The author recounts a full Google China interview experience—including resume submission, recruiter prescreen, phone and onsite coding rounds, HR and English interviews, lunch with engineers, and final feedback—while sharing practical advice and insights to help future candidates prepare effectively.

AlgorithmGoogle interviewcareer advice
0 likes · 10 min read
What to Expect in Google’s 7‑Round Interview: A Candidate’s Journey and Tips
360 Smart Cloud
360 Smart Cloud
Apr 30, 2021 · Backend Development

Understanding Rate Limiting: Concepts, Architectures, Algorithms, and a Redis‑Lua Token Bucket Implementation

This article explains what rate limiting is, why it is needed, the typical actions taken when limits are reached, compares single‑node and distributed architectures, reviews four classic limiting algorithms, and provides a practical Redis‑Lua token‑bucket implementation with code examples.

AlgorithmBackendrate limiting
0 likes · 14 min read
Understanding Rate Limiting: Concepts, Architectures, Algorithms, and a Redis‑Lua Token Bucket Implementation
Programmer DD
Programmer DD
Apr 25, 2021 · Fundamentals

How Bitmaps and Bloom Filters Supercharge Massive Data Lookups

This article explains the bitmap concept, demonstrates how to store and query billions of integers using bit-level operations, introduces BitSet for dynamic bit vectors, and describes Bloom filters as probabilistic structures for fast, memory‑efficient membership testing in large‑scale data scenarios.

AlgorithmBitmapBloom filter
0 likes · 12 min read
How Bitmaps and Bloom Filters Supercharge Massive Data Lookups
Xianyu Technology
Xianyu Technology
Apr 21, 2021 · Backend Development

Seller Posting Promotion Platform Architecture and Implementation

To boost Xianyu’s user retention, the team built a long‑term promotion platform that combines configurable operational activities with algorithmic SPU recommendations, using Kunpeng extension points, supply‑demand analysis, and conditional search to personalize seller prompts, improve click‑through, and lay groundwork for broader scenario expansion.

Algorithmdata-analysise-commerce
0 likes · 9 min read
Seller Posting Promotion Platform Architecture and Implementation
Big Data Technology & Architecture
Big Data Technology & Architecture
Apr 20, 2021 · Fundamentals

Consistent Hashing and Jump Consistent Hash: Concepts, Implementation, and Use Cases

This article explains the fundamentals of consistent hashing, compares the classic ring‑based method with the more efficient jump consistent hash algorithm, provides reference implementations in C++, discusses their time‑complexity and practical trade‑offs, and shows how they are applied in systems such as Greenplum.

AlgorithmDistributed SystemsGreenplum
0 likes · 11 min read
Consistent Hashing and Jump Consistent Hash: Concepts, Implementation, and Use Cases
DataFunTalk
DataFunTalk
Apr 4, 2021 · Fundamentals

Open the Lock Problem – BFS Solution in Java

Given a four‑wheel combination lock with digits 0‑9, the task is to find the minimum number of rotations needed to reach a target combination while avoiding a list of dead‑end states, using a breadth‑first search algorithm illustrated with Java code examples.

AlgorithmBFSGraph Search
0 likes · 7 min read
Open the Lock Problem – BFS Solution in Java
OPPO Kernel Craftsman
OPPO Kernel Craftsman
Mar 26, 2021 · Fundamentals

Optical Fingerprint Sensors: Principles, Common Issues, and Gabor Filter Preprocessing

Optical fingerprint sensors capture ridge patterns via illuminated light through an under‑display lens, offering full‑screen designs but facing challenges like incomplete presses, lighting failures, and dirty or wet fingers, while Gabor filter preprocessing enhances image texture to improve recognition robustness and guide future hardware‑algorithm improvements.

AlgorithmBiometricsGabor filter
0 likes · 8 min read
Optical Fingerprint Sensors: Principles, Common Issues, and Gabor Filter Preprocessing
Sohu Tech Products
Sohu Tech Products
Mar 17, 2021 · Big Data

Understanding Simhash: From Traditional Hash to Random Projection LSH

This article explains the principles and implementation of Simhash, covering the shortcomings of traditional hash functions, the use of cosine similarity, random projection for dimensionality reduction, locality‑sensitive hashing, and practical optimizations for large‑scale duplicate detection.

AlgorithmCosine SimilarityLocality Sensitive Hashing
0 likes · 24 min read
Understanding Simhash: From Traditional Hash to Random Projection LSH
DevOps
DevOps
Mar 16, 2021 · Big Data

Digital Transformation Six‑Map Methodology: Strategic, Business, Demand, Application, Algorithm, and Data Maps

The article presents a comprehensive six‑map framework for digital transformation—strategic, business, demand, application, algorithm, and data maps—explaining how enterprises can systematically align goals, processes, requirements, technologies, models, and data assets to achieve effective, data‑driven change.

AlgorithmData Mappingbusiness process
0 likes · 18 min read
Digital Transformation Six‑Map Methodology: Strategic, Business, Demand, Application, Algorithm, and Data Maps
Wukong Talks Architecture
Wukong Talks Architecture
Mar 11, 2021 · Fundamentals

A Plain-Language Introduction to Binary Trees

This article uses the occasion of Tree‑Planting Day to explain binary trees in simple terms, covering their definition, node types, degree, levels, five tree shapes, traversal methods (pre‑order, in‑order, post‑order, level‑order), advantages, drawbacks, and a brief comparison with binary search.

Algorithmbinary treefundamentals
0 likes · 9 min read
A Plain-Language Introduction to Binary Trees
New Oriental Technology
New Oriental Technology
Mar 1, 2021 · Frontend Development

Manhattan Routing Algorithm Implementation for Diagram Connections

This article explains the Manhattan routing algorithm used for automatic orthogonal connection routing in diagram tools, discusses its origins, references useful libraries like draw2d, and provides a full TypeScript implementation with code examples and practical application scenarios.

AlgorithmJavaScriptManhattan routing
0 likes · 8 min read
Manhattan Routing Algorithm Implementation for Diagram Connections
58 Tech
58 Tech
Feb 26, 2021 · Fundamentals

Efficient Similar‑String Search in Search Engines Using Levenshtein and Damerau‑Levenshtein Automata

This article presents a comprehensive technical guide on applying Levenshtein and Damerau‑Levenshtein automata to efficiently solve the problem of fast similar‑string lookup in search‑engine systems, introducing novel DFA construction algorithms, theoretical correctness proofs, and practical implementation details with Java code examples.

AlgorithmAutomataDamerau-Levenshtein
0 likes · 53 min read
Efficient Similar‑String Search in Search Engines Using Levenshtein and Damerau‑Levenshtein Automata
DeWu Technology
DeWu Technology
Feb 26, 2021 · Backend Development

Design and Implementation of an AB Testing Platform with Traffic Allocation Algorithms

The paper presents an AB‑testing platform that structures experiments into scenes, buckets, layers and traffic, uses a salted‑hash based allocation and a two‑step “multi‑withdraw‑fill” algorithm to adjust percentages while preserving user‑experiment stability, and describes a lightweight, cache‑centric system architecture with staggered config reloads and safeguards against database spikes and zombie nodes.

AB TestingAlgorithmexperiment platform
0 likes · 11 min read
Design and Implementation of an AB Testing Platform with Traffic Allocation Algorithms
Alibaba Cloud Developer
Alibaba Cloud Developer
Feb 24, 2021 · Artificial Intelligence

How Alibaba’s ICBU Algorithm Team Transformed E‑Commerce in 2020

This article reviews the 2020 achievements of Alibaba.com’s ICBU algorithm team, explaining the evolving role of algorithm engineers, the fundamentals of e‑commerce algorithms, the team’s three‑pillar workflow of Understanding, Growth, and Matching, and the technical breakthroughs that drove business impact and future directions.

AlgorithmAlibabaOptimization
0 likes · 28 min read
How Alibaba’s ICBU Algorithm Team Transformed E‑Commerce in 2020
360 Tech Engineering
360 Tech Engineering
Feb 23, 2021 · Artificial Intelligence

Video Stutter Detection via Frame Difference Analysis Using FFmpeg

This article explains a method for detecting video stutter by converting uploaded videos into frame sequences with ffmpeg, calculating pixel differences between consecutive frames, aggregating motion metrics, removing scene‑change effects, computing a dynamic factor, and outputting a binary result indicating the presence or absence of stutter.

AlgorithmComputer Visionframe analysis
0 likes · 5 min read
Video Stutter Detection via Frame Difference Analysis Using FFmpeg
php Courses
php Courses
Feb 23, 2021 · Backend Development

Implementing IP Rate Limiting with Redis List in PHP

This article explains how to limit the number of requests an IP can make to a specific API endpoint within a sliding time window using Redis list structures in PHP, including example scenario, implementation logic, and complete code snippets.

Algorithmip limit
0 likes · 4 min read
Implementing IP Rate Limiting with Redis List in PHP
Top Architect
Top Architect
Feb 14, 2021 · Backend Development

An Introduction to Rate Limiting: Concepts, Classifications, and Go Implementation

This article explains the fundamentals of rate limiting, its importance for high‑availability services, various classification dimensions, common algorithms such as fixed‑window, sliding‑window, leaky‑bucket and token‑bucket, and demonstrates practical usage with Go's golang.org/x/time/rate library including code examples and configuration tips.

AlgorithmDistributed Systemsgolang
0 likes · 26 min read
An Introduction to Rate Limiting: Concepts, Classifications, and Go Implementation
FunTester
FunTester
Feb 10, 2021 · Fundamentals

How to Find the Longest Consecutive 1s in a Binary String Using Java

This article explains several Java techniques—including a simple loop, String.split, and regular‑expression approaches—to compute the maximum number of consecutive '1' characters in a binary string, and even extends the method to handle mixed‑character inputs.

AlgorithmCode ExampleJava
0 likes · 6 min read
How to Find the Longest Consecutive 1s in a Binary String Using Java
21CTO
21CTO
Jan 31, 2021 · Backend Development

Mastering Load Balancing: From Random to Smooth Weighted Round‑Robin in Java

This article explains load‑balancing fundamentals, covering hardware vs. software devices, server‑side and client‑side balancing, and walks through common algorithms—random, weighted random, round‑robin, weighted and smooth weighted round‑robin, hash, consistent hash with virtual nodes, and least‑connection—each illustrated with Java code examples and diagrams.

AlgorithmDistributed Systems
0 likes · 18 min read
Mastering Load Balancing: From Random to Smooth Weighted Round‑Robin in Java
MaGe Linux Operations
MaGe Linux Operations
Jan 26, 2021 · Fundamentals

30 Quick Python Mini‑Projects to Master Core Programming Skills

This tutorial presents thirty concise Python tasks—ranging from duplicate detection and anagram checking to list chunking, dictionary merging, and execution timing—each accompanied by clear explanations and ready‑to‑run code snippets, enabling beginners to solidify fundamental concepts through hands‑on practice.

AlgorithmPythonString Processing
0 likes · 14 min read
30 Quick Python Mini‑Projects to Master Core Programming Skills
21CTO
21CTO
Jan 11, 2021 · Artificial Intelligence

How to Build a Recommendation System from Scratch: Key Concepts and Strategies

This article explains the fundamentals of recommendation systems, covering data collection, user and content profiling, system architecture, algorithmic pipelines such as recall, filtering, ranking, and evaluation metrics, while also discussing practical challenges like echo chambers and long‑term user value.

AlgorithmRankingRecommendation System
0 likes · 16 min read
How to Build a Recommendation System from Scratch: Key Concepts and Strategies
Aotu Lab
Aotu Lab
Jan 8, 2021 · Frontend Development

Front‑End Tech Highlights: Video Players, Performance Tips, AI Recommendations

From the rise and fall of Flash to modern front‑end video playback techniques, performance optimization strategies, AI recommendation fundamentals, CLI design best practices, and a glimpse into game development and algorithm analysis, this article surveys diverse cutting‑edge technologies shaping today’s software landscape.

AIAlgorithmcli
0 likes · 10 min read
Front‑End Tech Highlights: Video Players, Performance Tips, AI Recommendations
vivo Internet Technology
vivo Internet Technology
Jan 6, 2021 · Big Data

How HyperLogLog Estimates Cardinality in Massive Data Sets

This article explains the cardinality‑counting problem behind DAU/MAU and unique visitor metrics, compares naïve solutions like Set, Bitmap and Bloom filter, introduces big‑data algorithms such as Linear Counting, LogLog and HyperLogLog, and shows how Redis implements HyperLogLog with dense and sparse storage optimizations.

AlgorithmCardinalityHyperLogLog
0 likes · 17 min read
How HyperLogLog Estimates Cardinality in Massive Data Sets
New Oriental Technology
New Oriental Technology
Dec 28, 2020 · Fundamentals

Transforming Intermediate Points of a Wire During Mouse Drag: Methods and Solutions

The article analyzes how to update the positions of intermediate points on a wire when the user drags the wire with the mouse, compares three solution approaches—including point‑wise rotation and scaling, a complex geometric construction, and a unified transformation matrix—and summarizes their trade‑offs.

AlgorithmGraphicsTransformation
0 likes · 8 min read
Transforming Intermediate Points of a Wire During Mouse Drag: Methods and Solutions
DataFunTalk
DataFunTalk
Dec 26, 2020 · Product Management

Analysis of Soul’s Social Product Strategy, Community, and Growth Metrics

This article provides a comprehensive analysis of the Soul social app, examining its non‑hormonal positioning, community atmosphere, relationship‑chain metrics, content‑driven engagement, algorithmic matching, and future growth strategies, highlighting how these factors drive user retention and scale.

AlgorithmCommunity Managementgrowth metrics
0 likes · 13 min read
Analysis of Soul’s Social Product Strategy, Community, and Growth Metrics
Programmer DD
Programmer DD
Dec 13, 2020 · Backend Development

Master Sliding Window Rate Limiting in Java with Simple Code

This article introduces a straightforward Java implementation of a sliding‑window rate‑limiting algorithm for single‑machine use, explains its core logic, demonstrates its behavior with sample output, and visualizes the step‑by‑step process of how timestamps are managed within the window.

AlgorithmJavarate limiting
0 likes · 8 min read
Master Sliding Window Rate Limiting in Java with Simple Code
Wukong Talks Architecture
Wukong Talks Architecture
Dec 11, 2020 · Fundamentals

Byzantine Generals Problem Illustrated with Three Kingdoms Card Game

This article uses the popular Chinese card game Three Kingdoms to illustrate the Byzantine Generals Problem, explaining its relevance to distributed consensus, outlining four foundational theories and eight protocols, and demonstrating how voting, message tampering, and signature mechanisms affect agreement among nodes.

AlgorithmByzantine Fault ToleranceDistributed Systems
0 likes · 14 min read
Byzantine Generals Problem Illustrated with Three Kingdoms Card Game
New Oriental Technology
New Oriental Technology
Dec 7, 2020 · Fundamentals

Efficient Circuit Connection Modeling with a Circular Doubly Linked List

The article compares an adjacency‑list approach and a circular doubly linked list for representing circuit connections, showing that the linked‑list method achieves O(1) connect/disconnect operations with linear space, making it the most efficient and simple solution for graph‑based circuit modeling.

AlgorithmData Structurescircuit modeling
0 likes · 4 min read
Efficient Circuit Connection Modeling with a Circular Doubly Linked List
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Nov 23, 2020 · Fundamentals

Understanding Recursion: Concepts, Complexity Analysis, and Practical Examples

This article introduces recursion, explains its core principles, presents a general problem‑solving approach, and walks through multiple practical examples—from factorial and climbing stairs to binary tree inversion and the Tower of Hanoi—while analyzing time and space complexities and offering optimization techniques.

AlgorithmDivide and ConquerDynamic Programming
0 likes · 23 min read
Understanding Recursion: Concepts, Complexity Analysis, and Practical Examples
DataFunTalk
DataFunTalk
Nov 11, 2020 · Artificial Intelligence

Cold-Start Optimization for Feed Ads: Algorithm Design and Experimental Evaluation

In this live talk, Dr. Zhang Renyu, an assistant professor at NYU Shanghai and economist at Kuaishou, presents his research on optimizing cold-start problems in feed advertising using a novel Shadow Bidding with Learning (SBL) algorithm, detailing its design, implementation, and experimental results.

AdvertisingAlgorithmcold-start
0 likes · 4 min read
Cold-Start Optimization for Feed Ads: Algorithm Design and Experimental Evaluation
Hulu Beijing
Hulu Beijing
Nov 10, 2020 · Artificial Intelligence

Hulu’s AI Secrets: Binge Ad Prediction and Real‑Time Allocation

On November 7, 2020, Hulu’s Shulei presented how the company’s video advertising platform employs AI-driven algorithms—including binge‑watch prediction, inventory forecasting with Prophet, and a PID‑controller based real‑time allocation system—to enhance targeting, optimize revenue, and improve user experience.

AIAdvertisingAlgorithm
0 likes · 7 min read
Hulu’s AI Secrets: Binge Ad Prediction and Real‑Time Allocation
Architecture Digest
Architecture Digest
Oct 23, 2020 · Fundamentals

Understanding Consistency Algorithms: Paxos, Raft, ZAB, and Gossip

This article explains why data consistency is essential in distributed systems, defines consistency, compares strong and eventual consistency, and details the design and operation of major algorithms such as Paxos, Multi‑Paxos, Raft, ZAB, and Gossip with illustrative examples and diagrams.

AlgorithmConsistencydistributed-systems
0 likes · 11 min read
Understanding Consistency Algorithms: Paxos, Raft, ZAB, and Gossip
JD Retail Technology
JD Retail Technology
Oct 16, 2020 · Industry Insights

How JD’s PLUS Membership Used Data and Algorithms to Drive Growth

This article examines JD.com’s transition from traffic‑driven acquisition to a data‑centric, algorithm‑powered membership model, detailing the construction of a robust data foundation, multi‑level analysis methods, productized dashboards, and growth‑hacking experiments that boosted PLUS member retention and revenue.

AlgorithmGrowth Hackingaugmented analytics
0 likes · 24 min read
How JD’s PLUS Membership Used Data and Algorithms to Drive Growth
MaGe Linux Operations
MaGe Linux Operations
Oct 14, 2020 · Fundamentals

How to Remove Duplicates In-Place From a Sorted Array in Python

This article explains how to remove duplicates from a sorted array in‑place using Python, detailing the problem constraints, providing two illustrative examples, outlining a simple iteration‑based solution approach, and presenting a complete code implementation that operates with O(1) extra space.

Algorithmarrayduplicate removal
0 likes · 3 min read
How to Remove Duplicates In-Place From a Sorted Array in Python
Hulu Beijing
Hulu Beijing
Sep 11, 2020 · Fundamentals

Crack Hulu’s 2020 Campus Coding Test: 4 Algorithm Challenges Explained

This article walks you through Hulu's 2021 campus recruitment update, explains the online programming test schedule and format, shares interview tips, and provides detailed statements, sample I/O, and solution analyses for four algorithmic problems covering probability, array maxima, maze navigation, and segment‑tree optimization.

AlgorithmData StructuresDynamic Programming
0 likes · 15 min read
Crack Hulu’s 2020 Campus Coding Test: 4 Algorithm Challenges Explained
Xianyu Technology
Xianyu Technology
Sep 9, 2020 · Backend Development

Xianyu Product Attribute Completion Strategy

Xianyu’s new attribute completion system combines MetaQ messaging, AI image recognition, and offline option configuration to auto‑populate key product details, incentivize sellers, and iteratively refine attributes via sales metrics, boosting structured coverage by 30%, cutting verification time 70%, and raising UV‑CTR around three percent.

AlgorithmBackendXianyu
0 likes · 7 min read
Xianyu Product Attribute Completion Strategy