trackler 2.2.1.25 → 2.2.1.26

data/tracks/csharp/exercises/tree-building/TreeBuilding.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/triangle/Triangle.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/twelve-days/TwelveDays.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/two-bucket/TwoBucket.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/two-fer/TwoFer.csproj

@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/variable-length-quantity/VariableLengthQuantity.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/word-count/WordCount.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/word-search/WordSearch.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/wordy/Wordy.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/zebra-puzzle/ZebraPuzzle.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/exercises/zipper/Zipper.csproj

@@ -2,7 +2,7 @@
 
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.0</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
 
   <ItemGroup>
@@ -10,7 +10,7 @@
   </ItemGroup>
 
   <ItemGroup>
-    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.0.0" />
+    <PackageReference Include="Microsoft.NET.Test.Sdk" Version="15.3.0" />
     <PackageReference Include="xunit" Version="2.2.0" />
     <PackageReference Include="xunit.runner.visualstudio" Version="2.2.0" />
   </ItemGroup>

data/tracks/csharp/generators/Generators.csproj

@@ -1,16 +1,16 @@
 <Project Sdk="Microsoft.NET.Sdk">
   <PropertyGroup>
     <OutputType>Exe</OutputType>
-    <TargetFramework>netcoreapp1.1</TargetFramework>
+    <TargetFramework>netcoreapp2.0</TargetFramework>
   </PropertyGroup>
   <ItemGroup>
     <PackageReference Include="CommandLineParser" Version="2.1.1-beta" />
-    <PackageReference Include="DotLiquid" Version="2.0.145" />
+    <PackageReference Include="DotLiquid" Version="2.0.180" />
     <PackageReference Include="Humanizer" Version="2.2.0" />
     <PackageReference Include="LibGit2Sharp.Portable" Version="0.24.10" />
     <PackageReference Include="Newtonsoft.Json" Version="10.0.3" />
-    <PackageReference Include="serilog" Version="2.4.0" />
-    <PackageReference Include="serilog.sinks.literate" Version="2.1.0" />
+    <PackageReference Include="serilog" Version="2.5.0" />
+    <PackageReference Include="serilog.sinks.literate" Version="3.0.0" />
   </ItemGroup>
   <ItemGroup>
     <EmbeddedResource Include="Output\Templates\*.liquid" />

data/tracks/ecmascript/exercises/simple-cipher/simple-cipher.spec.js

@@ -76,4 +76,9 @@ describe('Substitution cipher', () => {
   xtest('can wrap on decode', () => {
     expect(cipher.decode('zabcdefghi')).toEqual('zzzzzzzzzz');
   });
+
+  xtest('can handle messages longer than the key', function() {
+    expect(new Cipher('abc').encode('iamapandabear'))
+      .toEqual('iboaqcnecbfcr');
+  });
 });

data/tracks/elixir/config.json

@@ -568,6 +568,17 @@
 
       ]
     },
