philipcalugcugan Goto Github PK

angular-ivy-gz3hd5

Created with StackBlitz ⚡️

digitalroot

Digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. The input will be a non-negative integer.

jpc.amountconverter

jpc.angular1

jpc.rainfallapi

movingzerostotheendexercise

An C# Logic excercise. Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.

persistent-bugger

A C# Logic Exercise. Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.

philipcalugcugan.github.io

staggerimage-canvas

Created with StackBlitz ⚡️

staggerimage-canvas2

Created with StackBlitz ⚡️

taketenminuteswalk

An C# Logic excercise. You live in the city of Cartesia where all roads are laid out in a perfect grid. You arrived ten minutes too early to an appointment, so you decided to take the opportunity to go for a short walk. The city provides its citizens with a Walk Generating App on their phones -- everytime you press the button it sends you an array of one-letter strings representing directions to walk (eg. ['n', 's', 'w', 'e']). You always walk only a single block for each letter (direction) and you know it takes you one minute to traverse one city block, so create a function that will return true if the walk the app gives you will take you exactly ten minutes (you don't want to be early or late!) and will, of course, return you to your starting point. Return false otherwise.

wifi-passview

An open source batch script based WiFi Passview for Windows!