add tasks description

Author: proton

week5/balanced-search-trees/interview-questions/task1/TASK.md

@@ -0,0 +1,3 @@
+### Red–black BST with no extra memory
+
+Describe how to save the memory for storing the color information when implementing a red–black BST

week5/balanced-search-trees/interview-questions/task2/TASK.md

@@ -0,0 +1,3 @@
+### Document search
+
+Design an algorithm that takes a sequence of `n` document words and a sequence of `m` query words and find the shortest interval in which the `m` query words appear in the document in the order given. The length of an interval is the number of words in that interval.

week5/balanced-search-trees/interview-questions/task2/solution.rb

@@ -0,0 +1,9 @@
+# Design a generalized queue data type that supports all of the following operations in logarithmic time (or better) in the worst case.
+
+# - Create an empty data structure.
+# - Append an item to the end of the queue.
+# - Remove an item from the front of the queue.
+# - Return the `i`th item in the queue.
+# - Remove the `i`th item from the queue.
+
+# TODO: Implement

week5/balanced-search-trees/interview-questions/task3/TASK.md

@@ -0,0 +1,9 @@
+### Generalized queue
+
+Design a generalized queue data type that supports all of the following operations in logarithmic time (or better) in the worst case.
+
+- Create an empty data structure.
+- Append an item to the end of the queue.
+- Remove an item from the front of the queue.
+- Return the `i`th item in the queue.
+- Remove the `i`th item from the queue.

week5/balanced-search-trees/interview-questions/task3/solution.rb

@@ -0,0 +1,5 @@
+# Design an algorithm that takes a sequence of `n` document words and a sequence of `m` query words and find the shortest interval in which the `m` query words appear in the document in the order given. The length of an interval is the number of words in that interval.
+
+def algorithm(document_words, query_words)
+  # TODO: Implement the algorithm
+end