<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>accepted on Algorithms and Solutions</title>
    <link>http://algos.youcantmiss.com/tags/accepted/</link>
    <description>Recent content in accepted on Algorithms and Solutions</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 09 Feb 2020 00:00:41 -0800</lastBuildDate>
    
	<atom:link href="http://algos.youcantmiss.com/tags/accepted/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Shortest Distance All Buildings</title>
      <link>http://algos.youcantmiss.com/posts/shortest-distance-all-buildings/</link>
      <pubDate>Sun, 09 Feb 2020 00:00:41 -0800</pubDate>
      
      <guid>http://algos.youcantmiss.com/posts/shortest-distance-all-buildings/</guid>
      <description>You want to build a house on an empty land which reaches all buildings in the shortest amount of distance. You can only move up, down, left and right. You are given a 2D grid of values 0, 1 or 2, where:
Each 0 marks an empty land which you can pass by freely. Each 1 marks a building which you cannot pass through. Each 2 marks an obstacle which you cannot pass through.</description>
    </item>
    
  </channel>
</rss>