Discover a curated list of 35 practical Python tricks—from unpacking and slicing to generators, dictionary comprehensions, and advanced data structures—each illustrated with clear code examples to help developers write more concise and efficient code.
This article provides a comprehensive technical comparison between Redis and Memcached, covering server‑side operations, memory efficiency, performance characteristics, supported data types, memory management mechanisms, persistence options, and clustering architectures, illustrated with diagrams and concrete command examples.
This comprehensive guide explains fundamental data structures—including linked lists, stacks, queues, various tree types, binary indexed trees, segment trees, heaps, hash tables, and graphs—detailing their definitions, variants, typical operations, and time‑complexity characteristics for efficient algorithm design.
This article reviews common sorting algorithms—including bubble, selection, insertion, quick, heap, shell, merge, counting, bucket, and radix sorts—explaining their principles, time and space complexities, typical use cases, and providing complete Java implementations with illustrative examples and diagrams to help readers master them for interviews and practical development.
From a careless college student to a seasoned developer, the author chronicles a seven‑year odyssey of learning data structures and algorithms, sharing book recommendations, personal projects, internship experiences, and hard‑won insights on why solid algorithmic foundations are essential for modern software engineering.
This article explores two fundamental implementations of the HashMap data structure, comparing traditional Hash Tables with Hash Array Mapped Tries (HAMT), while analyzing their collision resolution strategies, hash functions, time and space complexities, and practical applications in modern programming languages like Ruby and functional paradigms.
This article introduces Redis's five core data structures—String, List, Set, Hash, and Sorted Set—detailing their characteristics, common commands, additional operations, and typical use cases, providing a comprehensive guide for developers working with Redis.
Redis is an open-source, in‑memory data structure store offering high‑performance caching, persistence, replication, and rich data types such as strings, lists, sets, hashes, and sorted sets, and this guide compares its strengths and differences with Memcached and other databases.
This article examines the MySQL‑Memcached architecture, explains Memcached’s slab memory management, compares Redis and Memcached across performance, memory efficiency, persistence and data structures, details Redis’s core data types and their internal implementations, and showcases practical use‑cases such as caching, ranking, queues, Pub/Sub and real‑time analytics.
This article explains Go's slice data structure, how slices are represented in memory, common pitfalls with value passing, slicing, expanding, and provides practical examples of functions like copy, append, and differences between make and new for slices.
This article explains binary search trees, their limitations, and introduces red‑black trees as a balanced BST alternative, detailing their properties, node definitions, rotation mechanisms, and step‑by‑step insertion and deletion algorithms with Java code examples and visual illustrations.
This comprehensive Redis guide explains the in‑memory key‑value store’s installation, basic commands, configuration options, supported data structures, persistence mechanisms, replication, transactions, pub/sub, performance testing, connection handling, pipelining, and partitioning, providing practical examples for developers.
This article explains Redis’s ziplist (compressed list) memory layout, detailing its overall encoding, node structure—including previous length, encoding, and content fields—illustrates how various Redis data types employ ziplist encoding, and analyzes the benefits and trade‑offs of using this structure.
This article compares Redis and Memcached across data‑type support, memory‑usage efficiency, performance, memory‑management mechanisms, persistence options, and clustering capabilities, highlighting the strengths and trade‑offs of each in‑memory data store.
This article explains Java’s HashMap internals, compares JDK 1.7 and 1.8 implementations, details the bucket array, linked‑list‑to‑red‑black‑tree conversion, resizing logic, performance gains of up to 100 % in 1.8, and warns against using HashMap in concurrent contexts.
The article argues that, despite the hype around ever‑changing programming languages, mastering core algorithms and computer science theory remains essential for building efficient, scalable solutions across fields—from search engines and parallel computing to scientific research—because algorithms are the enduring foundation of technology.
This article explains how to select appropriate hash functions for different key types, compares Thomas Wang's integer mix function with MurmurHash for strings, and details rehash strategies, load factor thresholds, and value storage structures in hash tables.
This article explains the concept of heaps, especially min‑heaps, and demonstrates how PHP's SPL provides ready‑made implementations for stacks, queues, min‑heaps, and fixed‑size arrays with clear code examples.
This article introduces eight fundamental internal sorting algorithms—Insertion, Shell, Selection, Bubble, Merge, Quick, Heap, and Radix—explaining their principles, step‑by‑step procedures, time and space complexities, and stability characteristics to help readers choose the right method for different data sets.
The article recounts the author's seven‑year path learning data structures and algorithms, from neglect in college to self‑study, book recommendations, internships at Microsoft and Baidu, projects such as a T‑SQL parser and a pinyin index, and reflections on the importance of algorithms.
This article chronicles the author's seven‑year evolution from a disinterested student to a seasoned developer, detailing study plans, key algorithm and data‑structure books, internship experiences, custom parsers, performance‑critical mobile features, and the indispensable role of algorithms for serious programmers.
This article explains three ways to add priority handling to Redis queues—using a single list with head insertion, employing separate high‑ and normal‑priority lists with BRPOP, and leveraging score keys with sorting—detailing their advantages, drawbacks, and practical Redis command examples.
This article explains how mastering data structures and algorithm analysis provides a problem‑solving mindset, covering fundamental concepts, Dijkstra’s shortest‑path algorithm, topological sorting for dependency resolution, and Huffman coding for data compression, illustrating their broad impact on software development.
This article compiles practical advice on learning algorithms, recommending beginner‑friendly books, video courses, coding exercises, and optimization tricks while explaining why certain resources like Sedgewick's Algorithms and Princeton's Coursera lectures can be more approachable than the traditional "Introduction to Algorithms".
The author chronicles a seven‑year evolution from a clueless undergraduate to a seasoned programmer, detailing the books, courses, internships, and personal projects that shaped his understanding of data structures and algorithms, while debating the practical value of algorithmic knowledge in software development.
This article illustrates the structure of a B+ tree, explains how leaf and non‑leaf nodes store data and pointers, and walks through a concrete search for the key 29, highlighting the three disk I/O operations required to locate the value.
This article explains why iterating and removing entries from a HashMap throws ConcurrentModificationException, describes the internal iterator mechanism, and provides correct solutions using an Iterator or replacing HashMap with ConcurrentHashMap, including detailed explanations of ConcurrentHashMap's structure and its get, put, remove, size, and iteration implementations.
This article introduces three advanced data structures—Unrolled List, Bloom Filter, and Skip List—explaining their design motivations, memory and performance trade‑offs, and providing C++ code snippets to illustrate their core implementations.
This article explains why immutable collections improve safety and performance, how to create them with Guava's copyOf, of, and Builder methods, and introduces Guava's extended collection types such as Multiset, Multimap, BiMap, Table, ClassToInstanceMap, RangeSet, and RangeMap with usage examples.
This article reviews the five core Redis data structures—String, Hash, List, Set, and Sorted Set—detailing practical use‑cases such as caching, user profile storage, timelines, message queues, social graphs, and weighted rankings, plus a look at Pub/Sub and transaction features.
