Attic
DSA

Overview

Comprehensive guides to data structures, algorithmic complexity, tree architectures, and problem-solving patterns

Welcome to the Data Structures & Algorithms (DSA) section. This reference provides production-grade explanations, space/time complexity analyses, visual ASCII and Mermaid architectures, and canonical Java implementations for technical assessments and system design.

DSA Knowledge Map

Link

Linked Lists

Singly/doubly linked nodes, Floyd's cycle detection, two pointers, in-place reversal, and LRU cache unlinking

FolderTree

Trees

Binary trees, DFS/BFS traversals, BST validation & 3-case deletion, AVL rotations, and canonical problem patterns

LayoutGrid

Collections Framework

Java Collection implementations, ArrayList resizing, HashMap treeification, and performance tradeoffs

Sparkles

Exam Prep & DSA Snippets

12 core problem archetypes, Two Sum, Monotonic Stack, Top-K, and return-type trap drills

Specialized Types & Autoboxing

Memory-optimized EnumSet, EnumMap, BitSet bit-vectors, and avoiding primitive autoboxing overhead

Overview

Dynamic linear memory chains, singly vs doubly vs circular representations, node layouts, and array trade-offs

On this page

DSA Knowledge MapFeatured Topics