Setting up repository, adding disclaimer about forks

Author: javierpedreira

.gitignore

@@ -0,0 +1,90 @@
+# Created by https://www.gitignore.io/api/scala,intellij,sbt
+
+### Floobits
+*.floo*
+
+### Scala ###
+*.class
+*.log
+
+# sbt specific
+.cache
+.history
+.lib/
+dist/*
+target/
+lib_managed/
+src_managed/
+project/boot/
+project/plugins/project/
+
+# Scala-IDE specific
+.scala_dependencies
+.worksheet
+
+
+### Intellij ###
+# Covers JetBrains IDEs: IntelliJ, RubyMine, PhpStorm, AppCode, PyCharm, CLion, Android Studio
+
+*.iml
+
+## Directory-based project format:
+.idea/
+# if you remove the above rule, at least ignore the following:
+
+# User-specific stuff:
+# .idea/workspace.xml
+# .idea/tasks.xml
+# .idea/dictionaries
+
+# Sensitive or high-churn files:
+# .idea/dataSources.ids
+# .idea/dataSources.xml
+# .idea/sqlDataSources.xml
+# .idea/dynamic.xml
+# .idea/uiDesigner.xml
+
+# Gradle:
+# .idea/gradle.xml
+# .idea/libraries
+
+# Mongo Explorer plugin:
+# .idea/mongoSettings.xml
+
+## File-based project format:
+*.ipr
+*.iws
+
+## Plugin-specific files:
+
+# IntelliJ
+/out/
+
+# mpeltonen/sbt-idea plugin
+.idea_modules/
+
+# JIRA plugin
+atlassian-ide-plugin.xml
+
+# Crashlytics plugin (for Android Studio and IntelliJ)
+com_crashlytics_export_strings.xml
+crashlytics.properties
+crashlytics-build.properties
+
+
+### SBT ###
+# Simple Build Tool
+# http://www.scala-sbt.org/release/docs/Getting-Started/Directories.html#configuring-version-control
+
+target/
+lib_managed/
+src_managed/
+project/boot/
+.history
+.cache
+
+#javascript section
+node_modules
+
+### Python ###
+**.pyc

LICENSE

@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 IntentHQ
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+

README.md

@@ -0,0 +1,13 @@
+# Intent HQ Code Challenges
+
+Home of the katas we sometimes use for our interview candidates.
+
+The challenges are available in:
+
+* Java
+* Scala
+* Python
+* Javascript
+
+See the `README.md` in the directory corresponding to each language for more
+information on running the challenges and their tests.

java_scala/README.md

@@ -0,0 +1,26 @@
+# Intent HQ Java/Scala Code Challenges
+
+If you are a candidate and are doing one (or more) of this small katas at home you may want to read this.
+
+There are different katas in the package `com.intenthq.challenge`, each of them consists of a single file: `SKataName` (if scala) or `JKataName` (if java).
+
+Each challenge comes with a set of tests written in specs2, you won't probably need to add any test, but in case you need to, you'll find documentation about the test framework in here: http://specs2.org/
+
+## How to start
+
+1. Read all the challenges and chose the one(s) you like best
+2. Download this folder or clone the repo **without creating a fork** and start working on it.
+3. Push your changes and send us the link to the github repo
+4. If you have any doubt while working on it just drop us an email and we'll help
+
+
+```
+To test your scala code:
+$ sbt testOnly -- include scala
+
+To test your java code:
+$ sbt testOnly -- include java
+
+To test a specific challenge:
+$ sbt testOnly -- include nice/graph -- exclude java/scala
+```

java_scala/build.sbt

@@ -0,0 +1,7 @@
+scalaVersion := "2.12.7"
+
+libraryDependencies ++= Seq(
+  "org.specs2" %% "specs2-core" % "4.3.5" % "test",
+  "com.google.guava" % "guava" % "27.0-jre"
+)
+

java_scala/project/build.properties

@@ -0,0 +1 @@
+sbt.version=1.6.1

java_scala/project/plugins.sbt

@@ -0,0 +1 @@
+addSbtPlugin("org.scoverage" % "sbt-scoverage" % "1.5.1")

java_scala/src/main/scala/com/intenthq/challenge/JConnectedGraph.java

@@ -0,0 +1,34 @@
+package com.intenthq.challenge;
+
+import java.util.Collections;
+import java.util.List;
+
+public class JConnectedGraph {
+  // Find if two nodes in a directed graph are connected.
+  // Based on http://www.codewars.com/kata/53897d3187c26d42ac00040d
+  // For example:
+  // a -+-> b -> c -> e
+  //    |
+  //    +-> d
+  // run(a, a) == true
+  // run(a, b) == true
+  // run(a, c) == true
+  // run(b, d) == false
+  public static boolean run(JNode source, JNode target) {
+    throw new RuntimeException("Not implemented");
+  }
+
+  public static class JNode {
+    public final int value;
+    public final List<JNode> edges;
+    public JNode(final int value, final List<JNode> edges) {
+      this.value = value;
+      this.edges = edges;
+    }
+    public JNode(final int value) {
+      this.value = value;
+      this.edges = Collections.emptyList();
+    }
+  }
+
+}

java_scala/src/main/scala/com/intenthq/challenge/JEnigma.java

@@ -0,0 +1,42 @@
+package com.intenthq.challenge;
+
+import java.util.List;
+import java.util.Map;
+
+public class JEnigma {
+
+  // We have a system to transfer information from one place to another. This system
+  // involves transferring only list of digits greater than 0 (1-9). In order to decipher
+  // the message encoded in the list you need to have a dictionary that will allow
+  // you to do it following a set of rules:
+  //    > Sample incoming message: (​1,2,3,7,3,2,3,7,2,3,4,8,9,7,8)
+  //    > Sample dictionary (​23->‘N’,234->‘ ’,89->‘H’,78->‘Q’,37 ->‘A’)
+  //  - Iterating from left to right, we try to match sublists to entries of the map.
+  //    A sublist is a sequence of one or more contiguous entries in the original list,
+  //    eg. the sublist (1, 2) would match an entry with key 12, while the sublist (3, 2, 3)
+  //    would match an entry with key 323.
+  //  - Whenever a sublist matches an entry of the map, it’s replaced by the entry value.
+  //    When that happens, the sublist is consumed, meaning that its elements can’t be used
+  //    for another match. The elements of the mapping however, can be used as many times as needed.
+  //  - If there are two possible sublist matches, starting at the same point, the longest one
+  //    has priority, eg 234 would have priority over 23.
+  //  - If a digit does not belong to any matching sublist, it’s output as is.
+  //
+  // Following the above rules, the message would be: “1N73N7 HQ”
+  // Check the tests for some other (simpler) examples.
+
+  private final Map<Integer, Character> map;
+
+  private JEnigma(final Map<Integer, Character> map) {
+    this.map = map;
+  }
+
+  public static JEnigma decipher(final Map<Integer, Character> map) {
+    return new JEnigma(map);
+  }
+
+  public String deciphe(List<Integer> message) {
+    throw new RuntimeException("Not implemented");
+  }
+
+}

java_scala/src/main/scala/com/intenthq/challenge/JNiceStrings.java

@@ -0,0 +1,29 @@
+package com.intenthq.challenge;
+
+import java.util.List;
+
+public class JNiceStrings {
+  // From http://adventofcode.com/day/5
+  //  --- Day 5: Doesn't He Have Intern-Elves For This? ---
+  //
+  //  Santa needs help figuring out which strings in his text file are naughty or nice.
+  //
+  //    A nice string is one with all of the following properties:
+  //
+  //    It contains at least three vowels (aeiou only), like aei, xazegov, or aeiouaeiouaeiou.
+  //  It contains at least one letter that appears twice in a row, like xx, abcdde (dd), or aabbccdd (aa, bb, cc, or dd).
+  //    It does not contain the strings ab, cd, pq, or xy, even if they are part of one of the other requirements.
+  //    For example:
+  //
+  //    ugknbfddgicrmopn is nice because it has at least three vowels (u...i...o...), a double letter (...dd...), and none of the disallowed substrings.
+  //  aaa is nice because it has at least three vowels and a double letter, even though the letters used by different rules overlap.
+  //    jchzalrnumimnmhp is naughty because it has no double letter.
+  //    haegwjzuvuyypxyu is naughty because it contains the string xy.
+  //    dvszwmarrgswjxmb is naughty because it contains only one vowel.
+  //    How many strings are nice?
+
+  public static int nice(List<String> xs) {
+    throw new RuntimeException("Not implemented");
+  }
+
+}