Inject exported images into challenge readmes

Author: rdtsc

Diff for: easy/180-knight-moves/assets/fig-1.png

@@ -8,6 +8,10 @@
     horizontally and one square vertically:
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     Your task is to find all possible positions for the next move of the knight on the empty chessboard.
 </p>
@@ -49,4 +53,4 @@ a3 c3 d2</pre>
 <h3>Constraints:</h3>
 <ul>
 <li>The number of test cases is 40.</li>
-</ul>
+</ul>

Diff for: easy/180-knight-moves/readme.md

@@ -9,10 +9,18 @@
 
 <p>For example:</p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     Also, the details may have cavities (or other complex structures). Please see example below (the detail Y is one detail):
 </p>
 
+<p>
+  <img src="assets/fig-2.png" alt="Figure 2">
+</p>
+
 <p>
     The detail Y starts moving left (without any turn) until it bumps into the X detail at least with one cell.
     Determine by how many cells the detail Y will be moved.
@@ -48,4 +56,4 @@ XXYY,X..Y,XX.Y</pre>
 <ol>
 <li>The matrices can be of different M*N sizes. (2 &lt;= M &lt;= 10, 2 &lt;= N &lt;= 10)</li>
 <li>Number of test cases is 40.</li>
-</ol>
+</ol>

Diff for: easy/183-details/assets/fig-1.png

@@ -14,6 +14,10 @@
     You need to determine and print the highest score of each category in the table.
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <h3>Input sample:</h3>
 
 <p>
@@ -50,4 +54,4 @@
 <li>The number of categories can be from 4 to 20.</li>
 <li>The number of points for one picture can be from -1000 to 1000.</li>
 <li>The number of test cases is 40.</li>
-</ol>
+</ol>

Diff for: easy/183-details/assets/fig-2.png

@@ -12,6 +12,10 @@
 
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <h3>Input sample:</h3>
 
 <p>
@@ -35,4 +39,4 @@ Real</pre>
 <ol>
 <li>The credit card number is 16 digits in length.</li>
 <li>The number of test cases is 40.</li>
-</ol>
+</ol>

Diff for: easy/183-details/readme.md

@@ -1,9 +1,11 @@
 <h2>Commuting Engineer</h2>
 
-<div id="map-canvas"></div>
-
-<br>
 <h3>Challenge Description:</h3>
+
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     Commuters in the bay area who commute to and from South Bay spend
     on average 2-3 hours of valuable time getting to and from work every day.
@@ -74,65 +76,3 @@
     New Relic or Glassdoor, you&apos;ll be able to apply directly after submitting
     your solution. Let&apos;s see if it cuts down your work commute!
 </p>
-
-<script type="text/javascript" src="https://maps.googleapis.com/maps/api/js?key=AIzaSyATY9ALwgMNKu3ggL8aJlHy09qiNZaNcIA&amp;sensor=false"></script>
-<script type="text/javascript" src="https://google-maps-utility-library-v3.googlecode.com/svn/tags/markerwithlabel/1.1.8/src/markerwithlabel.js"></script>
-<script type="text/javascript">
-var google_map;
-var google_map_center = new google.maps.LatLng(37.780145, -122.402544);
-function initialize() {
-    var mapDiv = document.getElementById('map-canvas');
-    google_map = new google.maps.Map(mapDiv, {
-        center: google_map_center,
-        zoom: 14,
-        mapTypeId: google.maps.MapTypeId.ROADMAP
-    });
-}
-
-$(function() {
-    initialize();
-
-    var sf_coords_str = "1 | CodeEval 1355 Market St, SF (37.7768016, -122.4169151)\n\
-2 | Yelp 706 Mission St, SF (37.7860105, -122.4025377)\n\
-3 | Square 110 5th St, SF (37.7821494, -122.4058960)\n\
-4 | Airbnb 99 Rhode Island St, SF (37.7689269, -122.4029053)\n\
-5 | Dropbox 185 Berry St, SF (37.7768800, -122.3911496)\n\
-6 | Zynga 699 8th St, SF (37.7706628, -122.4040139)\n\
-7 | Mashery 717 Market St, SF (37.7870361, -122.4039444)\n\
-8 | Flurry 3060 3rd St, SF (37.7507903, -122.3877184)\n\
-9 | New Relic 188 Spear St, SF (37.7914417, -122.3927229)\n\
-10 | Glassdoor 1 Harbor Drive, Sausalito (37.8672841, -122.5010216)";
-
-    var sf_coords = [];
-    var markers = {};
-    var lines = [];
-
-    sf_coords_str_lines = sf_coords_str.split("\n");
-    for (i = 0; i < sf_coords_str_lines.length; i++){
-        var matches = sf_coords_str_lines[i].match(/(\d+) .*?\((\-*\d+\.*\d*),\s*(\-*\d+\.*\d*)\)/);
-        sf_coords.push([parseInt(matches[1]), parseFloat(matches[2]), parseFloat(matches[3])]);
-    }
-    for (i = 0; i < sf_coords.length; i++){
-        var point_name = "" + sf_coords[i][0];
-        markers[point_name] = new MarkerWithLabel({
-            position: new google.maps.LatLng(sf_coords[i][1], sf_coords[i][2]),
-            map: google_map,
-            labelContent: point_name
-//            labelClass: "labels", // the CSS class for the label
-//            labelStyle: {opacity: 0.75}
-        });
-    }
-    var right_order = ["1", "3", "2", "5", "6", "4"];
-    for (i = 0; i < right_order.length - 1; i++){
-        var line = new google.maps.Polyline({
-            path: new Array(markers[right_order[i]].getPosition(),markers[right_order[i+1]].getPosition()),
-            strokeColor: '#ff0000',
-            strokeOpacity: 1.0,
-            strokeWeight: 2
-        });
-        line.setMap(google_map);
-    }
-
-});
-
-</script>

