<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Nishanthi s</title>
    <description>The latest articles on DEV Community by Nishanthi s (@nishanthi_s).</description>
    <link>https://dev.to/nishanthi_s</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1557577%2F062c6eed-60b3-4137-bd83-8b0f107b76a5.jpeg</url>
      <title>DEV Community: Nishanthi s</title>
      <link>https://dev.to/nishanthi_s</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/nishanthi_s"/>
    <language>en</language>
    <item>
      <title>Greedy Algorithms 🎂🍰</title>
      <dc:creator>Nishanthi s</dc:creator>
      <pubDate>Sat, 15 Jun 2024 07:14:16 +0000</pubDate>
      <link>https://dev.to/nishanthi_s/greedy-algorithms-1d6d</link>
      <guid>https://dev.to/nishanthi_s/greedy-algorithms-1d6d</guid>
      <description>&lt;p&gt;&lt;em&gt;This is a submission for &lt;a href="https://dev.to/challenges/cs"&gt;DEV Computer Science Challenge v24.06.12: One Byte Explainer&lt;/a&gt;.&lt;/em&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Explainer :
&lt;/h2&gt;

&lt;p&gt;Greedy algorithms are like a kid who always takes the biggest slice of cake first. They make the best choice now, but that might not leave enough cake for later. It's a quick way to solve problems, but sometimes being greedy isn't the best idea!&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ff00gavgbfbgzr1o9kne4.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ff00gavgbfbgzr1o9kne4.gif" alt="Image description" width="400" height="300"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Additional Context
&lt;/h2&gt;

&lt;p&gt;In computer science, a greedy algorithm is an algorithmic paradigm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In other words, it makes the best possible decision at each step without worrying about future consequences. This approach is called "greedy" because it always chooses the option that seems to be the best at that moment.&lt;/p&gt;

</description>
      <category>devchallenge</category>
      <category>cschallenge</category>
      <category>computerscience</category>
      <category>beginners</category>
    </item>
    <item>
      <title>Best beaches in the world</title>
      <dc:creator>Nishanthi s</dc:creator>
      <pubDate>Sun, 09 Jun 2024 14:04:52 +0000</pubDate>
      <link>https://dev.to/nishanthi_s/best-beaches-in-the-world-40p8</link>
      <guid>https://dev.to/nishanthi_s/best-beaches-in-the-world-40p8</guid>
      <description>&lt;p&gt;This is a submission for &lt;a href="https://dev.to/challenges/frontend-2024-05-29"&gt;Frontend Challenge v24.04.17&lt;/a&gt;, CSS Art: 09-June-2024&lt;/p&gt;

&lt;h2&gt;
  
  
  Inspiration
&lt;/h2&gt;

&lt;p&gt;It's my first time doing something out of my comfort zone. I'm excited to participate in this challenge and eager to take on even more challenges to improve my skills.&lt;/p&gt;

&lt;h2&gt;
  
  
  Demo
&lt;/h2&gt;

&lt;p&gt;&lt;a href="https://6665af80971505d6121bda73--best-beaches-in-the-world.netlify.app/" rel="noopener noreferrer"&gt;Demo link&lt;/a&gt;&lt;br&gt;
&lt;a href="https://github.com/Nisha091999/Best-Beaches-in-the-World" rel="noopener noreferrer"&gt;Github&lt;/a&gt;&lt;br&gt;
CSS Font from &lt;a href="https://fonts.google.com/" rel="noopener noreferrer"&gt;Google Font&lt;/a&gt;&lt;br&gt;
Hosted the website using &lt;a href="https://www.netlify.com/" rel="noopener noreferrer"&gt;netlify&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Journey
&lt;/h2&gt;

&lt;p&gt;It's been a few months since I last worked on a web application, and I learned a lot during this challenge. Even though I didn't have much time to make it more creative, I'm glad that I participated in it. &lt;/p&gt;

&lt;h2&gt;
  
  
  MIT License
&lt;/h2&gt;

&lt;p&gt;Copyright (c) 2024 Nishanthi&lt;/p&gt;

&lt;p&gt;Permission is hereby granted, free of charge, to any person obtaining a copy&lt;br&gt;
of this software and associated documentation files (the "Software"), to deal&lt;br&gt;
in the Software without restriction, including without limitation the rights&lt;br&gt;
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell&lt;br&gt;
copies of the Software, and to permit persons to whom the Software is&lt;br&gt;
furnished to do so, subject to the following conditions:&lt;/p&gt;

&lt;p&gt;The above copyright notice and this permission notice shall be included in all&lt;br&gt;
copies or substantial portions of the Software.&lt;/p&gt;

&lt;p&gt;THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR&lt;br&gt;
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,&lt;br&gt;
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE&lt;br&gt;
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER&lt;br&gt;
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,&lt;br&gt;
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE&lt;br&gt;
SOFTWARE.&lt;/p&gt;

</description>
      <category>frontendchallenge</category>
      <category>devchallenge</category>
      <category>css</category>
    </item>
  </channel>
</rss>
