https://r0tbyt3.dev/tags/algorithms/Recent content in Algorithms 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/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/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/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/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/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/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/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/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/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 Searching