<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Stack on Vhaos&#39;s Leetcode Solutions</title>
    <link>https://vhaos-leetcode-solutions.now.sh/tags/stack/</link>
    <description>Recent content in Stack on Vhaos&#39;s Leetcode Solutions</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>Kareem Daggash</copyright>
    <lastBuildDate>Thu, 20 Aug 2020 01:00:52 +0100</lastBuildDate>
    
	<atom:link href="https://vhaos-leetcode-solutions.now.sh/tags/stack/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Reorder List</title>
      <link>https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/20-reorder-list/</link>
      <pubDate>Thu, 20 Aug 2020 01:00:52 +0100</pubDate>
      
      <guid>https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/20-reorder-list/</guid>
      <description>LeetCode August - Day 20 Problem Statement Given a singly linked list L: L0 → L1 → … → Ln-1 → Ln, reorder it to: L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → …
You may not modify the values in the list&amp;rsquo;s nodes, only nodes itself may be changed.
Example 1:
Given 1 -&amp;gt; 2 -&amp;gt; 3 -&amp;gt; 4, reorder it to 1 -&amp;gt; 4 -&amp;gt; 2 -&amp;gt; 3.</description>
    </item>
    
  </channel>
</rss>