<?xml version="1.0" encoding="UTF-8"?><oembed><type>video</type><version>1.0</version><html>&lt;iframe src=&quot;https://www.loom.com/embed/09c8c53593124f0e894bc9af5d1b5773&quot; frameborder=&quot;0&quot; width=&quot;3840&quot; height=&quot;2880&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>2880</height><width>3840</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>2880</thumbnail_height><thumbnail_width>3840</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/09c8c53593124f0e894bc9af5d1b5773-951b65380ba99294.gif</thumbnail_url><duration>24.9273</duration><title>Steps in a Competing Program</title><description>In this video, I demonstrate the number of steps involved in a competing program and how using a unique function can streamline the process. By selecting &quot;keep unique&quot; and applying the &quot;uncat unique&quot; method, I can achieve the desired results much more efficiently. I encourage you to consider these techniques in your own work.</description></oembed>