2 Crystal ball problem find the 1st hit with minimum time complexity.
const arr = [false, false, false, false, true, true, true, true, true, true]; function two_crystal_balls(breaks) { const jmpAmount = Math.floor(Math.sqrt(breaks.length)); let i = jmpAmount; for (; i < breaks.length; i += jmpAmount) { if (breaks[i]) { break; } } console.log(i, "i"); const updatedPos = i - jmpAmount; for (let j = updatedPos; j<= i; j++) { if (arr[j]) { console.log('Answer ---> ', j); return ; } } return -1; } two_crystal_balls(arr); /* Output 6 i Answer ---> 4 */
The above is the detailed content of rystal Ball Searching Problem Solved Using Javascript. For more information, please follow other related articles on the PHP Chinese website!