This article examines the evolution of Ant Design's color‑palette generation algorithms from the simple tint/shade approach in 1.x, through the HSL‑based Bézier‑easing method in 2.x, to the HSV‑driven implementation in 3.x, highlighting their principles, code implementations, strengths, and shortcomings.
This article explains the concept of load balancing in distributed systems, outlines its benefits for throughput and reliability, compares common architectural layers, evaluates key algorithmic considerations, and provides Python implementations of round‑robin, weighted, random, hash‑based, and least‑connection strategies along with deployment options.
The Metric Logic Tree automates business metric anomaly analysis by integrating heterogeneous data sources (Kylin, MySQL, Elasticsearch, Druid) with a three‑layer architecture—metric calculation, algorithmic analysis (waterfall and Gini‑coefficient methods), and a master‑worker computation service—that parallelizes queries, delivers immediate conclusions, and shortens decision cycles, as demonstrated in Meituan‑Dianping’s hotel‑travel operations.
This article explains what user profiling is, why it’s crucial for recommendation systems, outlines key dimensions such as personal attributes, status, and interests, describes algorithms like classification and autoregressive models, and details offline and real‑time computation methods, evaluation techniques, and practical examples.
This article explains how to extend a red‑black tree with a subtree‑size counter to support O(log n) rank and selection operations, detailing the required count updates during insertion, deletion, and tree rotations, and provides complete pseudocode for left/right rotations, rank queries, and element‑by‑rank retrieval.
This article explains the core challenges of search engines, the origins and mechanics of the PageRank algorithm, its handling of dead ends and spider traps, extensions like Topic‑Sensitive PageRank, and the various link‑spam attacks and countermeasures such as Spam Farms and TrustRank.
This article introduces decision trees in data analysis and machine learning, explains core concepts, compares popular algorithms such as ID3, C4.5, and CART, details their mathematical foundations, and provides a complete Python implementation with code examples for building and visualizing trees.
A third‑grader’s bulb‑toggling puzzle is solved by showing that a bulb stays on only when its number is a perfect square, leading to 14 lit bulbs out of 200, and a simple Ruby program is used to demonstrate the result.
This article explains how to implement the classic Snake game using the MVC pattern, detailing the model's grid representation, chain‑list versus array for the snake body, random food placement algorithms, view rendering optimizations with PIXI, and control APIs for game interaction.
This article explores how to implement recursive and non‑recursive DOM tree searches, hash‑based lookups, and several classic sorting algorithms—including quick sort and merge sort—in JavaScript, discussing their time and space complexities, stability considerations, and practical performance tips for front‑end development.
The article explains the background of flash‑memory wear‑leveling, reviews common garbage‑collection strategies, compares classic algorithms such as Greedy, Cost‑Benefit, CAT and CICL, and introduces the Non‑Balance method that evaluates real block endurance to extend SSD life up to three times.
This article explains how to protect API servers from abuse by implementing rate limiting using the Token Bucket algorithm, discusses its drawbacks, and provides practical Java and Redis-based solutions with code examples and performance considerations.
This article compiles ten common algorithmic challenges frequently asked in front‑end interviews, explains why mastering data structures matters for developers, and provides concise solutions and key insights for each problem, from palindrome checks to binary search tree implementation in JavaScript.
This article explains the meaning of Big O notation—O(n), O(1) and O(log n)—using intuitive box-and‑card analogies, shows how Redis command complexities are expressed, and highlights why constant‑time operations are the most efficient for large data sets.
This article explains how to use a Python implementation of the minimax algorithm to analyze a Doudizhu end‑game scenario, detailing the core logic, recursive hand simulation, caching optimizations, and the final result that the farmer side has no guaranteed winning strategy.
This article explains the definition and 4V characteristics of big data and presents practical algorithms—including hash partitioning, min‑heap top‑K selection, bitmap extensions, and Bloom filter techniques—to efficiently handle ultra‑large log files, integer sets, and keyword searches within strict memory limits.
The seventh issue of Baidu Waimai's technical monthly presents a collection of practical engineering articles covering operations monitoring, big‑data platform incubation, BFT crawling algorithm, zombie‑process avoidance, Nginx+Lua overload protection, OLTP/OLAP integration, new‑user repurchase prediction, a generic frontend tracking solution, and the use of favicons to personalize websites.
This article explores Nginx’s built‑in and extended load‑balancing algorithms—including weighted round‑robin, IP‑hash, fair, generic‑hash and consistent‑hash—by dissecting source code, explaining implementation details, and presenting comprehensive performance tests that compare their balance, consistency, and fault‑tolerance across varied scenarios.
This article explains the concept of a stack as a LIFO data structure, shows how to implement a Stack class in JavaScript with essential methods like push, pop, size, empty, peek, and clear, and demonstrates practical usage through recursive and iterative factorial calculations.
This article explains how Hulu’s advertising platform leverages big‑data pipelines, time‑series forecasting, bipartite‑graph optimization, linear‑model targeting, and real‑time allocation to improve sales, delivery, reporting, and planning of guaranteed‑delivery brand ads.
By adapting the classic Two Generals problem into a Three-Armies scenario, this article demystifies the Basic Paxos algorithm, illustrating its prepare/commit phases, proposal handling, and consensus challenges with detailed step-by-step examples and insights into its practical implications for distributed systems.
The article explains that Paxos relies on a fixed set of voters (the majority) for consistency, shows why configuration‑driven member changes break the protocol, and introduces a simple dynamic membership algorithm that uses delayed activation windows to achieve atomic member updates without violating Paxos guarantees.
This article provides a vivid explanation of the Paxos algorithm, illustrating how it achieves reliable consensus among unreliable processors through a two‑phase prepare/promise and propose/accept process, using distributed auction analogies, message sequencing, and read/write operations to ensure consistency in distributed systems.
This article explains the Multi-Paxos algorithm, showing how independent Paxos instances can be combined into a globally ordered sequence, how the Prepare phase can be omitted in certain cases, and why a leader emerges naturally to maximize efficiency.
The article explores the author's experiments combining artificial intelligence with typography, detailing the development of algorithms that measure font attributes, compute similarity scores, and generate rule‑based design systems, while reflecting on the challenges, inspirations, and future possibilities of AI‑driven font selection and design.
This article explains load balancing fundamentals, differentiates layer‑4 and layer‑7 balancing, describes hardware and software solutions, local and global deployment, various algorithms and health‑check methods, and discusses performance, scalability, security, and management considerations for modern network operations.
The article outlines how to boost system performance through algorithmic refinements, hardware and software resource upgrades, interaction optimizations between algorithms and resources, and effective caching techniques, while acknowledging trade‑offs and the need for balanced decisions.
This presentation details how Ctrip's hotel R&D team leverages machine learning and big data to address OTA-specific challenges, improve key service KPIs, evaluate project benefits, and deploy models through a robust pipeline and architecture, offering practical case studies and operational insights.
This article uses the classic stable matching (Gale‑Shapley) algorithm to model romantic courtship, illustrating how men‑proposing and women‑proposing versions lead to different stable pairings and highlighting the advantage of the proactive side in achieving preferred matches.
This article explains why interest‑driven feeds are essential, reviews Facebook's NewsFeed evolution and EdgeRank algorithm, details Pinterest's Smart Feed architecture and Pinnability model, and provides a comprehensive guide to building, ranking, and monitoring generic interest‑feed systems for social platforms.
This article shares a detailed iOS interview journey—including Baidu, NetEase, and Alibaba rounds—along with algorithm questions, Objective‑C runtime insights, practical coding challenges, and actionable preparation strategies to help developers land their dream mobile development jobs.
This article introduces the concept and history of recommendation algorithms, outlines the basic conditions for recommendations, and provides a detailed explanation of user-based collaborative filtering, including similarity calculations, neighbor selection, recommendation scoring, practical code snippets, and discussion of potential issues.
This article explains the fundamental principles of Google's PageRank algorithm, modeling web pages as a directed graph and a random surfer, discusses matrix formulation, convergence issues like dangling nodes and traps, and demonstrates a practical MapReduce implementation with Python code for large‑scale rank computation.
This article explains how Google’s PageRank algorithm uses the web’s link structure, Markov processes, and stochastic matrix adjustments—including damping factor α—to overcome ranking challenges and provide a mathematically sound method for ordering search results.
This article presents two Oracle SQL challenges from the 3rd ITPUB "Shengtou Media Cup" Tic‑Tac‑Toe contest, detailing how to generate every possible terminal game sequence for insertion into a table and how to compute forced win strategies for any given board using pure SQL techniques.
This article presents the full specifications and solution approaches for a two‑part Oracle SQL challenge that requires inserting every possible terminal Tic‑Tac‑Toe game state into a table and writing a query to determine forced wins from any valid board configuration.
Presented are two Oracle‑SQL challenges from the 3rd ITPUB “Shengtou Media Cup” Tic‑Tac‑Toe contest: (1) generate every possible terminal move sequence and board state, inserting them into a TICTACTOE table without PL/SQL in WITH clauses, and (2) given any valid board, compute the forced winner and the minimal remaining moves using recursive SQL and minimax logic.
The ITPUB SQL Database Programming Contest invites participants to solve two Oracle‑SQL puzzles—generating every possible tic‑tac‑toe end‑game board with moves and determining forced win strategies—following detailed rules, evaluation criteria, and prize information.
The article describes how Airbnb built and continuously improved a machine‑learning‑driven dynamic pricing tool—Aerosolve—that extracts property features, compares similar listings, incorporates seasonal and event‑driven demand, and automatically updates nightly price suggestions to help hosts set optimal rates.
This article explains how to generate red packets, calculate random amounts, and handle user grabbing and opening actions while ensuring high‑concurrency safety using atomic CAS operations in a cache to prevent oversubscription.
This article reviews map‑matching challenges, surveys algorithm categories, describes the ST‑Matching method and its implementation details, and presents experimental results using a large road network and GPS data to achieve high‑accuracy trajectory alignment.
This article describes a project that enhances an open‑source card‑number scanning solution to recognize 19‑digit Chinese debit cards, addressing challenges such as black‑printed fonts, light‑colored embossed fonts, background filtering, single‑character OCR, and Luhn‑based checksum verification.
This article explains Suning's implementation of a Naive Bayes‑based product classification system, detailing its basic theory, formal definition, step‑by‑step training process, three implementation phases, evaluation results, and error analysis to improve classification accuracy.
This article explains why whiteboard coding remains an effective interview tool, outlines the five common question types, describes how to design suitable coding problems, and provides detailed guidance for both interviewers and candidates on preparing, executing, and evaluating whiteboard coding sessions, complete with code examples and best‑practice tips.
The article explains the branch and bound algorithm, comparing it with backtracking, describing its search strategies, general procedure, and key differences such as search order, node handling, and optimal solution finding, while providing a basic overview and illustrative diagram.
This article explains the backtracking algorithm as an enumeration‑like depth‑first search technique, outlines its fundamental concepts, basic ideas, typical problem‑solving steps, and provides both non‑recursive and recursive pseudo‑code frameworks for implementation.
The article outlines how search engines combine the Tao of underlying principles—crawling, binary‑based Boolean indexing, PageRank matrix calculations, and TF‑IDF weighting—with specific Shu implementations to efficiently retrieve, rank, and present relevant web pages using Boolean logic, link analysis, and term relevance metrics.
This article explains the classic 0/1 knapsack problem, presents a detailed dynamic programming approach with step‑by‑step table construction, demonstrates the method using a concrete example, and discusses its computational complexity.
