Joined Tencent (nicknamed "Goose Factory") through campus recruitment at a second‑tier university. Career path: Tencent → foreign firm → ByteDance → Tencent. Started as an interviewer at the foreign firm and hopes to help others.
This article explains the "account conflict" problem caused by massive concurrent transactions, proposes splitting read/write operations and using lazy or timed data integration to improve performance and consistency, and discusses how to ensure atomicity and isolation with transactions or distributed locks.
Through a playful narrative featuring SpongeBob and a rival boss, this article explains the high‑frequency front‑end interview topic of the Observer pattern, illustrates its core concepts, shows one‑to‑many relationships, and provides a complete JavaScript implementation with clear code examples.
The article outlines why many interview candidates fall short, categorizes three typical applicant types, and explains the key reasons interviewers decide to advance a candidate—strong communication, solid fundamentals like networking and databases, algorithm proficiency, and genuine learning attitude.
This article humorously dissects the baffling corporate and tech buzzwords that flood everyday conversations, explaining terms like "赋能", "抓手", "闭环", and offering a practical glossary for programmers to understand and navigate the opaque language of modern workplaces.
This article explores TCP’s connection termination process, detailing the classic four‑way handshake, scenarios that reduce it to three or two handshakes, the concept of self‑connections, simultaneous opens, and practical implications for developers, including code examples and troubleshooting tips.
This article explains the concept of consensus in blockchain, compares private, consortium and public environments, and introduces key algorithms such as Paxos, Raft, PBFT, Proof‑of‑Work and Proof‑of‑Stake, highlighting their challenges and solutions.
This article explains the purpose of the TCP RST flag, how the kernel and application layers detect it, the various scenarios that trigger RST, why an RST may not terminate a connection, and the security implications of RST attacks.
This article explains the TopK problem, compares sorting‑based O(nk) approaches with heap‑based O(n + k log n) and quick‑select O(n) methods, and provides complete Java implementations for each technique, helping readers ace interview questions on finding the largest K elements.
This article explains the fundamentals of Log‑Structured Merge (LSM) Trees, covering their write‑ahead log, memtable, SSTable architecture, compaction processes, read/write optimizations, and popular open‑source implementations such as LevelDB, RocksDB, and GoLevelDB.
This article explores the essence of computing by tracing how basic circuits, binary encoding, and layered abstractions from hardware to software enable modern digital devices, illustrating concepts with bicycle analogies, circuit diagrams, and historical insights into binary's development.
