Hiring test solution

.editorconfig

@@ -0,0 +1,9 @@
+[*]
+charset = utf-8
+end_of_line = lf
+insert_final_newline = true
+trim_trailing_whitespace = true
+
+[*.js]
+indent_style = space
+indent_size = 2

.gitignore

@@ -0,0 +1,4 @@
+node_modules
+
+# Serverless directories
+.serverless

README.md

@@ -1,2 +1,27 @@
-# hiring-tests
-This repo is designated to our hiring tests.
+# Queue Message Array Challenge
+
+## Problem:
+John receives a message with 2 arrays in his queue, filled with integer elements.
+John needs a function that receives only 2 arrays (arr1, arr2) from queue and returns only the elemens that are in both arrays asc sorted.
+
+Example payload : {[3, 5, 6, 1, 2, 16], [16, 6, 91, 1, 4, 3, 123, 1, 1]}
+
+Example response: 1, 3, 6, 16
+
+## Write rules:
+- Javascript, typescript or elixir
+
+## What we are judging:
+- Programming Logic
+- Unit Tests
+- Deploy flow
+- Performance
+- Organization & Cleanliness
+- Documentation
+
+## What can I use:
+Serverless Framework with NodeJS, Phoenix with Elixir, Docker for deploy start.
+Any framework, libs for unit tests.
+
+## How to submit:
+Fork this repo and implement your solution. Then send us a pull request to this branch with your code.

handler.js

@@ -0,0 +1,11 @@
+'use strict'
+
+const { recursiveIntersect } = require('./src/algorithms/intersection')
+const { sortAscending } = require('./src/algorithms/sorting')
+
+module.exports.intersectAndAscending = async event => {
+  return {
+    statusCode: 200,
+    body: sortAscending(recursiveIntersect(...event))
+  }
+}