First, update the package list and upgrade existing packages:
sudo apt update
Aaron Adetunmbi kenneropia
💸
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function fizzbuzzArray() { | |
| const result = []; | |
| for (let i = 1; i <= 100; i++) { | |
| if (i % 15 === 0) { // 15 is LCM of 3 and 5 | |
| result.push("FizzBuzz"); | |
| } else if (i % 3 === 0) { | |
| result.push("Fizz"); | |
| } else if (i % 5 === 0) { | |
| result.push("Buzz"); | |
| } else { |
kenneropia
/ code.ts
Last active
December 30, 2023 21:50
high-level design for a time travel information retrieval system
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Define core services | |
| class TimeTravelService { | |
| constructor( | |
| private timelineAnalyzer: TimelineAnalyzer, | |
| private dataVault: DataVault, | |
| private encryptionService: EncryptionService, | |
| private transporter: Transporter, | |
| private auditor: Auditor | |
| ) {} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const mergeWord = (word1: string, word2: string) => { | |
| let shorterWord = '' | |
| let longerWord = '' | |
| let accu = '' | |
| if (word1.length < word2.length) { | |
| shorterWord = word1 | |
| longerWord = word2 | |
| } else if (word2.length < word1.length) { | |
| shorterWord = word2 | |
| longerWord = word1 |
kenneropia
/ ismonotonic.ts
Last active
January 28, 2023 15:16
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function isMonotonic(arr: Number[]): Boolean { | |
| let monoLeft = true; | |
| let monoRight = true; | |
| // loop thru the arr and check for the side by side items that makes the array non-monotonic | |
| for (let i = 0; i < arr.length - 1; i++) { | |
| // To check if | |
| // array is not increasing | |
| if (arr[i] > arr[i + 1]) { | |
| monoLeft = false; |