Tag: #algorithms
Writing on GPUs, LLMs, MLOps, Kubernetes — and mindset · 7 posts
Big-O in Practice: Complexity Without the Math Anxiety
What O() actually means, the common complexity classes with real-world examples, when constants win because n is small or the cache matters, the O(n squared) that hides in nested loops and N+1 queries, space complexity,
2026-06-22 · 11 min read #algorithms#performance#fundamentalsCompression Algorithms Deep Dive — LZ77, Huffman, Arithmetic, ANS, Zstandard, Brotli (2025)
Compression powers HTTP responses, file storage, databases, and backup systems, yet most developers treat it as a black box. This guide dissects lossless compression from first principles: Shannon entropy, the LZ77/LZSS/
2026-04-15 · 24 min read #compression#lz77#zstd#brotli#huffmanData Structures Complete Guide 2025: Array to Trie, B-Tree — Every Structure for Interviews
Every data structure for interviews with visualization and code! Array, LinkedList, Stack/Queue, HashMap, BST, AVL, Heap, Trie, Graph, Union-Find, B-Tree, Skip List, Bloom Filter — Big-O comparison table and practical us
2026-03-23 · 24 min read #data-structures#algorithms#array#linked-list#treeFAANG Coding Interview Mastery: Trees & Graphs Core Patterns
Master the essential tree and graph patterns for FAANG coding interviews — Binary Tree DFS/BFS, BST, Union Find, Dijkstra, and more — with complete Python implementations and complexity analysis.
2026-03-17 · 17 min read #faang#codinginterview#trees#graphs#bfsFAANG Coding Interview Mastery: Arrays & Strings Core Patterns
Master the 6 essential array and string patterns for FAANG coding interviews — Two Pointers, Sliding Window, Binary Search, Prefix Sum, and more — with complete Python implementations and complexity analysis.
2026-03-17 · 17 min read #faang#codinginterview#arrays#strings#leetcodeFAANG Coding Interview Mastery: Dynamic Programming Patterns
A comprehensive guide to dynamic programming patterns commonly tested in FAANG coding interviews. Covers 1D DP, 2D DP, Interval DP, and Tree DP with full Python implementations and complexity analysis.
2026-03-17 · 14 min read #faang#codinginterview#dynamicprogramming#dp#leetcodeAlgorithms & Data Structures: From Complexity Analysis to AI/ML Algorithms
A complete guide to algorithms for AI engineers and coding interview preparation — covering Big-O complexity analysis, graph algorithms, dynamic programming, k-d trees, LSH, and more.
2026-03-17 · 16 min read #algorithms#data-structures#dynamic-programming#graph-algorithms#coding-interview