[2380] Time Needed to Rearrange a Binary String

Author: Chhavi Bansal

LeetcodeProblemsTests/Algorithms/Maximise_Hour_Glass_Sum.js

@@ -2,8 +2,8 @@ const assert = require('assert');
 const maxSum = require('../../LeetcodeProblems/Algorithms/Maximise_Hour_Glass_Sum').maxSum;
 
 function test() {
-  assert.equal(maxSum([[6,2,1,3],[4,2,1,5],[9,2,8,7],[4,1,2,9]]));
-  assert.equal(maxSum([[1,2,3],[4,5,6],[7,8,9]]));
+  assert.equal(maxSum([[6,2,1,3],[4,2,1,5],[9,2,8,7],[4,1,2,9]]), 30);
+  assert.equal(maxSum([[1,2,3],[4,5,6],[7,8,9]]), 35);
 }
 
 module.exports.test = test

LeetcodeProblemsTests/Algorithms/Time_Needed_Rearrange_Binary_String_Test.js

@@ -2,8 +2,8 @@ const assert = require('assert');
 const secondsToRemoveOccurrences = require('../../LeetcodeProblems/Algorithms/Time_Needed_Rearrange_Binary_String').secondsToRemoveOccurrences;
 
 function test() {
-  assert.equal(secondsToRemoveOccurrences("0110101"));
-  assert.equal(secondsToRemoveOccurrences("11100"))
+  assert.equal(secondsToRemoveOccurrences("0110101"), 4);
+  assert.equal(secondsToRemoveOccurrences("11100"), 0)
 };
 
 module.exports.test = test