1 views collected around this technical thread.
This article introduces the binary search tree (BST) data structure, explains its core concepts, provides Python implementations for node definition, search, insert, and delete operations, compares performance, and discusses practical applications and exercises.
This guide reviews common backend interview topics, explaining TCP TIME_WAIT behavior, multi‑port listening, full page load steps, Redis data types, Kafka consumer sizing and at‑most‑once semantics, the CAP theorem, Singleton usage, C++ std::map complexity, and an O(n) doubly‑linked list reversal algorithm.
The article presents the Homemade Machine Learning GitHub repository, which offers from‑scratch Python implementations of popular supervised and unsupervised algorithms, complete with mathematical explanations, code samples, and interactive Jupyter Notebook demonstrations, along with setup instructions and dataset links.
This article compiles essential interview questions covering TCP connection termination, multi‑port listening, page load workflow, Redis data structures, Kafka consumer sizing and at‑most‑once semantics, the CAP theorem, Singleton usage, C++ map complexity, and a doubly linked list reversal algorithm, providing concise explanations and code examples.
This article presents a curated list of eleven high‑quality GitHub repositories, ranging from algorithm collections and comprehensive Python libraries to project‑based learning resources, each described with its purpose, popularity metrics, and direct links, to help programmers at any skill level advance their Python expertise.
This article introduces the GitHub repository “Homemade Machine Learning,” which provides pure‑Python implementations of popular supervised and unsupervised algorithms—including linear and logistic regression, K‑means clustering, anomaly detection, and multilayer perceptrons—accompanied by mathematical explanations, code samples, and interactive Jupyter Notebook demonstrations.
This article provides an extensive overview of core technical interview subjects—including operating‑system signals, process synchronization and data transfer methods, TLS encryption steps, common caching pitfalls and remedies, Java collection implementations, heap‑building algorithms, and various CPU scheduling strategies—offering concise explanations and practical code examples for each concept.
This article presents a curated collection of thirty practical Python mini‑tasks, each accompanied by concise explanations and ready‑to‑run code snippets that illustrate common operations such as duplicate detection, anagram checking, memory usage, dictionary merging, and more, helping beginners quickly master useful programming techniques.
This article shares the ByteDance Java backend internship first‑round interview experience, detailing the company's massive hiring drive, interview structure, and deep technical questions covering URL parsing, DNS resolution, TCP handshake, TLS, HTTP request handling, and related networking concepts.
This article provides a detailed introduction to common sorting algorithms—including bubble, selection, insertion, shell, merge, quick, heap, counting, bucket, and radix sorts—explaining their principles, time complexities, stability, and offering complete Python implementations with step-by-step explanations and visual demonstrations.
This article explores powerful PHP data structures and algorithms—including binary search, hash tables, linked lists, stacks, queues, and binary trees—demonstrating their implementations, performance optimization strategies, and the modern Laravel Collections approach to efficiently handle large-scale data in web development.
This article presents a detailed guide to classic sorting, searching, and encryption algorithms, explains their principles and use cases, and provides Python implementation links and visualizations, offering a valuable resource for learners seeking to master fundamental algorithmic techniques.
This article provides a step‑by‑step guide to learning Python data structures, covering basic concepts, built‑in types, hands‑on practice, advanced structures, algorithm relationships, resources, community engagement, and continuous self‑challenge to improve problem‑solving skills.
This article shares personal reflections on a recent interview and provides detailed Python solutions for three classic coding challenges—a list index extraction using hash maps, a tree traversal reconstruction based on parent IDs, and a dynamic‑programming approach to the minimum path sum problem, along with code snippets.
The article shares a personal Ctrip referral story, recent campus‑recruitment salary figures, and a comprehensive interview guide covering C++ vs Java differences, memory layout, OS concepts, networking fundamentals, database indexing, and a classic min‑stack algorithm problem.
The article examines how, as Moore's Law ends, performance gains will increasingly rely on software optimization, algorithmic advances, and hardware architecture innovations, illustrated by matrix multiplication benchmarks and discussions of Dennard scaling, parallelism, and emerging technologies.
This article presents thirty concise Python code snippets covering common tasks such as duplicate detection, list chunking, dictionary merging, string manipulation, timing, and functional tricks, offering quick, practical examples for beginners and developers to enhance their coding skills.
This article presents a concise collection of 40 Python one‑liners covering fundamental operations such as printing, comprehensions, file handling, string manipulation, mathematical calculations, data structure manipulations, and useful built‑in functions, each illustrated with clear code examples.
This article presents a collection of 25 frequently encountered Python programming tasks, ranging from printing "Hello, World!" to checking file existence, each accompanied by concise explanations and ready-to-use code examples that illustrate fundamental concepts and techniques.
This article presents ten practical Python recursion techniques—including base case identification, progressive convergence, tail‑recursion optimization, memoization, recursion depth management, generator usage, iterative alternatives, recursion‑tree visualization, hybrid approaches, and divide‑and‑conquer implementations—each illustrated with clear code examples to improve performance and avoid stack overflow.