<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Interview on imflash217</title><link>https://imflash217.github.io/portfolio/tags/interview/</link><description>Recent content in Interview on imflash217</description><generator>Hugo -- 0.146.0</generator><language>en-us</language><atom:link href="https://imflash217.github.io/portfolio/tags/interview/index.xml" rel="self" type="application/rss+xml"/><item><title>Linked List Q&amp;A</title><link>https://imflash217.github.io/portfolio/algorithms/qa/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://imflash217.github.io/portfolio/algorithms/qa/</guid><description>Interview-style Q&amp;amp;A covering linked list fundamentals - nodes, pointers, head/tail, and common operations.</description></item></channel></rss>