<?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: Farhad</title>
    <description>The latest articles on DEV Community by Farhad (@feriun).</description>
    <link>https://dev.to/feriun</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%2F539549%2Fb0fcaf49-d3e7-4e53-8bff-f1fe945b9b03.jpg</url>
      <title>DEV Community: Farhad</title>
      <link>https://dev.to/feriun</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/feriun"/>
    <language>en</language>
    <item>
      <title>Convert string to camel case CodeWars Kata</title>
      <dc:creator>Farhad</dc:creator>
      <pubDate>Wed, 12 May 2021 14:14:43 +0000</pubDate>
      <link>https://dev.to/feriun/convert-string-to-camel-case-codewars-kata-299i</link>
      <guid>https://dev.to/feriun/convert-string-to-camel-case-codewars-kata-299i</guid>
      <description>&lt;h1&gt;
  
  
  Codewars
&lt;/h1&gt;

&lt;p&gt;&lt;a href="https://codewars.com"&gt;Codewars&lt;/a&gt; is a platform that helps you learn, train, and improve your coding skills by solving programming tasks of many types and difficulty levels. Here is the first Kata I've solved here, and I would like to share my solutions here in DEV.&lt;/p&gt;

&lt;h1&gt;
  
  
  What is a Kata?
&lt;/h1&gt;

&lt;p&gt;On Codewars, kata is code challenges focused on improving skill and technique.&lt;/p&gt;

&lt;p&gt;❓ Here is my first Kata:&lt;/p&gt;

&lt;p&gt;&lt;a href="https://www.codewars.com/kata/517abf86da9663f1d2000003/"&gt;Link to the Kata&lt;/a&gt;&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;Write a method/function so that it converts dash/underscore delimited words into camel casing. The first word within the output should be capitalized only if the original word was capitalized (known as Upper Camel Case, also often referred to as Pascal case).&lt;/p&gt;

&lt;p&gt;Examples&lt;/p&gt;

&lt;p&gt;"the-stealth-warrior" gets converted to "theStealthWarrior"&lt;br&gt;
"The_Stealth_Warrior" gets converted to "TheStealthWarrior"&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;💡 We can use &lt;a href="https://en.wikipedia.org/wiki/Regular_expression"&gt;Regex&lt;/a&gt; to perform a search and replace in almost all programming languages.&lt;/p&gt;


&lt;div class="ltag__wikipedia--container"&gt;
  &lt;div class="ltag__wikipedia--header"&gt;
    &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--8Y-xY3vU--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev.to/assets/wikipedia-logo-0a3e76624c7b1c3ccdeb9493ea4add6ef5bd82d7e88d102d5ddfd7c981efa2e7.svg" class="ltag__wikipedia--logo" alt="Wikipedia Logo" width="128" height="128"&gt;
    &lt;a href="https://en.wikipedia.org/wiki/Regular_expression" rel="noopener noreferrer"&gt;Regular expression&lt;/a&gt;
  &lt;/div&gt;
  &lt;div class="ltag__wikipedia--extract"&gt;&lt;p&gt;A &lt;b&gt;regular expression&lt;/b&gt; is a sequence of characters that specifies a match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings, or for input validation. Regular expression techniques are developed in theoretical computer science and formal language theory.&lt;/p&gt;&lt;/div&gt;
  &lt;div class="ltag__wikipedia--btn--container"&gt;
    
      &lt;a href="https://en.wikipedia.org/wiki/Regular_expression" rel="noopener noreferrer"&gt;View on Wikipedia&lt;/a&gt;
    
  &lt;/div&gt;
&lt;/div&gt;


&lt;p&gt;I used &lt;a href="https://www.php.net/manual/en/function.preg-replace-callback.php"&gt;&lt;code&gt;preg_replace_callback&lt;/code&gt;&lt;/a&gt; function in PHP which performs a regular expression search and replace using a callback to find &lt;code&gt;"_\w"&lt;/code&gt; or &lt;code&gt;"-\w"&lt;/code&gt; patters like &lt;code&gt;_a&lt;/code&gt; or &lt;code&gt;-b&lt;/code&gt; and replace them with the equivalent uppercase character. like &lt;code&gt;_b&lt;/code&gt; =&amp;gt; &lt;code&gt;B&lt;/code&gt; so &lt;code&gt;the-stealth&lt;/code&gt; will be &lt;code&gt;theStealth&lt;/code&gt;.&lt;/p&gt;

