Skip to content

Instantly share code, notes, and snippets.

View osahondev's full-sized avatar
💭
Debugging: because sometimes the code talks back... in gibberish.

Michael Osahon osahondev

💭
Debugging: because sometimes the code talks back... in gibberish.
View GitHub Profile
@osahondev
osahondev / HelpDaniel.js
Created May 28, 2021 18:50
Help Daniel play his game based on possible combination of number
const helpDaniel = ( nums ) => {
if( nums == null || nums == undefined || nums.length == 0 ) return [];
const output = [];
const keys = [
"0",
@osahondev
osahondev / MinimumTimeDifference.js
Last active April 13, 2024 22:24
Time Management Implementation to help Esther manage her time effectively
const convertToMinutes = (time) => {
let [hr,minute] = time.split(":");
if( Number.parseInt(hr) > 23 || Number.parseInt(minute) > 59) return 0;
return ( Number.parseInt(hr)*60)+ Number.parseInt(minute);
}
const minimumTimeDifference = ( times ) =>{
const shuffleClass = (arr,move) =>{
if( arr == undefined || arr == null ) return [];
if( arr.length == 0 || move == 0 || move == arr.length ) return arr;
if( Math.abs(move) > arr.length ){
move = move % arr.length; // to handle reshuffling
}
const productsArray = nums =>{
if( nums == undefined || nums == null ) return [];
if( !Array.isArray(nums) ) return [];
if( nums.length == 0 ) return [];
if( nums.length == 1 ) return[0];
let product = 1;
for(let [index,number] of nums.entries()){
product = number * product;
@osahondev
osahondev / GetPosition.js
Last active April 27, 2021 04:16
Function to return the position of values in a sorted array.
const getPosition = ( nums, val ) => {
let idxs = [-1,-1];
let idx = 0;
let idx_val = 0;
if( !Array.isArray(nums) ) return idxs;
if( (nums == undefined) || (nums == null) ) return idxs;
if ( nums.length == 0 ) return idxs;
@osahondev
osahondev / ElementRemoval.js
Last active April 19, 2021 19:02
Function to remove instances from a value and return new length
const elementRemoval = (nums,val) =>{
if( nums == undefined )
return 0
return nums.filter( num=>num!=val ).length;
}
@osahondev
osahondev / RemoveDuplicates.js
Last active April 12, 2021 07:51
Algorithm to remove duplicates from a sorted array
const removeDuplicates = (nums) =>{
if( nums == undefined )
return 0;
if( nums.length == 0 )
return 0;
let pointerOne = 0;
let pointerTwo = 1;
let occurence = 0;