Update README.md

Devinterview-io · web-flow · commit 7f161494d9b2 · 2021-01-24T13:23:02.000+05:00
diff --git a/README.md b/README.md
@@ -1 +1,23 @@
-# greedy-algorithms-interview-questions
+<div data-v-5e9078c0="" data-v-b06dc010="" class="QuestionsList"><div data-v-5e9078c0=""><h1 data-v-5e9078c0="">
+      Top 7 Greedy Algorithms interview
+      questions and answers in 2021.
+    </h1> <p data-v-5e9078c0="" align="center"><a data-v-5e9078c0="" href="https://devinterview.io/"><img data-v-5e9078c0="" src="https://source.unsplash.com/collection/52661698/700x350"></a></p> <p data-v-5e9078c0="">
+      You can check all
+      7
+      Greedy Algorithms interview questions here 👉
+      https://devinterview.io/data/greedyAlgorithms-interview-questions
+    </p> <br data-v-5e9078c0=""> <div data-v-5e9078c0="" class="unit"><div><h2>🔹 1. What is a Greedy Algorithm?</h2></div> <div><h3>Answer:</h3> <div class="answer"><div><div><div class="AnswerBody"><p>We call algorithms <em>greedy</em> when they utilise the greedy property. The greedy property is:</p><blockquote><p>At that exact moment in time, what is the optimal choice to make?</p></blockquote><p>Greedy algorithms are <em>greedy</em>. They do not look into the future to decide the global optimal solution. They are only concerned with the optimal solution <em>locally</em>. This means that <strong>the overall optimal solution may differ from the solution the greedy algorithm chooses.</strong></p><p>They never look backwards at what they've done to see if they could optimise globally. This is the main difference between Greedy Algorithms and Dynamic Programming.</p></div></div><div class="row my-2"><div><span><i>Source:</i>&nbsp;<span><a href="https://skerritt.blog/greedy-algorithms/" rel="noreferrer" target="_blank" title="What is a Greedy Algorithm? Interview Questions Source To Answer">skerritt.blog</a></span></span>&nbsp; &nbsp;</div></div></div></div></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 2. What Are Greedy Algorithms Used For?</h2></div> <div><h3>Answer:</h3> <div class="answer"><div><div><div class="AnswerBody"><p>Greedy algorithms are quick. A lot faster than the two other alternatives (Divide &amp; Conquer, and Dynamic Programming). They're used because they're fast. Sometimes, Greedy algorithms give the global optimal solution every time. Some of these algorithms are:</p><ul><li>Dijkstra's Algorithm</li><li>Kruskal's algorithm</li><li>Prim's algorithm</li><li>Huffman trees</li></ul><p>These algorithms are Greedy, and their Greedy solution gives the optimal solution.</p></div></div><div class="row my-2"><div><span><i>Source:</i>&nbsp;<span><a href="https://skerritt.blog/" rel="noreferrer" target="_blank" title="What Are Greedy Algorithms Used For? Interview Questions Source To Answer">skerritt.blog</a></span></span>&nbsp; &nbsp;</div></div></div></div></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 3. What is the difference between Dynamic Programming and Greedy Algorithms?</h2></div> <div>
+    👉🏼 Check
+    <a href="https://devinterview.io/data/greedyAlgorithms-interview-questions">all 7 answers</a></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 4. What's the difference between Greedy and Heuristic algorithm?</h2></div> <div>
+    👉🏼 Check
+    <a href="https://devinterview.io/data/greedyAlgorithms-interview-questions">all 7 answers</a></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 5. Compare Greedy vs Divide &amp; Conquer vs Dynamic Programming Algorithms</h2></div> <div>
+    👉🏼 Check
+    <a href="https://devinterview.io/data/greedyAlgorithms-interview-questions">all 7 answers</a></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 6. Is Dijkstra's algorithm a Greedy or Dynamic Programming algorithm?</h2></div> <div>
+    👉🏼 Check
+    <a href="https://devinterview.io/data/greedyAlgorithms-interview-questions">all 7 answers</a></div> <br><br></div><div data-v-5e9078c0="" class="unit"><div><h2>🔹 7. Are there any proof to decide if Greedy approach will produce the best solution?</h2></div> <div>
+    👉🏼 Check
+    <a href="https://devinterview.io/data/greedyAlgorithms-interview-questions">all 7 answers</a></div> <br><br></div> <div data-v-5e9078c0="" class="end"></div> <br data-v-5e9078c0="">
+    Thanks 🙌 for reading and good luck on your next tech interview!
+    <br data-v-5e9078c0="">
+    Explore 3800+ dev interview question here 👉
+    <a data-v-5e9078c0="" href="https://devinterview.io/">Devinterview.io</a></div> <!----></div>
