My personal journey to tackle the inifite possibilities of algorithm

1: Having fun with the "coins":

#Question description: find the minimum amount of coins needed to make up a positive integer (in context of paying a bill), also output the exact coin count for each coin used

Met this problem during an interview, figure I would write my dynamic programming solution down Most solution found online would just output the minimum number of coin, the solution in coinProblemDP.js output the actual combination of coin used to get a specific number.

input: num: positive integer; coins: array to represent what coins to choose from output: an object where key represents coin value and value represents the count of that specifc coins needed to make up for the amount note: output will be null if no solution is found

2: fib in a range

#Question description: return fib in a certain range where all numbers in returned array is >= lower bound and <= upper bound

Met this question during a non-programmer interview, given a, b where both are positive interger satisfy a <= b; question asks to write a function returning all fib numbers within the range.

3: merge sort

#Question description: sort array in ascending order

my merge sort solution @ mergeSort.js

4: leetcode 324

#Question description: Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....

#5: screenLockStopper.py

My little trick to stop autolock, enjoy, notes are in the file :D

Note: running the lib will make your fan go crazy...