From 67cf2b3c0e20d3d162eb9116fe5d37b3c499533d Mon Sep 17 00:00:00 2001
From: Bhanu Pratap Singh Rathore <bhanur05@gmail.com>
Date: Mon, 10 Dec 2018 12:33:04 +0530
Subject: [PATCH] feat(interview-prep): Porting Rosetta Problem: Sort Disjoint
 (#31105)

* feat(interview-prep): Porting Rosetta Problem: Sort Disjoint

* feat(interview-prep): Fixes

* feat(interview-prep): FIxed indent and solution

* Added whitespace to the tests
---
 .../rosetta-code/sort-disjoint-sublist.md     | 82 +++++++++++++++++++
 1 file changed, 82 insertions(+)
 create mode 100644 curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md

diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
new file mode 100644
index 0000000000..8d0a40dd65
--- /dev/null
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/sort-disjoint-sublist.md
@@ -0,0 +1,82 @@
+---
+id: 5a23c84252665b21eecc8000
+title: Sort disjoint sublist
+challengeType: 5
+---
+
+## Description
+<section id='description'>
+Given a list of values and a set of integer indices into that value list, the task is to sort the values at the given indices, but preserving the values at indices outside the set of those to be sorted.
+Make your function work with the following list of values and set of indices:
+<code> values: [7, <b>6</b>, 5, 4, 3, 2, <b>1</b>, <b>0</b>]</code>
+<code> indices(0-based): {6, 1, 7}</code>
+Where the correct result would be:
+<code>[7, <b>0</b>, 5, 4, 3, 2, <b>1</b>, <b>6</b>]</code>.
+</section>
+
+## Instructions
+<section id='instructions'>
+
+</section>
+
+## Tests
+<section id='tests'>
+
+``` yml
+tests:
+  - text: <code>sortDisjoint</code> should be a function.
+    testString: assert(typeof sortDisjoint == 'function', '<code>sortDisjoint</code> should be a function.');
+  - text: <code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])</code> should return a array.
+    testString: assert(Array.isArray(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])), '<code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])</code> should return a array.');
+  - text: <code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])</code> should return <code>[7, 0, 5, 4, 3, 2, 1, 6]</code>.
+    testString: assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7]), [7, 0, 5, 4, 3, 2, 1, 6], '<code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [6, 1, 7])</code> should return <code>[7, 0, 5, 4, 3, 2, 1, 6]</code>.');
+  - text: <code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6])</code> should return <code>[7, 1, 2, 4, 3, 5, 6, 0]</code>.
+    testString: assert.deepEqual(sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6]), [7, 1, 2, 4, 3, 5, 6, 0], '<code>sortDisjoint([7, 6, 5, 4, 3, 2, 1, 0], [1, 2, 5, 6])</code> should return <code>[7, 1, 2, 4, 3, 5, 6, 0]</code>.');
+  - text: <code>sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7])</code> should return <code>[8, 1, 6, 5, 4, 3, 2, 7]</code>.
+    testString: assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7]), [8, 1, 6, 5, 4, 3, 2, 7], '<code>sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [6, 1, 7])</code> should return <code>[8, 1, 6, 5, 4, 3, 2, 7]</code>.');
+  - text: <code>sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6])</code> should return <code>[8, 2, 6, 3, 4, 5, 7, 1]</code>.
+    testString: assert.deepEqual(sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6]), [8, 2, 6, 3, 4, 5, 7, 1], '<code>sortDisjoint([8, 7, 6, 5, 4, 3, 2, 1], [1, 3, 5, 6])</code> should return <code>[8, 2, 6, 3, 4, 5, 7, 1]</code>.');
+  - text: <code>sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4])</code> should return <code>[6, 1, 7, 1, 3, 5, 6]</code>.
+    testString: assert.deepEqual(sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4]), [6, 1, 7, 1, 3, 5, 6],'<code>sortDisjoint([6, 1, 7, 1, 3, 5, 6], [6, 1, 5, 4])</code> should return <code>[6, 1, 7, 1, 3, 5, 6]</code>.');
+```
+
+</section>
+
+## Challenge Seed
+<section id='challengeSeed'>
+<div id='js-seed'>
+
+```js
+function sortDisjoint (values, indices) {
+  // Good luck!
+}
+```
+
+</div>
+
+</section>
+
+## Solution
+<section id='solution'>
+
+```js
+function sortDisjoint(values, indices) {
+  let sublist = [];
+
+  indices.sort(function (a, b) { return a - b; });
+  
+  for (let i = 0; i < indices.length; i++) {
+    sublist.push(values[indices[i]]);
+  }
+  
+  sublist.sort((a, b) => { return a - b; });
+  
+  for (let i = 0; i < indices.length; i++) {
+    values[indices[i]] = sublist[i];
+  }
+
+  return values;
+}
+```
+
+</section>