&lt;p&gt;💻 So, my solution in PHP is:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight php"&gt;&lt;code&gt;&lt;span class="k"&gt;function&lt;/span&gt; &lt;span class="n"&gt;toCamelCase&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nv"&gt;$str&lt;/span&gt;&lt;span class="p"&gt;){&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;preg_replace_callback&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s1"&gt;'/(\-|\_)([a-z])/i'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="k"&gt;function&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nv"&gt;$match&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;strtoupper&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nv"&gt;$match&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;]);&lt;/span&gt;
    &lt;span class="p"&gt;},&lt;/span&gt; &lt;span class="nv"&gt;$str&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;You might ask what is that &lt;code&gt;$match[2]&lt;/code&gt;, well here is the &lt;code&gt;var_dump($match)&lt;/code&gt; output:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight php"&gt;&lt;code&gt;&lt;span class="k"&gt;array&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="o"&gt;=&amp;gt;&lt;/span&gt;
  &lt;span class="nf"&gt;string&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="s2"&gt;"_s"&lt;/span&gt;
  &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="o"&gt;=&amp;gt;&lt;/span&gt;
  &lt;span class="nf"&gt;string&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="s2"&gt;"_"&lt;/span&gt; 
  &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="o"&gt;=&amp;gt;&lt;/span&gt;
  &lt;span class="nf"&gt;string&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="s2"&gt;"s"&lt;/span&gt; 
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;as you see inside of each iteration this array contains, the matched string beside regex groups! in our case here we can access that group by $match[2]`.&lt;/p&gt;

&lt;h2&gt;
  
  
  &lt;strong&gt;Thank You&lt;/strong&gt; ❤️
&lt;/h2&gt;

&lt;p&gt;I wish my posts to be useful to anyone who's new to the world of programming or anybody who's curious 🧐!&lt;br&gt;
If you find the content useful to you, please comment your thoughts, I would love to learn from you all.&lt;/p&gt;

&lt;p&gt;Thank you for your loving directions.&lt;/p&gt;

</description>
      <category>codewars</category>
      <category>programming</category>
      <category>challenge</category>
    </item>
    <item>
      <title>Project Euler 002</title>
      <dc:creator>Farhad</dc:creator>
      <pubDate>Sat, 08 May 2021 11:15:34 +0000</pubDate>
      <link>https://dev.to/feriun/project-euler-002-4356</link>
      <guid>https://dev.to/feriun/project-euler-002-4356</guid>
      <description>&lt;h1&gt;
  
  
  Hello DEV
&lt;/h1&gt;

&lt;p&gt;Project Euler is a series of challenging mathematical/computer programming problems that I like to start. I'm sure there will be a lot to learn for me, and I would like to share my solutions here in DEV.&lt;/p&gt;

&lt;p&gt;❓ Here is problem 002:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:&lt;/p&gt;

&lt;p&gt;1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...&lt;/p&gt;

&lt;p&gt;By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;💡 For solving this problem, we can use a combination of the Modulo operation and also Addition.&lt;/p&gt;

&lt;p&gt;❗ The first solution you might think of when working with Fibonacci sequence or other similar concepts in programming is for sure,&lt;br&gt;
the recursive approach. but we always need to remember that these functions may be called a thousand times and this simply means&lt;br&gt;
you will face one of those &lt;code&gt;Maximum call stack size exceeded&lt;/code&gt; like errors!&lt;/p&gt;

&lt;p&gt;This happens because of 💀 the space complexity of these algorithms (&lt;a href="https://syedtousifahmed.medium.com/fibonacci-iterative-vs-recursive"&gt;Have a 👀 at this article on this topic&lt;/a&gt;), so I use the Iterative approach instead here.&lt;/p&gt;

&lt;p&gt;This is the formula for the Fibonacci sequence:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;fib(n) = fib(n-1) + fib(n-2) → for n &amp;gt; 1
fib(n) = 1 → for n = 0, 1
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;we can suppose we have these variables:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;MAX&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;4000000&lt;/span&gt;

&lt;span class="n"&gt;first_number&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
&lt;span class="n"&gt;second_number&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;

&lt;span class="nb"&gt;sum&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;then we calculate the answer by calculating every next term by its previous terms that we simply store in 2 different variables!&lt;br&gt;
and then filtering out the even numbers and summing them all up.&lt;/p&gt;

&lt;p&gt;💻 So, my solution in Python is:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;while&lt;/span&gt; &lt;span class="n"&gt;second_number&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;MAX&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;temp&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;second_number&lt;/span&gt;
    &lt;span class="n"&gt;second_number&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;first_number&lt;/span&gt;
    &lt;span class="n"&gt;first_number&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;temp&lt;/span&gt;

    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;second_number&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="nb"&gt;sum&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;second_number&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This might not be the best answer to this problem, but it only calculates 32 numbers (odd numbers also included) for this problem,&lt;br&gt;
which is much better than the recursive approach. clearly if you be able to find a way not calculating the odd numbers at all! that&lt;br&gt;
will be a perfect improvement, Can't wait to see if you have any ideas about this.&lt;/p&gt;

&lt;p&gt;✅ The answer to this problem is &lt;strong&gt;&lt;code&gt;4613732&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  &lt;strong&gt;Thank You&lt;/strong&gt; ❤️
&lt;/h2&gt;

&lt;p&gt;I wish my posts to be useful to anyone new to the world of programming or anybody curious 🧐!&lt;br&gt;
If you find the content useful to you, please comment your thoughts, I would love to learn from you all.&lt;/p&gt;

&lt;p&gt;Thank you for your loving directions.&lt;/p&gt;

</description>
      <category>projecteuler</category>
      <category>programming</category>
      <category>challenge</category>
    </item>
    <item>
      <title>Project Euler 001</title>
      <dc:creator>Farhad</dc:creator>
      <pubDate>Fri, 07 May 2021 13:52:21 +0000</pubDate>
      <link>https://dev.to/feriun/project-euler-001-2213</link>
      <guid>https://dev.to/feriun/project-euler-001-2213</guid>
      <description>&lt;h1&gt;
  
  
  Hey folks
&lt;/h1&gt;

&lt;p&gt;Project Euler is a series of challenging mathematical/computer programming problems that I like to start. I'm sure there will be a lot to learn for me, and I would like to share my solutions here in DEV.&lt;/p&gt;

&lt;p&gt;❓ Here is problem 001:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6, and 9. The sum of these multiples is 23.&lt;br&gt;
Find the sum of all the multiples of 3 or 5 below 1000.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;💡 For solving this problem, we can simply use the Modulo operation and calculate the numbers which are multiples of 3 or 5.&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;❗ Modulo is a math operation that finds the remainder when one integer is divided by another. In writing, it is frequently abbreviated as a mod, or represented by the symbol %.&lt;br&gt;
For two integers a and b:&lt;br&gt;
a mod b = r&lt;br&gt;
Where a is the dividend, b is the divisor (or modulus), and r is the remainder.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;Here is an example:&lt;/p&gt;

&lt;p&gt;11 mod 4 = 3, because 11 divides by 4 (twice), with 3 remaining.&lt;/p&gt;

&lt;p&gt;💻 So, my solution in Python is:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="nb"&gt;sum&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;

&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;integer&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;integer&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="ow"&gt;or&lt;/span&gt; &lt;span class="n"&gt;integer&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="nb"&gt;sum&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;integer&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;✅ The answer to this problem is &lt;strong&gt;&lt;code&gt;233168&lt;/code&gt;&lt;/strong&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  &lt;strong&gt;Thank You&lt;/strong&gt; ❤️
&lt;/h2&gt;

&lt;p&gt;I wish my posts to be useful to anyone new to the world of programming or anybody curious 🧐!&lt;br&gt;
If you find the content useful to you, please comment your thoughts, I would love to learn from you all.&lt;/p&gt;

&lt;p&gt;Thank you for your loving directions.&lt;/p&gt;

</description>
      <category>projecteuler</category>
      <category>programming</category>
      <category>challenge</category>
    </item>
    <item>
      <title>Tailwind CSS Window Mockup Light/Dark</title>
      <dc:creator>Farhad</dc:creator>
      <pubDate>Sun, 27 Dec 2020 08:54:25 +0000</pubDate>
      <link>https://dev.to/feriun/tailwind-css-window-mockup-light-dark-4df5</link>
      <guid>https://dev.to/feriun/tailwind-css-window-mockup-light-dark-4df5</guid>
      <description>&lt;p&gt;Hey there, 👋&lt;br&gt;
Here is a Window Mockup built with &lt;strong&gt;&lt;a href="https://tailwindcss.com/"&gt;tailwind CSS&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--9ZvTeJzk--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/i/jy379x0ayf5oxbiqchwz.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--9ZvTeJzk--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_800/https://dev-to-uploads.s3.amazonaws.com/i/jy379x0ayf5oxbiqchwz.png" alt="Preview" width="800" height="427"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;⭐ I've also included the new &lt;em&gt;Dark Mode&lt;/em&gt; feature in Tailwind, so you only need to add the &lt;code&gt;dark&lt;/code&gt; class to the parent element or the &lt;code&gt;HTML tag of your document to turn the dark mode on, you can also move the transition classes to your&lt;/code&gt;HTML tag.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;⚠ This behavior is triggered by using the &lt;code&gt;class&lt;/code&gt; option in your tailwind config file, other methods are described in &lt;a href="https://tailwindcss.com/docs/dark-mode"&gt;Documentation&lt;/a&gt;&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="c1"&gt;// tailwind.config.js&lt;/span&gt;
&lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="na"&gt;darkMode&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;class&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
  &lt;span class="c1"&gt;// ...&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;





&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight html"&gt;&lt;code&gt;&lt;span class="nt"&gt;&amp;lt;div&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"max-w-2xl transition-colors ease-linear shadow-md"&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&lt;/span&gt;
    &lt;span class="nt"&gt;&amp;lt;div&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"w-full h-12 rounded-t-lg bg-gray-200 dark:bg-gray-900 flex justify-start items-center space-x-1.5 px-4"&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&lt;/span&gt;
        &lt;span class="nt"&gt;&amp;lt;span&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"w-3 h-3 border-2 border-transparent dark:border-red-400 rounded-full bg-red-400 dark:bg-transparent "&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&amp;lt;/span&amp;gt;&lt;/span&gt;
        &lt;span class="nt"&gt;&amp;lt;span&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"w-3 h-3 border-2 border-transparent dark:border-yellow-400 rounded-full bg-yellow-400 dark:bg-transparent"&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&amp;lt;/span&amp;gt;&lt;/span&gt;
        &lt;span class="nt"&gt;&amp;lt;span&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"w-3 h-3 border-2 border-transparent dark:border-green-400 rounded-full bg-green-400 dark:bg-transparent"&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&amp;lt;/span&amp;gt;&lt;/span&gt;
    &lt;span class="nt"&gt;&amp;lt;/div&amp;gt;&lt;/span&gt;
    &lt;span class="nt"&gt;&amp;lt;div&lt;/span&gt; &lt;span class="na"&gt;class=&lt;/span&gt;&lt;span class="s"&gt;"bg-gray-100 dark:bg-gray-700 border-t-0 w-full h-96 rounded-b-lg"&lt;/span&gt;&lt;span class="nt"&gt;&amp;gt;&amp;lt;/div&amp;gt;&lt;/span&gt;
&lt;span class="nt"&gt;&amp;lt;/div&amp;gt;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  &lt;strong&gt;Thank You&lt;/strong&gt; ❤️
&lt;/h2&gt;

&lt;p&gt;I wish my posts to be useful to anyone who's new to the world of web development, programming, or anybody who's curious 🧐!&lt;/p&gt;

&lt;p&gt;If you find the content useful to you, please comment your thoughts, I would love to learn from you all.&lt;/p&gt;

&lt;p&gt;Thank you for your loving directions.&lt;/p&gt;

</description>
      <category>css</category>
      <category>html</category>
      <category>webdev</category>
      <category>tailwindcss</category>
    </item>
    <item>
      <title>Laravel Or Ruby on Rails 2021?</title>
      <dc:creator>Farhad</dc:creator>
      <pubDate>Sat, 26 Dec 2020 18:40:08 +0000</pubDate>
      <link>https://dev.to/feriun/laravel-or-ruby-on-rails-2021-3e2b</link>
      <guid>https://dev.to/feriun/laravel-or-ruby-on-rails-2021-3e2b</guid>
      <description>&lt;p&gt;Hey everyone,&lt;br&gt;
I would like to know which framework will you choose for 2021 I have no exp with ruby and ruby on rails, I am amazed 🤩 by ruby's syntax but I kinda feel Laravel is more modern and popular. so, can you please inform me about its capabilities comparing with Laravel. Thanks, 🙏&lt;/p&gt;

</description>
      <category>help</category>
    </item>
  </channel>
</rss>
