https://r0tbyt3.dev/tags/dsa/Recent content in Dsa on Jesus OsegueraHugoen-ushttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/Algorithms Algorithms - core algorithmic techniques and their Python 3 implementations for technical interview preparation. Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searching Sorting Related Links: Data Structures Patternshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/arrays/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/arrays/Arrays Arrays - ordered, index-based collections stored contiguously in memory with O(1) random access and O(n) insertion. Related Links: Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/backtracking/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/backtracking/Backtracking Backtracking - algorithmic technique building candidates incrementally and abandoning paths that violate constraints. Related Links: Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/bfs-pattern/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/bfs-pattern/BFS Pattern BFS Pattern - breadth-first search template for shortest path, level-order traversal, and multi-source problems. Related Links: Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/big-o-notation/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/big-o-notation/Big O Notation Big O Notation - mathematical notation expressing time and space complexity as a function of input size n. Related Links: Backtracking Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/binary-search-pattern/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/binary-search-pattern/Binary Search Pattern Binary Search Pattern - applying binary search to sorted arrays or to answer questions about monotonic functions. Related Links: BFS Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/binary-search-trees/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/binary-search-trees/Binary Search Trees Binary Search Trees - sorted binary trees supporting O(log n) average search, insert, and delete. Related Links: Arrays Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/bit-manipulation/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/bit-manipulation/Bit Manipulation Bit Manipulation - using bitwise operators (AND, OR, XOR, shifts) to solve problems efficiently at the binary level. Related Links: Backtracking Big O Notation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/Data Structures Data Structures - fundamental data structures every engineer must know, with Python 3 implementations and complexity analysis. Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Tries Related Links: Algorithms Patternshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/dfs-pattern/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/dfs-pattern/DFS Pattern DFS Pattern - depth-first search template for path finding, cycle detection, and exhaustive graph or tree exploration. Related Links: BFS Pattern Binary Search Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/divide-and-conquer/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/divide-and-conquer/Divide and Conquer Divide and Conquer - paradigm splitting a problem into independent subproblems, solving each, then combining results. Related Links: Backtracking Big O Notation Bit Manipulation Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/DSA DSA - data structures and algorithms covering must-know topics for technical interviews, implemented in Python 3. Algorithms Data Structures Patterns Related Links: Backend Engineering Concurrency Databases Django Python Security System Design Webhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/dynamic-programming/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/dynamic-programming/Dynamic Programming Dynamic Programming - optimization technique solving problems with overlapping subproblems using memoization or tabulation. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Graph Algorithms Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/fast-and-slow-pointers/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/fast-and-slow-pointers/Fast and Slow Pointers Fast and Slow Pointers - two-pointer technique for detecting cycles and finding midpoints in linked lists. Related Links: BFS Pattern Binary Search Pattern DFS Pattern Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/graph-algorithms/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/graph-algorithms/Graph Algorithms Graph Algorithms - BFS, DFS, Dijkstra’s shortest path, topological sort, union-find, and minimum spanning trees. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Greedy Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/graphs/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/graphs/Graphs Graphs - collections of nodes connected by edges, represented as adjacency lists or matrices in Python. Related Links: Arrays Binary Search Trees Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/greedy-algorithms/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/greedy-algorithms/Greedy Algorithms Greedy Algorithms - approach making locally optimal choices at each step to reach a globally optimal solution. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Recursion Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/hash-tables/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/hash-tables/Hash Tables Hash Tables - key-value store with O(1) average lookup, insert, and delete, implemented with Python dict and set. Related Links: Arrays Binary Search Trees Graphs Heaps Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/heaps/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/heaps/Heaps Heaps - complete binary trees satisfying the heap property, implemented with Python’s heapq module for priority queues. Related Links: Arrays Binary Search Trees Graphs Hash Tables Linked Lists Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/linked-lists/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/linked-lists/Linked Lists Linked Lists - node-based dynamic data structure with O(1) insertion at known positions and O(n) access by index. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Queues Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/merge-intervals/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/merge-intervals/Merge Intervals Merge Intervals - sorting and sweeping through intervals to merge overlapping ranges in O(n log n). Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Monotonic Stack Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/monotonic-stack/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/monotonic-stack/Monotonic Stack Monotonic Stack - stack maintaining elements in monotonic order to solve next greater or smaller element problems in O(n). Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Sliding Window Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/Patterns Patterns - common problem-solving patterns used in technical interviews, with Python 3 solution templates. BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers Union Find Related Links: Algorithms Data Structureshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/queues/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/queues/Queues Queues - FIFO data structure supporting enqueue and dequeue in O(1), implemented with collections.deque. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Sets Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/recursion/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/recursion/Recursion Recursion - technique where a function calls itself to reduce a problem into smaller subproblems until a base case is reached. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Searching Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/searching/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/searching/Searching Searching - finding elements using linear O(n) search and binary O(log n) search on sorted collections. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Sortinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/sets/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/sets/Sets Sets - unordered collections of unique elements with O(1) average membership testing using Python’s built-in set. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Stacks Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/sliding-window/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/sliding-window/Sliding Window Sliding Window - maintaining a variable or fixed-size subarray window to solve substring and subarray problems in O(n). Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Top K Elements Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/sorting/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/algorithms/sorting/Sorting Sorting - ordering algorithms from O(n²) bubble and insertion sort to O(n log n) merge sort and quicksort in Python. Related Links: Backtracking Big O Notation Bit Manipulation Divide and Conquer Dynamic Programming Graph Algorithms Greedy Algorithms Recursion Searchinghttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/stacks/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/stacks/Stacks Stacks - LIFO data structure supporting push and pop in O(1), implemented with Python lists or collections.deque. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Strings Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/strings/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/strings/Strings Strings - immutable sequences of characters in Python with common manipulation, searching, and pattern-matching techniques. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Trees Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/top-k-elements/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/top-k-elements/Top K Elements Top K Elements - using a min-heap of size K to efficiently find the K largest or most frequent elements. Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Two Pointers Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/trees/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/trees/Trees Trees - hierarchical node-based structures with a root and parent-child relationships used for ordered data. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Trieshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/tries/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/data-structures/tries/Tries Tries - prefix trees enabling O(m) string search and autocomplete, where m is the length of the key. Related Links: Arrays Binary Search Trees Graphs Hash Tables Heaps Linked Lists Queues Sets Stacks Strings Treeshttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/two-pointers/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/two-pointers/Two Pointers Two Pointers - technique using two indices moving toward each other or in the same direction to reduce O(n²) to O(n). Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Union Findhttps://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/union-find/Mon, 01 Jan 0001 00:00:00 +0000https://r0tbyt3.dev/wiki/content/backend-engineering/dsa/patterns/union-find/Union Find Union Find - disjoint set data structure with near O(1) union and find operations for grouping and connectivity problems. Related Links: BFS Pattern Binary Search Pattern DFS Pattern Fast and Slow Pointers Merge Intervals Monotonic Stack Sliding Window Top K Elements Two Pointers