Diff for: easy/208-find-the-highest-score/assets/fig-1.png

@@ -1,23 +1,24 @@
 <h2>Bay Bridges</h2>
 
-<div id="map-canvas"></div>
-
-<br>
 <h3>Challenge Description:</h3>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     A new technological breakthrough has enabled us to build bridges that can
     withstand a 9.5 magnitude earthquake for a fraction of the cost. Instead of
     retrofitting existing bridges which would take decades and cost at least
     3x the price we&apos;re drafting up a proposal rebuild all of the bay area&apos;s
-    bridges more efficiently between strategic coordinates outlined below. 
+    bridges more efficiently between strategic coordinates outlined below.
 </p>
 
 <p>
     You want to build the bridges as efficiently as possible and connect as many
     pairs of points as possible with bridges such that no two bridges cross.
     When connecting points, you can only connect point 1 with another point 1,
-    point 2 with another point 2. 
+    point 2 with another point 2.
 </p>
 
 <p>
@@ -53,64 +54,3 @@
 <p>
     (Check lines on the map)
 </p>
-
-<script type="text/javascript" src="https://maps.googleapis.com/maps/api/js?key=AIzaSyATY9ALwgMNKu3ggL8aJlHy09qiNZaNcIA&amp;sensor=false"></script>
-<script type="text/javascript" src="https://google-maps-utility-library-v3.googlecode.com/svn/tags/markerwithlabel/1.1.8/src/markerwithlabel.js"></script>
-<script type="text/javascript">
-var google_map;
-var google_map_center = new google.maps.LatLng(37.640879, -122.25174);
-function initialize() {
-    var mapDiv = document.getElementById('map-canvas');
-    google_map = new google.maps.Map(mapDiv, {
-        center: google_map_center,
-        zoom: 10,
-        mapTypeId: google.maps.MapTypeId.ROADMAP
-    });
-}
-
-$(function() {
-    initialize();
-
-    var sf_coords_str = "1: ([37.788353, -122.387695], [37.829853, -122.294312])\n\
-2: ([37.429615, -122.087631], [37.487391, -122.018967])\n\
-3: ([37.474858, -122.131577], [37.529332, -122.056046])\n\
-4: ([37.532599,-122.218094], [37.615863,-122.097244])\n\
-5: ([37.516262,-122.198181], [37.653383,-122.151489])\n\
-6: ([37.504824,-122.181702], [37.633266,-122.121964])";
-
-    var sf_coords = [];
-    var markers = {};
-    var lines = [];
-
-    sf_coords_str_lines = sf_coords_str.split("\n");
-    for (i = 0; i < sf_coords_str_lines.length; i++){
-        var matches = sf_coords_str_lines[i].match(/(\d+)\:\s*\(\[(\-*\d+\.*\d*),\s*(\-*\d+\.*\d*)\],\s*\[(\-*\d+\.*\d*),\s*(\-*\d+\.*\d*)\]\)/);
-        sf_coords.push([parseInt(matches[1]), parseFloat(matches[2]), parseFloat(matches[3]), parseFloat(matches[4]), parseFloat(matches[5])]);
-    }
-    for (i = 0; i < sf_coords.length; i++){
-        var point_name = "" + sf_coords[i][0];
-        markers[point_name + "1"] = new MarkerWithLabel({
-            position: new google.maps.LatLng(sf_coords[i][1], sf_coords[i][2]),
-            map: google_map,
-            labelContent: point_name
-        });
-        markers[point_name + "2"] = new MarkerWithLabel({
-            position: new google.maps.LatLng(sf_coords[i][3], sf_coords[i][4]),
-            map: google_map,
-            labelContent: point_name
-        });
-    }
-    //var right_order = ["1", "5", "2", "3", "4"];
-    for (i = 0; i < sf_coords.length; i++){
-        var line = new google.maps.Polyline({
-            path: new Array(markers[sf_coords[i][0] + "1"].getPosition(),markers[sf_coords[i][0] + "2"].getPosition()),
-            strokeColor: (i != 3)?'#ff0000':'#0000ff',
-            strokeOpacity: 1.0,
-            strokeWeight: 2
-        });
-        line.setMap(google_map);
-    }
-
-});
-
-</script>