+    {
+      "uuid": "77fe5eb6-a35b-4af4-9512-275f140c25d6",
+      "slug": "binary-search-tree",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
+      "topics": [
+        "algorithms",
+        "trees"
+      ]
+    },
     {
       "uuid": "47328272-b2f6-42e4-a5a3-a5d276bfbdee",
       "slug": "prime-factors",

data/tracks/elixir/exercises/binary-search-tree/README.md

@@ -0,0 +1,52 @@
+Insert and search for numbers in a binary tree.
+
+When we need to represent sorted data, an array does not make a good
+data structure.
+
+Say we have the array `[1, 3, 4, 5]`, and we add 2 to it so it becomes
+`[1, 3, 4, 5, 2]` now we must sort the entire array again! We can
+improve on this by realizing that we only need to make space for the new
+item `[1, nil, 3, 4, 5]`, and then adding the item in the space we
+added. But this still requires us to shift many elements down by one.
+
+Binary Search Trees, however, can operate on sorted data much more
+efficiently.
+
+A binary search tree consists of a series of connected nodes. Each node
+contains a piece of data (e.g. the number 3), a variable named `left`,
+and a variable named `right`. The `left` and `right` variables point at
+`nil`, or other nodes. Since these other nodes in turn have other nodes
+beneath them, we say that the left and right variables are pointing at
+subtrees. All data in the left subtree is less than or equal to the
+current node's data, and all data in the right subtree is greater than
+the current node's data.
+
+For example, if we had a node containing the data 4, and we added the
+data 2, our tree would look like this:
+
+      4
+     /
+    2
+
+If we then added 6, it would look like this:
+
+      4
+     / \
+    2   6
+
+If we then added 3, it would look like this
+
+       4
+     /   \
+    2     6
+     \
+      3
+
+And if we then added 1, 5, and 7, it would look like this
+
+          4
+        /   \
+       /     \
+      2       6
+     / \     / \
+    1   3   5   7

data/tracks/elixir/exercises/binary-search-tree/binary_search_tree.exs

@@ -0,0 +1,27 @@
+defmodule BinarySearchTree do
+  @type bst_node :: %{data: any, left: bst_node | nil, right: bst_node | nil}
+
+  @doc """
+  Create a new Binary Search Tree with root's value as the given 'data'
+  """
+  @spec new(any) :: bst_node
+  def new(data) do
+    # Your implementation here
+  end
+
+  @doc """
+  Creates and inserts a node with its value as 'data' into the tree.
+  """
+  @spec insert(bst_node, any) :: bst_node
+  def insert(tree, data) do
+    # Your implementation here
+  end
+
+  @doc """
+  Traverses the Binary Search Tree in order and returns a list of each node's data.
+  """
+  @spec in_order(bst_node) :: [any]
+  def in_order(tree) do
+    # Your implementation here
+  end
+end

data/tracks/elixir/exercises/binary-search-tree/binary_search_tree_test.exs

@@ -0,0 +1,103 @@
+if !System.get_env("EXERCISM_TEST_EXAMPLES") do
+  Code.load_file("binary_search_tree.exs", __DIR__)
+end
+
+ExUnit.start
+ExUnit.configure exclude: :pending, trace: true
+
+defmodule BinarySearchTreeTest do
+  use ExUnit.Case
+
+  test "retains data" do
+    assert BinarySearchTree.new(4).data == 4
+  end
+
+  @tag :pending
+  test "inserting lower number" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(2)
+
+    assert root.data == 4
+    assert root.left.data == 2
+  end
+
+  @tag :pending
+  test "inserting same number" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(4)
+
+    assert root.data == 4
+    assert root.left.data == 4
+  end
+
+  @tag :pending
+  test "inserting higher number" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(5)
+
+    assert root.data == 4
+    assert root.right.data == 5
+  end
+
+  @tag :pending
+  test "complex tree" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(2)
+      |> BinarySearchTree.insert(6)
+      |> BinarySearchTree.insert(1)
+      |> BinarySearchTree.insert(3)
+      |> BinarySearchTree.insert(7)
+      |> BinarySearchTree.insert(5)
+
+    assert root.data == 4
+    assert root.left.data == 2
+    assert root.left.left.data == 1
+    assert root.left.right.data == 3
+    assert root.right.data == 6
+    assert root.right.left.data == 5
+    assert root.right.right.data == 7
+  end
+
+  @tag :pending
+  test "iterating one element" do
+    root = BinarySearchTree.new(4)
+
+    assert [4] == BinarySearchTree.in_order(root)
+  end
+
+  @tag :pending
+  test "iterating over smaller element" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(2)
+
+    assert [2, 4] == BinarySearchTree.in_order(root)
+  end
+
+  @tag :pending
+  test "iterating over larger element" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(5)
+
+    assert [4, 5] == BinarySearchTree.in_order(root)
+  end
+
+  @tag :pending
+  test "iterating over complex tree" do
+    root =
+      BinarySearchTree.new(4)
+      |> BinarySearchTree.insert(2)
+      |> BinarySearchTree.insert(1)
+      |> BinarySearchTree.insert(3)
+      |> BinarySearchTree.insert(6)
+      |> BinarySearchTree.insert(7)
+      |> BinarySearchTree.insert(5)
+
+    assert [1, 2, 3, 4, 5, 6, 7] == BinarySearchTree.in_order(root)
+  end
+end

data/tracks/elixir/exercises/binary-search-tree/example.exs

@@ -0,0 +1,29 @@
+defmodule BinarySearchTree do
+  def new(data) do
+    %{data: data, left: nil, right: nil}
+  end
+
+  def insert(nil, node_value), do: new(node_value)
+
+  def insert(%{data: data, left: left, right: right}, node_value) do
+    if node_value <= data do
+      %{data: data, left: insert(left, node_value), right: right}
+    else
+      %{data: data, left: left, right: insert(right, node_value)}
+    end
+  end
+
+  def in_order(tree) do
+    in_order(tree, []) |> Enum.reverse
+  end
+
+  def in_order(nil, accum) do
+    accum
+  end
+
+  def in_order(tree, accum) do
+    left_side = in_order(tree.left, accum)
+    middle = [tree.data | left_side]
+    in_order(tree.right, middle)
+  end
+end