https://r0tbyt3.dev/tags/patterns/Recent content in Patterns on Jesus OsegueraHugoen-ushttps://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/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/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/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/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/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/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/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