Skip to content

πŸ“ Data Structures Content Structure Overview

Location: dsa-docs/src/content/docs/data-structures/ Total Files: Extensive coverage across 18+ categories

data-structures/
β”œβ”€β”€ πŸ“„ [index.md files per category]
β”‚
β”œβ”€β”€ πŸ“‚ arrays/
β”œβ”€β”€ πŸ“‚ binary-search/
β”œβ”€β”€ πŸ“‚ bit-manipulation/
β”œβ”€β”€ πŸ“‚ dynamic-programming/
β”œβ”€β”€ πŸ“‚ fundamentals/ (Big O, complexity analysis)
β”œβ”€β”€ πŸ“‚ graphs/ (representations, traversals, Dijkstra, Bellman-Ford)
β”œβ”€β”€ πŸ“‚ greedy/ (problems, Huffman coding)
β”œβ”€β”€ πŸ“‚ hashing/ (Maps, Sets, hashing basics)
β”œβ”€β”€ πŸ“‚ interview-prep/ (study plans, pro-tips, coding patterns)
β”œβ”€β”€ πŸ“‚ linked-lists/ (patterns, operations, complexity)
β”œβ”€β”€ πŸ“‚ math/ (GCD/LCM, modular arithmetic, primes)
β”œβ”€β”€ πŸ“‚ matrix/ (problems, traversal)
β”œβ”€β”€ πŸ“‚ recursion/ (basics, backtracking, call stack)
β”œβ”€β”€ πŸ“‚ sorting/ (Bubble, Merge, Quick, Heap, etc.)
β”œβ”€β”€ πŸ“‚ stacks-and-queues/ (implementations, problems)
β”œβ”€β”€ πŸ“‚ strings/ (basics, pattern matching, two-pointer)
└── πŸ“‚ trees/ (types, traversals, BSTs, Heaps, Tries, AVL, Red-Black)
CategoryKey Topics
ArraysMethods, problems, subarrays, sliding window
Binary SearchPatterns, advanced techniques, interview questions
Bit ManipulationXOR tricks, bit masks, bit operations
Dynamic Programming1D/2D DP, string DP, patterns, knapsack, LCS, LIS
FundamentalsBig O notation, time/space complexity, algorithm analysis
GraphsBFS/DFS, Dijkstra, Bellman-Ford, Topological sort, MST
GreedyInterval scheduling, Huffman coding, activity selection
HashingHash maps/sets, collision resolution, design
Linked ListsSingly/doubly, fast & slow pointer, reversal, merge
Recursion & BacktrackingSubsets, permutations, combinations, N-Queens
SortingBubble β†’ Quick β†’ Merge β†’ Heap β†’ Radix, stability, comparisons
Stacks & QueuesMonotonic stack, queue using stacks, sliding window max
StringsPattern matching (KMP, Rabin-Karp), palindromes, anagrams
TreesBST, AVL, Red-Black, Tries, Heaps, segment trees, traversals

File Count: Extensive | Created: July 3, 2026