chore: placeholder for exercises

book/content/part04/divide-and-conquer.asc

@@ -66,15 +66,15 @@ graph G {
     "fib(2)**" -- { "fib(1)****", "fib(0)**" }
 
     // red colors
-    "fib(0)*" [color="#FF5252"];
-    "fib(0)**" [color="#FF5252"];
-    "fib(1)*" [color="#FF5252"];
-    "fib(1)**" [color="#FF5252"];
-    "fib(1)***" [color="#FF5252"];
-    "fib(1)****" [color="#FF5252"];
-    "fib(2)*" [color="#FF5252"];
-    "fib(2)**" [color="#FF5252"];
-    "fib(3)*" [color="#FF5252"];
+    "fib(0)*" [color="#FF5252" label="fib(0)"];
+    "fib(0)**" [color="#FF5252" label="fib(0)"];
+    "fib(1)*" [color="#FF5252" label="fib(1)"];
+    "fib(1)**" [color="#FF5252" label="fib(1)"];
+    "fib(1)***" [color="#FF5252" label="fib(1)"];
+    "fib(1)****" [color="#FF5252" label="fib(1)"];
+    "fib(2)*" [color="#FF5252" label="fib(2)"];
+    "fib(2)**" [color="#FF5252" label="fib(2)"];
+    "fib(3)*" [color="#FF5252" label="fib(3)"];
 }
 ....
 
@@ -94,3 +94,75 @@ Those who cannot remember the past are condemned to repeat it.
 For these cases when subproblems repeat themselves, we can optimize them using <<Dynamic Programming, dynamic programming>>. Let's do that in the next section.
 
 
+
+
+
+
+
+// But before doing dynamic programming. Let's do this divide and conquer exercises.
+
+// ==== Practice Questions
+// (((Interview Questions, Divide and Conquer)))
+
+
+
+
+
+// // https://leetcode.com/problems/merge-k-sorted-lists/
+
+// // tag::divide-and-conquer-q-FILENAME[]
+// ===== TITLE
+
+// *DC-1*) _._
+
+// // end::divide-and-conquer-q-FILENAME[]
+
+// // _Seen in interviews at: X._
+
+// *Starter code*:
+
+// [source, javascript]
+// ----
+// include::../../interview-questions/FILENAME.js[tags=description;placeholder]
+// ----
+
+// *Examples*:
+
+// [source, javascript]
+// ----
+// FN([]); // 3 (EXPLANATION)
+// ----
+
+
+// _Solution: <<divide-and-conquer-q-FILENAME>>_
+
+
+
+
+// // https://leetcode.com/problems/search-a-2d-matrix-ii/
+
+// // tag::divide-and-conquer-q-FILENAME[]
+// ===== TITLE
+
+// *DC-2*) _._
+
+// // end::divide-and-conquer-q-FILENAME[]
+
+// // _Seen in interviews at: X._
+
+// *Starter code*:
+
+// [source, javascript]
+// ----
+// include::../../interview-questions/FILENAME.js[tags=description;placeholder]
+// ----
+
+// *Examples*:
+
+// [source, javascript]
+// ----
+// FN([]); // 3 (EXPLANATION)
+// ----
+
+
+// _Solution: <<divide-and-conquer-q-FILENAME>>_