From 5934af9febe4aefbf847b698a84f9be9303096bd Mon Sep 17 00:00:00 2001 From: Bunmi Oladipupo Date: Tue, 29 Nov 2022 21:43:15 +0100 Subject: [PATCH 1/3] Challenge-3 --- src/binary-reversal/index.js | 19 ++++++++++++- src/list-sorting/index.js | 52 ++++++++++++++++++++++++++++++++++-- 2 files changed, 68 insertions(+), 3 deletions(-) diff --git a/src/binary-reversal/index.js b/src/binary-reversal/index.js index 965bccf4..1ecb5a5f 100644 --- a/src/binary-reversal/index.js +++ b/src/binary-reversal/index.js @@ -3,6 +3,23 @@ * * * @param {string} value */ -function binaryReversal(value) {} + function binaryReversal(value) { + var value = Number(value); + var valueInBinary = value.toString(2); + + var binArray = valueInBinary.split(''); + var num = valueInBinary.length + console.log(binArray) + if (binArray.length < 8) { + for (let i = 0; i < (8 - num); i++) { + binArray.unshift('0'); + + } + } + console.log(binArray) + var reversal = binArray.reverse(); + + return parseInt(reversal.join(''),2); +} module.exports = binaryReversal; diff --git a/src/list-sorting/index.js b/src/list-sorting/index.js index 6636c20d..86905b3e 100644 --- a/src/list-sorting/index.js +++ b/src/list-sorting/index.js @@ -1,3 +1,51 @@ -function listSorting(needle, haystack) {} +function listSorting(needle, haystack) { + var arr = haystack; + var index = ""; + var answer = [];//level, indexOf + var holder = ''; -module.exports = listSorting; + if (typeof(arr[0]) === 'number') { + + for (let i = 0; i < arr.length; i++) { + if (arr[i] == needle) { + index = i; + } + + } + }else if(typeof(arr[0]) === "object"){ + + for (let k = 0; k < arr.length; k++) { + if (arr[k].indexOf(needle) == -1) { + + continue; + }else{ + if (typeof(arr[k][0] == 'number')) { + + for (let x = 0; x < arr[k].length; x++) { + if (arr[k][x] == needle) { + index = k; + holder = x; + } + + } + } + } + + } + } + answer.unshift(index); + if (holder !== '') { + answer.push(holder); + } + if (answer == '') { + return -1; + }else{ + if (answer.length == 1) { + return answer.join(''); + }else{ + return answer; + } + } +} + +module.exports = listSorting; \ No newline at end of file From 163877d3320901fdff9c5806e66cd33ece9f7e0d Mon Sep 17 00:00:00 2001 From: Bunmi Oladipupo Date: Tue, 29 Nov 2022 21:54:44 +0100 Subject: [PATCH 2/3] Week 0 Challenge-3 --- src/binary-reversal/index.js | 4 +--- src/list-sorting/index.js | 6 +++--- 2 files changed, 4 insertions(+), 6 deletions(-) diff --git a/src/binary-reversal/index.js b/src/binary-reversal/index.js index 1ecb5a5f..22843359 100644 --- a/src/binary-reversal/index.js +++ b/src/binary-reversal/index.js @@ -9,17 +9,15 @@ var binArray = valueInBinary.split(''); var num = valueInBinary.length - console.log(binArray) if (binArray.length < 8) { for (let i = 0; i < (8 - num); i++) { binArray.unshift('0'); } } - console.log(binArray) var reversal = binArray.reverse(); - return parseInt(reversal.join(''),2); + return parseInt(reversal.join(''),2).toString(); } module.exports = binaryReversal; diff --git a/src/list-sorting/index.js b/src/list-sorting/index.js index 86905b3e..f3038762 100644 --- a/src/list-sorting/index.js +++ b/src/list-sorting/index.js @@ -1,6 +1,6 @@ function listSorting(needle, haystack) { var arr = haystack; - var index = ""; + var index = 0; var answer = [];//level, indexOf var holder = ''; @@ -41,11 +41,11 @@ function listSorting(needle, haystack) { return -1; }else{ if (answer.length == 1) { - return answer.join(''); + return Number(answer.join('')); }else{ return answer; } } } -module.exports = listSorting; \ No newline at end of file +module.exports = listSorting; From 231ddb85c100acac83810d18c7fe45a0bccc89f6 Mon Sep 17 00:00:00 2001 From: Bunmi Oladipupo Date: Tue, 29 Nov 2022 22:01:54 +0100 Subject: [PATCH 3/3] Week 0 Challenge-3 --- src/list-sorting/index.js | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/src/list-sorting/index.js b/src/list-sorting/index.js index f3038762..1a76bd47 100644 --- a/src/list-sorting/index.js +++ b/src/list-sorting/index.js @@ -1,6 +1,6 @@ function listSorting(needle, haystack) { var arr = haystack; - var index = 0; + var index = ''; var answer = [];//level, indexOf var holder = ''; @@ -49,3 +49,4 @@ function listSorting(needle, haystack) { } module.exports = listSorting; +