<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>leetcode Archives - Petamind</title>
	<atom:link href="https://petaminds.com/tag/leetcode/feed/" rel="self" type="application/rss+xml" />
	<link>https://petaminds.com/tag/leetcode/</link>
	<description>A.I, Data and Software Engineering</description>
	<lastBuildDate>Thu, 21 Oct 2021 23:31:17 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://petaminds.com/wp-content/uploads/2019/09/ic_launcher.png</url>
	<title>leetcode Archives - Petamind</title>
	<link>https://petaminds.com/tag/leetcode/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Number of Islands solution</title>
		<link>https://petaminds.com/number-of-islands-solution/</link>
					<comments>https://petaminds.com/number-of-islands-solution/#respond</comments>
		
		<dc:creator><![CDATA[Tung Nguyen]]></dc:creator>
		<pubDate>Thu, 21 Oct 2021 22:36:30 +0000</pubDate>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[bfs]]></category>
		<category><![CDATA[Kotlin]]></category>
		<category><![CDATA[leetcode]]></category>
		<category><![CDATA[queue]]></category>
		<guid isPermaLink="false">https://petaminds.com/?p=3438</guid>

					<description><![CDATA[<p>In this post, we have a look at using a queue and breath-first search algorithm to solve a Leetcode challenge. The problem is stated as follows. Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally [&#8230;]</p>
<p>The post <a href="https://petaminds.com/number-of-islands-solution/">Number of Islands solution</a> appeared first on <a href="https://petaminds.com">Petamind</a>.</p>
]]></description>
		
					<wfw:commentRss>https://petaminds.com/number-of-islands-solution/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Asteroid Collision Solution &#8211; Leetcode coding challenge</title>
		<link>https://petaminds.com/asteroid-collision-solution-leetcode-coding-challenge/</link>
					<comments>https://petaminds.com/asteroid-collision-solution-leetcode-coding-challenge/#respond</comments>
		
		<dc:creator><![CDATA[Tung Nguyen]]></dc:creator>
		<pubDate>Fri, 02 Oct 2020 01:57:00 +0000</pubDate>
				<category><![CDATA[data science]]></category>
		<category><![CDATA[asteroid]]></category>
		<category><![CDATA[challenge]]></category>
		<category><![CDATA[coding]]></category>
		<category><![CDATA[collision]]></category>
		<category><![CDATA[JAVA]]></category>
		<category><![CDATA[leetcode]]></category>
		<category><![CDATA[python]]></category>
		<guid isPermaLink="false">https://petaminds.com/?p=2845</guid>

					<description><![CDATA[<p>The following asteroid collision problem is from Leetcode. The problem We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed. Find out the state of the [&#8230;]</p>
<p>The post <a href="https://petaminds.com/asteroid-collision-solution-leetcode-coding-challenge/">Asteroid Collision Solution &#8211; Leetcode coding challenge</a> appeared first on <a href="https://petaminds.com">Petamind</a>.</p>
]]></description>
		
					<wfw:commentRss>https://petaminds.com/asteroid-collision-solution-leetcode-coding-challenge/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
