<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>Engineering Notes</title>
      <link>https://engineering.jurip.xyz</link>
      <description>Last 10 notes on Engineering Notes</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>Backtracking</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Backtracking</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Backtracking</guid>
    <description><![CDATA[ Backtracking Backtracking is a systematic way to explore all possible solutions by building candidates incrementally and abandoning (“backtracking”) a candidate as soon as it can’t lead to a valid solution. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Binary Search</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Binary-Search</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Binary-Search</guid>
    <description><![CDATA[ Binary Search Binary search finds a target in a sorted array by repeatedly halving the search space. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Greedy Algorithms</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Greedy-Algorithms</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Greedy-Algorithms</guid>
    <description><![CDATA[ Greedy Algorithms A greedy algorithm makes the locally optimal choice at each step, hoping it leads to a globally optimal solution. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Dynamic Programming</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Dynamic-Programming</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Dynamic-Programming</guid>
    <description><![CDATA[ Dynamic Programming Dynamic Programming (DP) solves problems by breaking them into overlapping subproblems and caching the results. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>BFS and DFS</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/BFS-and-DFS</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/BFS-and-DFS</guid>
    <description><![CDATA[ BFS and DFS Breadth-First Search (BFS) and Depth-First Search (DFS) are the two fundamental ways to traverse graphs and trees. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Sliding Window</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Sliding-Window</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Sliding-Window</guid>
    <description><![CDATA[ Sliding Window The sliding window technique maintains a “window” (subarray or substring) that slides across the data. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Sorting Algorithms</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Sorting-Algorithms</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Sorting-Algorithms</guid>
    <description><![CDATA[ Sorting Algorithms Sorting arranges elements in order. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Two Pointers</title>
    <link>https://engineering.jurip.xyz/03-Algorithms/Two-Pointers</link>
    <guid>https://engineering.jurip.xyz/03-Algorithms/Two-Pointers</guid>
    <description><![CDATA[ Two Pointers Two pointers is a technique where you use two indices to scan an array or linked list, typically moving them toward each other or at different speeds. ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Heaps</title>
    <link>https://engineering.jurip.xyz/02-Data-Structures/Heaps</link>
    <guid>https://engineering.jurip.xyz/02-Data-Structures/Heaps</guid>
    <description><![CDATA[ Heaps A heap is a complete binary tree stored in an array where every parent is greater than or equal to its children (max-heap) or less than or equal (min-heap). ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item><item>
    <title>Stacks and Queues</title>
    <link>https://engineering.jurip.xyz/02-Data-Structures/Stacks-and-Queues</link>
    <guid>https://engineering.jurip.xyz/02-Data-Structures/Stacks-and-Queues</guid>
    <description><![CDATA[ Stacks and Queues Stacks and queues are abstract data types that restrict how you access elements. A stack is LIFO (Last In, First Out). ]]></description>
    <pubDate>Mon, 06 Apr 2026 19:26:30 GMT</pubDate>
  </item>
    </channel>
  </rss>