DSA Solution
β
Note Preview
04_dsa_solutions/leetcode_solutions
π Open Note
TOC
Sidebar
Graph
Focus
Tools
Top
Table of Contents
β
Exit Focus Mode
Platform & Reading Settings
β
Theme & Appearance
COLOR THEME
βοΈ Light
π Dark
READING TINT
Default
π Paper
π Warm
Reading & View Controls
π
Distraction-Free Focus
Toggle
πΊοΈ
Obsidian Global Graph
Graph
π
Platform Specs & Audit
Report
π§Ή
Reset Local Storage & Cache
Reset
π Platform Audit & Verification Report
β
360
Indexed Notes
5.0s
Build Time
100%
SPA Compliant
60 FPS
PixiJS Graph
Active Platform Features
β
Multi-Track Fast Dev
: Staging 2+ tracks in parallel with sub-5s full builds.
β
Obsidian Graph Engine
: Emerald (DSA), Indigo (Architecture), Amber (Languages), Pink (Cloud).
β
Directed Arrows
: GPU-accelerated triangular vectors indicating knowledge dependencies.
β
Lazy-Loaded Graph
: Zero initial memory/CDN overhead, hydrating strictly on viewport intersection.
β
Mobile TOC Drawer
: Touch-friendly bottom sheet highlighting active section headings.
β
Distraction-Free Focus
: Maximize reading canvas with 1-click floating exit trigger.
β
Resilient Storage
: Defensive JSON parsing preventing crashes across hard reload (Ctrl+Shift+R).
GraphMind
Dark mode
Light mode
Explorer
competitive-programming
Search
Search
11 items with this tag.
Oct 27, 2026
01. π² Centroid Decomposition: Tree Path Queries & Divide & Conquer on Trees
dsa
centroid-decomposition
trees
divide-and-conquer
tree-path-queries
competitive-programming
advanced-dsa
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Heavy-Light Decomposition (HLD) for Tree Path Queries
dsa
graph-theory
heavy-light-decomposition
hld
segment-tree
lca
tree-path-queries
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Minimum Cost Maximum Flow (MCMF) - Successive Shortest Path
dsa
graph-theory
network-flow
min-cost-max-flow
mcmf
successive-shortest-path
spfa
dijkstra
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Network Flow - Dinic's & Edmonds-Karp Maximum Flow
dsa
graph-theory
network-flow
max-flow
dinic-algorithm
edmonds-karp
min-cut
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Tree Dynamic Programming & Rerooting Technique
dsa
dynamic-programming
tree-dp
rerooting
graph-algorithms
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Digit Dynamic Programming for Number Range Constraints
dsa
dynamic-programming
digit-dp
number-theory
range-queries
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Divide & Conquer Dynamic Programming Optimization
dsa
dynamic-programming
divide-and-conquer
dp-optimization
quadrangle-inequality
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Dynamic Programming with State Machine & Bitmask
dsa
dynamic-programming
state-machine
bitmask
bit-manipulation
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Monotonic Stack, Monotonic Queue & Sliding Window Deque
dsa
monotonic-stack
monotonic-queue
sliding-window
deque
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Trie & Aho-Corasick Multi-Pattern String Matching
dsa
trie
aho-corasick
string-matching
automaton
bfs
failure-links
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Advanced Graph Algorithms (Tarjan's, Kosaraju's, Bridges & Cut-Vertices)
dsa
graph-algorithms
tarjan
kosaraju
scc
bridges
cut-vertices
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note