<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
  <title>RunTimeFix</title>
  <link>https://runtimefix.vercel.app/</link>
  <description>Practical programming education. Competitive programming, DSA, algorithms, web development, databases and software engineering — through books, videos, courses and hands-on learning.</description>
  <language>en</language>
  <lastBuildDate>Mon, 26 Oct 2026 19:45:48 GMT</lastBuildDate>
  <atom:link href="https://runtimefix.vercel.app//feed.xml" rel="self" type="application/rss+xml"/>

  <item>
    <title>Ch 1: C++ Foundations & Input/Output</title>
    <link>https://runtimefix.vercel.app//study/cpp-foundations-io</link>
    <guid>https://runtimefix.vercel.app//study/cpp-foundations-io</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Program Structure & Compilation, Variables & Data Types, Arithmetic Operations & Modulo, Integer Overflow & The 1LL Trick, Input/Output Streams & Fast I/O, Conditionals & Logical Operators]]></description>
  </item>
  <item>
    <title>Ch 2: Loops & Direct Simulations</title>
    <link>https://runtimefix.vercel.app//study/loops-simulations</link>
    <guid>https://runtimefix.vercel.app//study/loops-simulations</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The Three Loop Structures, Loop Controls: break & continue, Nested Loops, Core Loop Patterns]]></description>
  </item>
  <item>
    <title>Ch 3: Arrays, Strings & Character Operations</title>
    <link>https://runtimefix.vercel.app//study/arrays-strings-character-operations</link>
    <guid>https://runtimefix.vercel.app//study/arrays-strings-character-operations</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[1D Arrays (C-Style), 2D Arrays & Row-Major Layout, std::string & Character Operations]]></description>
  </item>
  <item>
    <title>Ch 4: Functions & Recursion</title>
    <link>https://runtimefix.vercel.app//study/functions-recursion</link>
    <guid>https://runtimefix.vercel.app//study/functions-recursion</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Function Mechanics & Variable Scope, Parameter Passing: Value vs. Reference, Recursion & the Call Stack]]></description>
  </item>
  <item>
    <title>Ch 5: Strings & Character Operations</title>
    <link>https://runtimefix.vercel.app//study/strings-character-operations</link>
    <guid>https://runtimefix.vercel.app//study/strings-character-operations</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[std::string in C++, Character Operations & ASCII Mathematics]]></description>
  </item>
  <item>
    <title>Ch 6: Structs, Lambdas & Structured Bindings</title>
    <link>https://runtimefix.vercel.app//study/structs-lambdas-structured-bindings</link>
    <guid>https://runtimefix.vercel.app//study/structs-lambdas-structured-bindings</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Structures (Structs) in C++, Lambdas & Inline Comparators, auto & Structured Bindings (C++17)]]></description>
  </item>
  <item>
    <title>Ch 7: Preprocessor, Debug Macros & Compilation</title>
    <link>https://runtimefix.vercel.app//study/preprocessor-debug-macros</link>
    <guid>https://runtimefix.vercel.app//study/preprocessor-debug-macros</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The C++ Preprocessor & Macros, Compilation Pipeline & G++ Compiler Flags]]></description>
  </item>
  <item>
    <title>Ch 8: Vectors, Pairs & Utility Algorithms</title>
    <link>https://runtimefix.vercel.app//study/vectors-pairs-utility-algorithms</link>
    <guid>https://runtimefix.vercel.app//study/vectors-pairs-utility-algorithms</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[std::vector — The Dynamic Array, std::pair — Grouping Two Values, std::tuple — Grouping Three or More Values (D1), String STL Methods (Advanced), Iterators — The Bridge Between Containers and Algorithms, Utility Algorithms]]></description>
  </item>
  <item>
    <title>Ch 9: Sets, Maps & Multi-Containers</title>
    <link>https://runtimefix.vercel.app//study/sets-maps-multi-containers</link>
    <guid>https://runtimefix.vercel.app//study/sets-maps-multi-containers</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[std::set — Ordered Unique Elements, std::multiset — Ordered Elements with Duplicates, std::map — Key-Value Associations, std::unordered_map & std::unordered_set — Hash-Based Containers, std::stack — LIFO Container Adapter, std::queue — FIFO Container Adapter, std::deque — Double-Ended Queue, std::priority_queue — Heap-Based Container]]></description>
  </item>
  <item>
    <title>Ch 10: Sorting & Frequency Arrays</title>
    <link>https://runtimefix.vercel.app//study/sorting-frequency-arrays</link>
    <guid>https://runtimefix.vercel.app//study/sorting-frequency-arrays</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[std::sort — The Workhorse, lower_bound & upper_bound — Binary Search in STL, binary_search — Boolean Existence Check, unique — Removing Consecutive Duplicates, next_permutation — Generating Permutations, Sorting Applications, Frequency Counting]]></description>
  </item>
  <item>
    <title>Ch 11: Complexity & Problem Solving</title>
    <link>https://runtimefix.vercel.app//study/complexity-problem-solving</link>
    <guid>https://runtimefix.vercel.app//study/complexity-problem-solving</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Reading Problem Statements, Complexity Analysis, Brute Force, Observation Finding, Edge-Case Handling, Debugging Techniques, Stress Testing]]></description>
  </item>
  <item>
    <title>Ch 12: Basic Number Theory & Modular Arithmetic</title>
    <link>https://runtimefix.vercel.app//study/number-theory-modular-arithmetic</link>
    <guid>https://runtimefix.vercel.app//study/number-theory-modular-arithmetic</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Divisibility, GCD & LCM, Primes & Primality Testing, Sieve of Eratosthenes, Prime Factorization, Divisor Enumeration, Modular Arithmetic, Binary Exponentiation, Parity Arguments, Sum Formulas]]></description>
  </item>
  <item>
    <title>Ch 13: Prefix Sums & Difference Arrays</title>
    <link>https://runtimefix.vercel.app//study/prefix-sums-difference-arrays</link>
    <guid>https://runtimefix.vercel.app//study/prefix-sums-difference-arrays</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[1D Prefix Sums, 2D Prefix Sums, Suffix Sums & Suffix Aggregates, Difference Arrays]]></description>
  </item>
  <item>
    <title>Ch 14: Two Pointers & Sliding Window</title>
    <link>https://runtimefix.vercel.app//study/two-pointers-sliding-window</link>
    <guid>https://runtimefix.vercel.app//study/two-pointers-sliding-window</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Two Pointers (Opposite Direction), Two Pointers (Same Direction), Sliding Window (Fixed Size), Sliding Window (Variable Size)]]></description>
  </item>
  <item>
    <title>Ch 15: Binary Search (Array & Answer Space)</title>
    <link>https://runtimefix.vercel.app//study/binary-search</link>
    <guid>https://runtimefix.vercel.app//study/binary-search</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Binary Search on a Sorted Array, STL Binary Search Functions, Binary Search on the Answer, Boundary Handling]]></description>
  </item>
  <item>
    <title>Ch 16: Greedy Algorithms & Constructive Problems</title>
    <link>https://runtimefix.vercel.app//study/greedy-algorithms-constructive</link>
    <guid>https://runtimefix.vercel.app//study/greedy-algorithms-constructive</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The Greedy Paradigm, Sorting-Based Greedy, Interval Scheduling (Activity Selection), The Exchange Argument, Constructive Algorithms]]></description>
  </item>
  <item>
    <title>Ch 17: Bit Manipulation & Masking</title>
    <link>https://runtimefix.vercel.app//study/bit-manipulation-masking</link>
    <guid>https://runtimefix.vercel.app//study/bit-manipulation-masking</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Bitwise Operators, Bit Tricks, XOR Properties, Bitmask Enumeration, __builtin Functions]]></description>
  </item>
  <item>
    <title>Ch 18: Stacks, Queues & Monotonicity</title>
    <link>https://runtimefix.vercel.app//study/stacks-queues-monotonicity</link>
    <guid>https://runtimefix.vercel.app//study/stacks-queues-monotonicity</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Stack Applications, Queue Applications, Monotonic Stack, Monotonic Deque (Sliding Window Min/Max)]]></description>
  </item>
  <item>
    <title>Ch 19: Disjoint Set Union (DSU)</title>
    <link>https://runtimefix.vercel.app//study/disjoint-set-union</link>
    <guid>https://runtimefix.vercel.app//study/disjoint-set-union</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The Problem DSU Solves, Naive Implementation, Optimization 1: Path Compression, Optimization 2: Union by Rank/Size, Component Queries]]></description>
  </item>
  <item>
    <title>Ch 20: Coordinate Compression, Fenwick Tree & Segment Tree</title>
    <link>https://runtimefix.vercel.app//study/fenwick-tree-segment-tree</link>
    <guid>https://runtimefix.vercel.app//study/fenwick-tree-segment-tree</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Coordinate Compression, Fenwick Tree (Binary Indexed Tree), Segment Tree, Sparse Table (D1 — Recognition)]]></description>
  </item>
  <item>
    <title>Ch 21: Graph Representation, DFS & BFS</title>
    <link>https://runtimefix.vercel.app//study/graph-dfs-bfs</link>
    <guid>https://runtimefix.vercel.app//study/graph-dfs-bfs</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Graph Terminology, Graph Representation, DFS on Graphs, BFS on Graphs, Connected Components, Grid Traversal]]></description>
  </item>
  <item>
    <title>Ch 22: Cycle Detection, Bipartite Checking & Topological Sort</title>
    <link>https://runtimefix.vercel.app//study/cycle-detection-topological-sort</link>
    <guid>https://runtimefix.vercel.app//study/cycle-detection-topological-sort</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Cycle Detection in Undirected Graphs, Cycle Detection in Directed Graphs, Bipartite Checking, Topological Sort, DAG Reasoning, Functional Graphs]]></description>
  </item>
  <item>
    <title>Ch 23: Dijkstra, 0-1 BFS & Kruskal's MST</title>
    <link>https://runtimefix.vercel.app//study/dijkstra-kruskal-mst</link>
    <guid>https://runtimefix.vercel.app//study/dijkstra-kruskal-mst</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Dijkstra's Algorithm, 0-1 BFS, Minimum Spanning Tree — Kruskal's Algorithm]]></description>
  </item>
  <item>
    <title>Ch 24: Rooted Trees — DFS, Subtree Size & Diameter</title>
    <link>https://runtimefix.vercel.app//study/rooted-trees</link>
    <guid>https://runtimefix.vercel.app//study/rooted-trees</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Tree Terminology, Rooting a Tree, Tree Diameter, Distance Between Two Vertices, Tree Algorithms: Summary of Techniques]]></description>
  </item>
  <item>
    <title>Ch 25: Binary Lifting, LCA & Euler Tour</title>
    <link>https://runtimefix.vercel.app//study/binary-lifting-lca-euler-tour</link>
    <guid>https://runtimefix.vercel.app//study/binary-lifting-lca-euler-tour</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Binary Lifting, Lowest Common Ancestor (LCA), Euler Tour]]></description>
  </item>
  <item>
    <title>Ch 26: Dynamic Programming — Foundations</title>
    <link>https://runtimefix.vercel.app//study/dynamic-programming-foundations</link>
    <guid>https://runtimefix.vercel.app//study/dynamic-programming-foundations</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The DP Paradigm, The DP Recipe, Classic DP Problems, Longest Increasing Subsequence (LIS), Maximum Subarray Sum (Kadane's Algorithm)]]></description>
  </item>
  <item>
    <title>Ch 27: Dynamic Programming — Knapsack & Subsets</title>
    <link>https://runtimefix.vercel.app//study/dp-knapsack-subsets</link>
    <guid>https://runtimefix.vercel.app//study/dp-knapsack-subsets</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The 0-1 Knapsack Problem, Unbounded Knapsack, Subset Sum & Knapsack Variants, Bitmask DP]]></description>
  </item>
  <item>
    <title>Ch 28: Backtracking & Meet-in-the-Middle</title>
    <link>https://runtimefix.vercel.app//study/backtracking-meet-in-the-middle</link>
    <guid>https://runtimefix.vercel.app//study/backtracking-meet-in-the-middle</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[The Backtracking Template, Generating Combinatorial Objects, Pruning, Meet-in-the-Middle]]></description>
  </item>
  <item>
    <title>Ch 29: Modular Inverse, Combinatorics & Fast Math</title>
    <link>https://runtimefix.vercel.app//study/combinatorics-fast-math</link>
    <guid>https://runtimefix.vercel.app//study/combinatorics-fast-math</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Modular Multiplicative Inverse, Combinatorics: C(N, K) mod M, Common Combinatorial Problems, Matrix Exponentiation (Fast Math)]]></description>
  </item>
  <item>
    <title>Ch 30: Hashing, String Algorithms & Geometry Basics</title>
    <link>https://runtimefix.vercel.app//study/hashing-string-algorithms-geometry</link>
    <guid>https://runtimefix.vercel.app//study/hashing-string-algorithms-geometry</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Study</category>
    <description><![CDATA[Polynomial Rolling Hashing, The Trie (Prefix Tree), Geometry: The Cross Product, Book 1 Conclusion]]></description>
  </item>
  <item>
    <title>Topic: Competitive Programming</title>
    <link>https://runtimefix.vercel.app//topics/competitive-programming</link>
    <guid>https://runtimefix.vercel.app//topics/competitive-programming</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Master contest strategy, problem-solving patterns, and the techniques that win rated competitions on Codeforces, LeetCode, and ICPC.]]></description>
  </item>
  <item>
    <title>Topic: Dynamic Programming</title>
    <link>https://runtimefix.vercel.app//topics/dynamic-programming</link>
    <guid>https://runtimefix.vercel.app//topics/dynamic-programming</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Learn dynamic programming from foundations to advanced techniques: state design, transitions, knapsack, bitmask DP, and optimization.]]></description>
  </item>
  <item>
    <title>Topic: Graphs & Graph Algorithms</title>
    <link>https://runtimefix.vercel.app//topics/graphs</link>
    <guid>https://runtimefix.vercel.app//topics/graphs</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Graph representation, DFS, BFS, Dijkstra's algorithm, MST, topological sort, cycle detection, and tree algorithms explained with C++ code.]]></description>
  </item>
  <item>
    <title>Topic: Data Structures</title>
    <link>https://runtimefix.vercel.app//topics/data-structures</link>
    <guid>https://runtimefix.vercel.app//topics/data-structures</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Arrays, vectors, sets, maps, stacks, queues, priority queues, Fenwick trees, segment trees, and DSU — when to use each and why.]]></description>
  </item>
  <item>
    <title>Topic: Algorithms</title>
    <link>https://runtimefix.vercel.app//topics/algorithms</link>
    <guid>https://runtimefix.vercel.app//topics/algorithms</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Sorting, searching, binary search, two pointers, sliding window, prefix sums, greedy, and divide-and-conquer algorithms with complexity analysis.]]></description>
  </item>
  <item>
    <title>Topic: C++ for Competitive Programming</title>
    <link>https://runtimefix.vercel.app//topics/cpp</link>
    <guid>https://runtimefix.vercel.app//topics/cpp</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Modern C++ fundamentals: I/O, STL containers, iterators, lambdas, structured bindings, and the features that make C++ the language of competitive programming.]]></description>
  </item>
  <item>
    <title>Topic: Binary Search</title>
    <link>https://runtimefix.vercel.app//topics/binary-search</link>
    <guid>https://runtimefix.vercel.app//topics/binary-search</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Binary search on sorted arrays and answer spaces — the technique that turns O(n) into O(log n). Boundary handling, STL functions, and practice problems.]]></description>
  </item>
  <item>
    <title>Topic: Greedy Algorithms</title>
    <link>https://runtimefix.vercel.app//topics/greedy-algorithms</link>
    <guid>https://runtimefix.vercel.app//topics/greedy-algorithms</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[The greedy paradigm: when local optima lead to global optima. Sorting-based greedy, interval scheduling, exchange arguments, and constructive problems.]]></description>
  </item>
  <item>
    <title>Topic: Number Theory & Modular Arithmetic</title>
    <link>https://runtimefix.vercel.app//topics/number-theory</link>
    <guid>https://runtimefix.vercel.app//topics/number-theory</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Divisibility, GCD, LCM, primes, sieve of Eratosthenes, modular arithmetic, binary exponentiation, and combinatorics for programming contests.]]></description>
  </item>
  <item>
    <title>Topic: Bit Manipulation</title>
    <link>https://runtimefix.vercel.app//topics/bit-manipulation</link>
    <guid>https://runtimefix.vercel.app//topics/bit-manipulation</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Bitwise operators, XOR properties, bitmask enumeration, and subset iteration — the low-level tricks that unlock elegant solutions.]]></description>
  </item>
  <item>
    <title>Topic: Two Pointers & Sliding Window</title>
    <link>https://runtimefix.vercel.app//topics/two-pointers</link>
    <guid>https://runtimefix.vercel.app//topics/two-pointers</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Two pointers (opposite and same direction) and sliding window (fixed and variable size) — the O(n) patterns that replace brute force.]]></description>
  </item>
  <item>
    <title>Topic: Segment Tree & Fenwick Tree</title>
    <link>https://runtimefix.vercel.app//topics/segment-tree</link>
    <guid>https://runtimefix.vercel.app//topics/segment-tree</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Range query data structures: Fenwick tree (BIT) for prefix operations, segment tree for arbitrary range queries and updates in O(log n).]]></description>
  </item>
  <item>
    <title>Topic: String Algorithms & Hashing</title>
    <link>https://runtimefix.vercel.app//topics/string-algorithms</link>
    <guid>https://runtimefix.vercel.app//topics/string-algorithms</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Polynomial rolling hashing, trie (prefix tree), string matching, and character operations for competitive programming.]]></description>
  </item>
  <item>
    <title>Topic: Tree Algorithms</title>
    <link>https://runtimefix.vercel.app//topics/trees</link>
    <guid>https://runtimefix.vercel.app//topics/trees</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Rooted trees, DFS on trees, subtree size, tree diameter, binary lifting, LCA, and Euler tour — the tree techniques that appear in every contest.]]></description>
  </item>
  <item>
    <title>Topic: Complexity Analysis</title>
    <link>https://runtimefix.vercel.app//topics/complexity-analysis</link>
    <guid>https://runtimefix.vercel.app//topics/complexity-analysis</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Time and space complexity: Big-O notation, amortized analysis, and the skill of reading constraints to choose the right algorithm.]]></description>
  </item>
  <item>
    <title>Topic: Recursion & Backtracking</title>
    <link>https://runtimefix.vercel.app//topics/recursion</link>
    <guid>https://runtimefix.vercel.app//topics/recursion</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[Recursive thinking, the call stack, backtracking templates, pruning, and meet-in-the-middle — from basics to advanced enumeration.]]></description>
  </item>
  <item>
    <title>Topic: Sorting & Frequency Arrays</title>
    <link>https://runtimefix.vercel.app//topics/sorting</link>
    <guid>https://runtimefix.vercel.app//topics/sorting</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[std::sort, custom comparators, lower_bound, upper_bound, next_permutation, and frequency counting techniques.]]></description>
  </item>
  <item>
    <title>Topic: Prefix Sums & Difference Arrays</title>
    <link>https://runtimefix.vercel.app//topics/prefix-sums</link>
    <guid>https://runtimefix.vercel.app//topics/prefix-sums</guid>
    <pubDate>Mon, 26 Oct 2026 19:45:48 GMT</pubDate>
    <author>RunTimeFix</author>
    <category>Topic Guide</category>
    <description><![CDATA[1D and 2D prefix sums, suffix aggregates, and difference arrays — the O(1) range query techniques every programmer should know.]]></description>
  </item>
</channel>
</rss>