This article explains PHP's array_values() function, demonstrating how it returns a new array with reindexed numeric keys for both indexed and associative arrays, and highlights that the returned array is a copy, not a reference, with practical code examples.
This tutorial explains Python dictionaries in depth, covering their definition, how to create, access, modify, add, delete, copy, traverse, and nest dictionary entries, with clear code examples for each operation to help beginners master this essential data structure.
This article presents a curated collection of high‑impact C utility code examples—including a circular buffer, assertion macro, bit‑reversal function, fixed‑point arithmetic, endianness conversion, bit masks, timer handling, binary search, and a simple bitset—explaining their purpose and showing ready‑to‑use implementations for embedded systems.
This article provides a comprehensive analysis of Java's ConcurrentHashMap, covering its underlying data structures, key attributes, core components such as Node, ForwardingNode, TreeBin, and TreeNode, and detailed explanations of the put, get, hash, and resizing algorithms with annotated source code examples.
This article introduces core Python concepts—including dictionaries and sets as key‑value and unique collections, file and directory manipulation with the os module, regular expression handling, logging setup, unit testing with unittest, performance profiling via cProfile, and using popular third‑party libraries such as requests and BeautifulSoup.
This article classifies sorting algorithms into internal, external, comparison, and non‑comparison types, discusses stability and time‑complexity, and provides clear Python implementations with examples for Bubble Sort, Selection Sort, Insertion Sort, Shell Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, Bucket Sort, and Radix Sort.
This article explains the internal structures of Redis data types—including strings, lists, sets, hashes, and sorted sets—detailing their memory representations, evolution across versions, time‑complexity characteristics, and the code implementations that enable efficient in‑memory operations.
This article explains Python's set type, covering its typical use cases, core API methods, and a deep dive into the CPython C implementation—including the PySetObject layout, hash table mechanics, field behavior, and differences from dictionaries.
This article explains the concept of deep copy in Python, demonstrating how it recursively copies all nested objects using the copy module's deepcopy function, with practical examples including basic data types, lists, dictionaries, and custom objects.
This article explains Python's set type, covering its definition, creation (including empty sets), key properties such as unordered uniqueness, conversion using set(), the eight basic and four augmented set operators, common set methods, and practical applications like data deduplication.
This article introduces the Redis in‑memory database, highlights the new "Redis Mastery" book that blends theory with practical examples, and explains core concepts such as SDS string structures, RDB/AOF persistence, master‑slave replication, and Sentinel high‑availability mechanisms.
The article chronicles the time wheel algorithm from its 1997 origins, explains simple, round‑based, and hierarchical wheel designs, compares them to queue timers, details Dubbo’s HashedWheelTimer implementation, and shows how combining the wheel with a delay‑message queue can dramatically improve service scalability and efficiency.
This guide explains how Python’s built‑in zip() and dict() functions can be combined to pair elements from two separate lists and create a dictionary, covering function basics, step‑by‑step examples, practical use cases such as user credentials and student scores, and a concise summary of the technique.
This article dissects the CPython implementation of three dictionary methods—get, setdefault, and popitem—showing example usage, walking through the C source code, explaining hash look‑ups, entry handling, and the subtle state changes that occur when keys are missing or removed.
This article explains Java's EnumMap, covering its definition, key characteristics, how to create and use it with code examples, its efficient array‑based implementation, and practical test cases, demonstrating why EnumMap is a high‑performance map for enum keys in backend development.
This article explains how to design a flexible TreeNode interface and a TreeUtil class in Java that convert flat collections into hierarchical tree structures, provides multiple static methods for object and JSON tree generation, and discusses optimization techniques for large data sets.
This article dissects CPython's dictionary implementation, explaining how a PyDictObject and its PyDictKeysObject are allocated, how method groups map to Python magic methods, and the detailed C logic for inserting, updating, and retrieving key‑value pairs, including __missing__ handling.
This article explains Java's HashMap implementation, covering its bucket array, linked‑list and red‑black tree handling, hash function perturbation, dynamic resizing, and thread‑safety considerations, providing code examples and diagrams for clear understanding.
This article provides a comprehensive overview of Java's ConcurrentHashMap, explaining its purpose, underlying lock‑segmentation and CAS mechanisms in JDK 7 and JDK 8, demonstrating usage with sample code, and outlining scenarios where it delivers high‑performance thread‑safe map operations.
This article dissects Python's dictionary implementation, explaining the PyDictObject layout, the combined and split hash‑table designs, memory‑optimisation techniques, insertion and lookup processes, ordered iteration, and precise memory‑size calculations with concrete code examples.
This article explains the importance of caching, compares common replacement policies, and walks through a complete Go implementation of a thread‑safe local LRU cache, including interface design, data structures, linked‑list management, and concurrency handling.
This guide explains the difference between Python's shallow and deep copy mechanisms, shows the built‑in tools available, and provides ten concrete code examples covering lists, dictionaries, custom objects, tuples, sets and multi‑level nesting to help you choose the right copying strategy for reliable API test automation.
The article explains how Python's dict uses a hash table to provide constant‑time insertion, deletion, and lookup, demonstrates its speed advantage over lists with benchmarks, and details the handling of collisions, resizing, and the underlying array‑based implementation.
This article explains Python tuples as immutable list subsets, details their C‑level struct layout, creation and deallocation processes, the internal freelist cache for lengths up to 20, performance advantages over lists, and the special handling of the empty tuple singleton.
This article walks through the CPython source code that defines list’s built‑in methods—append, insert, pop, index, count, remove, reverse, clear, and copy—explaining how each method is wired into the type object, the underlying C logic, time‑complexity characteristics, and common pitfalls such as reference‑count handling and shallow versus deep copying.
Redis, an open-source in-memory NoSQL database, is explored in depth covering its high-performance features, typical use cases, evolution, architecture, data types and commands, followed by an overview of Tencent Cloud Redis services and a brief advertisement for a DevOps certification program.
Redis is a high‑performance, in‑memory NoSQL key‑value store offering persistence, rich data types, advanced structures, and robust commands, supporting caching, session storage, pub/sub, and leaderboards, while evolving through replication, Sentinel, clustering, and multithreaded proxies, with Tencent Cloud providing scalable, highly available managed Redis services.
This guide explains the differences between Python's list.sort method and the sorted function, covering their syntax, parameters, performance nuances, and practical examples such as ascending/descending order, custom key functions, and creating sorted copies without altering the original list.
This guide walks backend developers through twenty real‑world Redis use cases—from basic caching, lotteries, and like/collect features to ranking, PV/UV counting, Bloom filters, sign‑in, geo‑search, rate limiting, ID generation, distributed locks, messaging, session sharing, and more—providing Spring Boot code samples, limitations, and best‑practice advice.
This tutorial provides a thorough overview of Python dictionaries, covering their creation, key‑value access, addition, update, deletion, iteration, comprehensions, safe retrieval with get(), merging, sorting, built‑in functions, and unpacking for function arguments, all illustrated with clear code examples.
The article presents a suite of interview‑style algorithm and system‑design solutions—including Bloom‑filter URL blacklists, hash‑partitioned word frequencies, missing‑number bit arrays, top‑K min‑heap, low‑memory median, short‑URL encoding, Redis user counting, and extensive Java implementations of sorting, singleton, LRU cache, custom thread pools, producer‑consumer models and various FooBar synchronization techniques.
This article delves into Rust’s Vec type, explaining its internal structure—including pointer, length, and capacity—detailing essential methods such as push, pop, len, capacity, and iter, and provides practical code examples that illustrate creation, manipulation, iteration, and performance considerations.
Explore Rust arrays in depth—from declaration syntax and element access to iteration, mutable updates, built‑in methods, multidimensional structures, and a practical fixed‑size stack implementation—highlighting their performance‑focused design and safety guarantees for system programming.
This article explores why Redis delivers ultra‑high performance by examining its in‑memory design, single‑threaded event loop, efficient data structures such as hash tables, SDS strings, ziplist, quicklist, and skiplist, as well as its encoding strategies and I/O multiplexing model.
This article traces the evolution of tree‑based index structures—from simple binary search trees through AVL and red‑black trees to B‑trees and B+‑trees—explaining their strengths and limitations and why MySQL adopts B+‑trees to minimize disk I/O and boost query performance.
This article explains Go's container/ring package, detailing its Ring type, core methods, performance characteristics, practical code examples, and typical use cases such as schedulers and resource pools for efficient circular data handling.
This article provides an in‑depth exploration of Go’s container/list package, detailing its internal linked‑list structures, core methods, performance characteristics, practical code examples, and ideal use‑cases for scenarios requiring frequent insertions and deletions.
This article explains Redis's memory model—including memory statistics, allocation, internal data structures, object types, and encoding—while showing practical examples for estimating usage, optimizing consumption, and troubleshooting fragmentation in high‑concurrency environments.
Java's Arrays.asList method has three major pitfalls: it cannot directly convert primitive arrays like int[] because of autoboxing limits, it returns a fixed-size list that throws UnsupportedOperationException on modification, and the list shares its backing array so changes to the original array are reflected in the list; using Arrays.stream for boxing or wrapping the result in a new ArrayList avoids these issues.
MySQL, born in the 1990s as a free open‑source database, became a core component of the LAMP stack and remains widely used; the article explains why indexes are needed, compares binary trees, B‑trees and B+‑trees, and describes how modern cloud‑based MySQL services improve performance and reliability.
This guide compiles essential Python built‑in functions, data‑structure utilities, and ready‑to‑use algorithmic templates—including dynamic programming, backtracking with caching, binary search, bit manipulation, union‑find, topological sort, monotonic stack, sliding window, prefix sums, two‑pointer and graph traversals—to accelerate LeetCode problem solving.
This article introduces Go's groundbreaking generics feature introduced in version 1.18, explains its syntax and type constraints, demonstrates practical implementations such as generic functions, data structures, and methods with full code examples, and evaluates the benefits, challenges, and future prospects of using generics in Go.
This article introduces the concept, characteristics, and core operations of singly linked lists, then provides a complete Go implementation with node definitions, insertion at head and tail, deletion, traversal, and a test program to demonstrate usage.
This article introduces a curated collection of Python algorithm implementations, covering basic sorting and searching techniques, as well as advanced methods like quickselect and tabu search, as well as cryptographic algorithms such as Caesar, Vigenère, and RSA, with explanations, visualizations, and links to the GitHub repository for further study.
This article summarizes a Didi second‑round interview covering Redis persistence mechanisms, data structures, memory overflow and leak concepts, thread safety, process vs thread differences, deadlock prevention, TCP/UDP distinctions, and a couple of hand‑written algorithm problems, providing detailed explanations and code examples.
This article compiles a comprehensive set of Python algorithm templates—including syntax shortcuts, knapsack solutions, backtracking, union‑find, topological sorting, monotonic stacks, binary search, dynamic programming, prefix sums, two‑pointer techniques, tree traversals, and graph algorithms—providing clear code snippets and explanations to help developers ace LeetCode interview problems.
This article provides a thorough overview of essential Python concepts, covering numeric operations, string manipulation, function definitions, data structures, class and object usage, as well as useful built‑in tools and utilities, illustrated with clear code examples for each topic.
This article explores sixteen practical Redis patterns—including caching, distributed sessions, locks, global IDs, counters, rate limiting, bitmaps, shopping carts, timelines, message queues, lotteries, likes, tags, filtering, follow relationships, and ranking—demonstrating how each can boost performance and simplify backend architecture.
This article provides a comprehensive overview of B‑tree, B+‑tree, B*‑tree and R‑tree data structures, explaining their definitions, node layouts, height analysis, insertion and deletion algorithms with examples, and their roles in external‑memory indexing for databases and file systems.
Redis is widely known as a high‑performance cache, but its rich data structures, persistence options, and distributed features enable it to serve as a primary storage engine for many internet services, from user profiles and leaderboards to rate limiting, messaging, and geo‑location, while presenting scalability and reliability challenges.
This article explains how Python's mutable list and dictionary types and immutable tuple type can be employed to organize test data, build request payloads, and parse JSON responses when automating API tests, providing clear code examples for each use case.
This article explains the LeetCode LRU Cache problem, detailing the required class interface, operational constraints, and provides a thorough Java solution using a HashMap combined with a doubly linked list to achieve O(1) time complexity for get and put operations.
An extensive Python tutorial covering numeric operations, string handling, built‑in functions, data structures, class and object concepts, as well as useful tools such as iterators, file I/O, serialization, and common utilities, illustrated with clear code examples.
This tutorial explains how to combine Redis and PHP to store and query data efficiently, covering strings, hashes, lists, sets, and sorted sets with clear code examples for each data structure.
This article presents practical Python performance optimization techniques, covering fundamental principles such as avoiding premature optimization, weighing trade‑offs, eliminating global variables, reducing attribute access, minimizing unnecessary abstractions, avoiding data copies, leveraging efficient loops, using short‑circuit logic, applying numba JIT, and selecting appropriate data structures to significantly speed up code execution.
This article explains the concept of shallow copy in Python, contrasts it with deep copy, outlines ten practical scenarios such as parameter passing, data backup, error recovery, and parallel processing, and provides a comprehensive code example demonstrating how to use the list .copy() method in each case.
This article presents nine powerful C utility code examples—including a circular buffer, custom assertions, bit reversal, fixed‑point arithmetic, endianness conversion, bit masks, timer handling, binary search, and a simple bitset—explaining their purpose and demonstrating how they can improve performance and maintainability in embedded system development.
This article explains the concept of hashing and hash tables, describes their characteristics and common collision‑resolution strategies such as open addressing, linear and quadratic probing, chaining, and rehashing, and provides complete Python implementations including a simple hash class, a dynamic map class, and a custom dictionary.
This article explains the concept of AVL self‑balancing binary search trees, outlines their height‑balancing property, and provides step‑by‑step Java code examples defining a Node class implementing Comparable and an AVLTree class with height, balance factor calculations, and rotation methods for insertion and deletion.
This article explains practical Python memory‑saving methods—including inspecting memory usage, using __slots__, generators, memory‑mapped files, choosing efficient data structures, and string interning—providing code examples and performance comparisons to help developers write more memory‑efficient programs.
This article presents a comprehensive collection of 60 frequently used Python built-in functions and techniques, covering numeric operations, string handling, data structures, function definitions, class utilities, and useful tools, each illustrated with clear code examples and explanations for practical programming.
This comprehensive guide walks through Redis's core data structures—including strings, lists, sets, sorted sets, hashes, HyperLogLog, bitmaps, streams, and geospatial indexes—explaining their characteristics and providing concrete command‑line examples to help developers select and use the right structure for their applications.
This article explains why slow SQL queries occur, how MySQL indexes dramatically improve query speed, and details the underlying data structures—binary tree, hash, B‑Tree, B+Tree—as well as storage engine differences and composite index rules for optimal performance.
This article explores the classic implementation of red‑black trees, comparing them with AVL trees, detailing their 2‑3‑4 tree correspondence, and walking through Java TreeMap insertion and deletion algorithms, including node definitions, rotation cases, and rebalancing procedures, while analyzing their time complexities.
This guide explores ten practical Redis scenarios—including login authentication, counters, fan following, leaderboards, anti‑scraping, message queues, browser history, distributed locks, user sign‑in tracking, and website UV statistics—showcasing commands and patterns to boost performance in real‑world applications.
This article explains the design, implementation, and usage of the Queue and Simple Queue modules in the Go-based WorkQueue project, covering their underlying data structures, interfaces, callback mechanisms, and practical code examples for both unique and duplicate data handling.
This article explains the fundamentals of B‑Tree and B+Tree data structures, their search algorithms, and how MySQL's MyISAM and InnoDB storage engines implement these indexes to achieve efficient disk‑based query performance.
The article first presents a detailed analysis of Tencent's 2024 campus recruitment salary packages for various programmer offers, then introduces a classic algorithmic challenge of reversing a linked list in groups of k nodes, providing step‑by‑step explanation and a complete Java implementation.
This article walks through a real‑world sales‑ranking scenario, explains why a simple SQL solution falls short at scale, and demonstrates how Redis Set and ZSet data structures provide high‑performance, real‑time ranking, including detailed command examples, performance metrics, and an in‑depth look at ZSet's internal listpack and skiplist‑dict implementations.
This article introduces essential Python built‑in functions such as map, filter, reduce, sorted, any, all, zip, enumerate, reversed, chr, max, min, sum, join, list, tuple, set, frozenset, type and dir, explaining their purpose and providing concise example code for each.
This article introduces binary trees, explains their Java representation, demonstrates pre-order, in-order, post-order, and level-order traversals, and provides implementations for creating full binary trees, counting nodes, computing height, and counting leaf nodes, complete with sample code and usage examples.
This article presents a comprehensive overview of Python's 68 built-in functions up to version 3.6.2, categorizing them into twelve groups such as numeric operations, data structures, scope, iterators, I/O, memory, file handling, modules, and more, with clear code examples.
This tutorial explains PHP arrays, covering their basic concepts, how to create indexed and associative arrays, access elements, add and remove items, traverse using loops, and sort arrays, with clear code examples for each operation.
This article walks you through the fundamentals of hash tables, explains bucket arrays and hash functions, discusses collision resolution strategies, and provides a complete Java implementation of a simple HashMap called ThirdHashMap with code, tests, and performance notes.
This article explains the recent correction in Alibaba's developer manual that replaces the ambiguous "expansion count" of HashMap with the precise "resize count", details the conditions under which HashMap triggers resize during the first put operation, and shows why storing 1024 elements in JDK 1.8 results in eight resize calls.
This article explains the differences between B‑trees and B+‑trees, covering row vs. column storage, index construction, binary search trees, and how B+‑trees provide faster insert, delete, and range queries in modern database systems.
This article shares a comprehensive embedded software interview guide, covering written‑test topics such as structs vs. unions, linked lists, pointer safety, endianness detection, and a strcpy implementation, followed by technical interview tips, HR interview advice, and concluding remarks.
This article presents thirty concise Python exercises covering common tasks such as duplicate detection, anagram checking, memory usage, list manipulation, dictionary merging, and more, each illustrated with clear code examples to help beginners practice and deepen their programming skills.
This article introduces several essential PHP array functions—including array_push, array_pop, array_shift, array_unshift, and array_reverse—explaining their usage, parameters, and effects with clear code examples to help developers manipulate arrays efficiently.
This article explains how to use a bitmap to store 6 billion URLs within 1 GB of memory and introduces Bloom filters as a space‑efficient probabilistic structure for deduplication, providing memory calculations, usage scenarios, and Java code examples.
This article provides a comprehensive overview of the C++ Standard Template Library, detailing the differences between vectors and lists, memory management, iterator validity, container operations, and implementations of various containers such as deque, set, map, and slist, along with code examples.
This article explains Redis’s five core data object types—strings, lists, hashes, sets, and sorted sets—detailing their encoding schemes, underlying memory structures such as SDS, ziplist, linkedlist, hashtable, and skiplist, and how Redis optimizes storage and access performance.
This article provides a comprehensive technical walkthrough of Redis, covering its core concepts, data structures, performance tricks, caching pitfalls, persistence options, high‑availability architectures, distributed locking mechanisms, and consistency strategies, all illustrated with concrete examples and code snippets.
This article introduces Redis as a high‑performance in‑memory NoSQL database, explains its rich data structures, core design that makes it fast, key advantages, common use cases such as caching and messaging, and provides step‑by‑step installation and basic command examples.
This article introduces Redis as an open‑source, high‑performance in‑memory key‑value store, explains its rich data structures, underlying implementations, performance advantages, common use cases such as caching and messaging, and provides step‑by‑step installation and basic command examples for Ubuntu systems.
The team analyzed Lucene’s disk‑based inverted index and built a custom in‑memory inverted‑index service for Himalaya’s ad engine, encoding terms as 64‑bit keys, supporting real‑time updates and BooleanQuery‑style and custom expression filtering, which cut query latency from ~50 ms to under 5 ms and enabled massive scaling.
Redis is a high-performance, open-source in-memory key-value database offering rich data structures, persistence options, and advanced features like replication, clustering, and pub/sub, making it ideal for caching, counters, message queues, leaderboards, and session storage in demanding, high-concurrency applications.
This article explains key database terminology, traces the history of database technologies, compares relational, NoSQL, NewSQL, OLTP/OLAP, columnar, time‑series and graph databases, and demonstrates practical data‑structure designs such as zipper tables, bit operations, bitmaps, bloom filters, and ring queues for software development.
This article explains why Python lists are essential, how to create them (empty, with integers, strings, mixed types, or nested lists), outlines their key characteristics such as order and mutability, and demonstrates common operations—including indexing, slicing, adding, removing, modifying, and retrieving element indices—through clear code examples.
This article presents three interview‑style algorithm problems—a golden treasure‑box search, an inequality‑set validator with maximum‑difference calculation, and a smallest‑number‑after‑removing‑digits task—each with clear problem statements, constraints, step‑by‑step simulation logic, and full Python code implementations.
This article presents seventeen practical Python techniques—including list manipulation, dictionary handling, string operations, and control‑flow shortcuts—that showcase the language's elegance and help developers write cleaner, more efficient code in everyday projects.
This article presents a curated list of twenty practical Python tricks—including string reversal, title casing, unique element extraction, list multiplication, dictionary merging, timing code execution, and more—each explained with concise descriptions and ready‑to‑run code examples to help developers write cleaner and more efficient Python code.
This article presents a curated collection of practical Python tricks—from handling multiple user inputs and using all/any for condition checks, to swapping variables, detecting palindromes, removing duplicates, finding the most frequent list item, leveraging list comprehensions, *args, enumerate, string joining, dictionary merging, sorting, pretty‑printing, and comparing list‑reversal methods—each illustrated with clear code examples.
The article explains how to store and de‑duplicate 4 billion unsigned integers using a bitmap to reduce memory from 14.9 GB to under 500 MB, introduces the concept and benefits of bitmaps, describes Bloom filters, their principles, advantages, limitations, typical use cases, and provides Java and Redis implementation examples.
This article reviews a C++ interview covering object‑oriented programming basics, STL container behaviors, networking protocols, inter‑process communication mechanisms, memory layout, and common interview questions, providing concise explanations and code examples for each topic.
This article explains how to install and configure Redis, connect to it using Python's redis library, and demonstrates storing and retrieving various data structures—including strings, hashes, lists, sets, and sorted sets—followed by proper disconnection, providing a practical guide for Python developers.
Explore the design and mechanics of Bloom filters, understand their role in preventing cache penetration, learn how to calculate optimal parameters, and see practical Java implementations using Google Guava and Redisson, including code snippets, performance considerations, and strategies for handling deletions.
This article presents a thorough overview of Python algorithm fundamentals, covering sorting, searching, cryptographic techniques, and neural‑network examples, while linking to the open‑source TheAlgorithms/Python repository that provides both theoretical explanations and ready‑to‑run code samples for learners.
To reduce costly database I/O, the article explains how Bloom filters, Counting Bloom filters, and Cuckoo filters work, detailing their bitmap/hash mechanisms, false‑positive behavior, deletion limitations, and practical enhancements such as multi‑hash functions and bucket‑level fingerprints.
This article explains how Bloom filters, their counting variant, and Cuckoo filters work to reduce unnecessary database I/O by using bitmap or fingerprint techniques, discusses their false‑positive and deletion limitations, and presents practical optimizations for high‑performance hash‑based filtering.
