<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Quiz on Michele Bologna</title>
    <link>https://www.michelebologna.net/tags/quiz/</link>
    <description>Recent content in Quiz on Michele Bologna</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Tue, 02 Feb 2016 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.michelebologna.net/tags/quiz/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Spotify puzzles: round two</title>
      <link>https://www.michelebologna.net/2016/spotify-puzzles-round-two/</link>
      <pubDate>Tue, 02 Feb 2016 00:00:00 +0000</pubDate>
      <guid>https://www.michelebologna.net/2016/spotify-puzzles-round-two/</guid>
      <description>&lt;p&gt;Some months ago, &lt;a href=&#34;https://www.michelebologna.net/2015/05/spotify-puzzles-round-one/&#34;  class=&#34;external-link&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;I began challenging myself with &lt;strong&gt;Spotify puzzles&lt;/strong&gt;&lt;/a&gt;: at that time I was dealing with an easy problem; now, the difficulty has increased. The round two consists in the typical &amp;ldquo;&lt;em&gt;&lt;a href=&#34;https://en.wikipedia.org/wiki/Selection_algorithm&#34;  class=&#34;external-link&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Selection problem&lt;/a&gt;&lt;/em&gt;&amp;rdquo;: given an array of values, find the max (or min) &lt;code&gt;k&lt;/code&gt; values. I decided to still use Python and to use its &lt;strong&gt;heapq&lt;/strong&gt; module to store values in a binary max-heap data structure, and then remove exactly &lt;code&gt;k&lt;/code&gt; values from the top of the heap. This approach will guarantee that the total time complexity of the algorithm will be &lt;code&gt;O(n log k)&lt;/code&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Javascript Scope Quiz</title>
      <link>https://www.michelebologna.net/2012/javascript-scope-quiz/</link>
      <pubDate>Wed, 05 Sep 2012 00:00:00 +0000</pubDate>
      <guid>https://www.michelebologna.net/2012/javascript-scope-quiz/</guid>
      <description>&lt;p&gt;Se vi state cimentando nell&amp;rsquo;apprendimento di &lt;a href=&#34;https://en.wikipedia.org/wiki/Javascript&#34;  class=&#34;external-link&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Javascript&lt;/a&gt;, vi segnalo l&amp;rsquo;interessante &lt;strong&gt;&lt;a href=&#34;https://web.archive.org/web/20190131122423/http://madebyknight.com:80/javascript-scope/&#34;  class=&#34;external-link&#34; target=&#34;_blank&#34; rel=&#34;noopener&#34;&gt;Javascript Scope Quiz&lt;/a&gt;&lt;/strong&gt;, che vi metterà alla prova sugli &lt;em&gt;scope&lt;/em&gt; delle variabili. Il quiz non è difficile, ma vi aiuta a capire le particolarità di Javascript per quanto riguarda gli scope, come questa domanda:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
