Topic
Functions
Learn Functions as a connected topic across chapters, concepts, simulations, and interview reasoning.
10 Concepts7 Articles2h 5m
Overview
Learn Functions as a connected topic across chapters, concepts, simulations, and interview reasoning.
How this topic helps
Algorithms
Data Structures
System Design
Bloom Filter
Learning Path in this Topic
Series that contain articles from Functions. Select a path to filter the article list.
Articles
7 matched articles
Article 1Functions in Python: Parameters, Return Values, and ScopeTLDR: Python functions are first-class objects, not just reusable blocks. They support keyword arguments, safe defaults with None, variadic *args/**kwargs, closures, and LEGB scope resolution. These f22 minArticle 2Decorators Explained: From Functions to Frameworks📖 The Copy-Paste Crisis: When Timing Code Invades Twenty Functions
Sofia is three months into her first Python backend role. The team runs a performance review and discovers the data-processing API i24 minArticle 3Count-Min Sketch Explained: Frequency Estimation at Streaming ScaleTLDR: Count-Min Sketch (CMS) is a fixed-size d × w counter matrix that estimates how often any element has appeared in a stream. Insert: hash the element with each of the d hash functions to get one c22 minArticle 4Bloom Filters Explained: Membership Testing with Zero False NegativesTLDR: A Bloom filter is a bit array of m bits + k independent hash functions that sets k bits on insert and checks those same k bits on lookup. If any checked bit is 0, the element is definitely not i19 minArticle 5Serverless Architecture Pattern: Event-Driven Scale with Operational GuardrailsTLDR: Serverless is strongest for spiky asynchronous workloads when cold-start, observability, and state boundaries are intentionally designed.
TLDR: Serverless works best for spiky, event-driven wo13 minArticle 6What are Hash Tables? Basics ExplainedTLDR: A hash table gives you near-O(1) lookups, inserts, and deletes by using a hash function to map keys to array indices. The tradeoff: collisions (when two keys hash to the same slot) must be handl12 minPage 1 of 2