Diff for: easy/208-find-the-highest-score/readme.md

@@ -7,10 +7,16 @@
     right coordinates of the building and H is the height of the building.
     All buildings are rectangular in shape and they are standing on a very flat surface. E.g.
 <br>
+<br>
+
+    <img src="assets/fig-1.png" alt="Figure 1">
 
 <br>
 
+    <img src="assets/fig-2.png" alt="Figure 2">
+
 <br>
+
     On the first diagram the buildings are represented by the following triples:
 </p>
 <pre>(1,2,3); (2,4,6); (4,5,5); (7,3,11); (9,2,14); (13,7,15); (14,3,17)</pre>
@@ -45,4 +51,4 @@
     Constraints:
 <br>
     H in range (1, 100),  max(x-coordinate) &lt;= 10000, number of buildings &lt;= 1000
-</p>
+</p>

Diff for: easy/227-real-fake/assets/fig-1.png

@@ -13,6 +13,10 @@ You need to replace the IP source and destination IP address to the new addresse
 This means you should calculate checksum of IP header.
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <h3>Input sample:</h3>
 <p>
 Your program should accept as its first argument a path to a filename.
@@ -27,4 +31,4 @@ Each line contains new source ip address, new destination ip address and package
 For each line of input print out ip header with new destination and source ip address and valid checksum
 </p>
 
-<pre class="description-input-output">45 04 05 dc b7 3a 40 00 2e 06 11 cd be a8 00 60 be a8 00 60</pre>
+<pre class="description-input-output">45 04 05 dc b7 3a 40 00 2e 06 11 cd be a8 00 60 be a8 00 60</pre>

Diff for: easy/227-real-fake/readme.md

@@ -9,6 +9,10 @@
     the signal can move linearly up or down relative to zero level:
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     Your task is to find the frequency of each signal.
 
@@ -48,4 +52,4 @@
 <li>Signal amplitude is not lower than 20.</li>
 <li>Signal amplitude change and the move relative to zero level on the segment are linear and do not change
         their direction.</li>
-</ol>
+</ol>

Diff for: hard/090-commuting-engineer/assets/fig-1.png

@@ -11,6 +11,10 @@
     Example of a 5×5 matrix, where L=15:
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <h3>Input sample:</h3>
 
 <p>
@@ -45,4 +49,4 @@ bjzanjikh</pre>
 <ol>
 <li>N is in a range from 2 to 6.</li>
 <li>The number of test cases is 20.</li>
-</ol>
+</ol>

Diff for: hard/090-commuting-engineer/readme.md

@@ -11,6 +11,10 @@
 
 <p>For example:</p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     N is 2 in this graph.
 </p>
@@ -45,4 +49,4 @@
 <li>1 &lt;= V, E &lt;= 100</li>
 <li>0 &lt;= vertex &lt; V</li>
 <li>Number of test cases is 10.</li>
-</ol>
+</ol>

Diff for: hard/109-bay-bridges/assets/fig-1.png

@@ -21,6 +21,10 @@
     Example:
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <p>
     toggle lights as follows: row 1, column 4; row 2, column 3; row 2, column 4; and row 3, column 4
 </p>
@@ -57,4 +61,4 @@ all the lights turn off, or -1 if it is not possible.
 <h3>Constraints:</h3>
 <ol>
 <li>Number of test cases is equal to 20.</li>
-</ol>
+</ol>

Diff for: hard/109-bay-bridges/readme.md

@@ -10,6 +10,10 @@
     we can create two lines.
 </p>
 
+<p>
+    <img src="assets/fig-1.png" alt="Figure 1">
+</p>
+
 <h3>Input sample:</h3>
 
 <p>
@@ -47,4 +51,4 @@
 </li>
 <li>Point coordinates can be in a range from -20 to 20.</li>
 <li>The number of test cases is 40.</li>
-</ol>
+</ol>