remi-bruguier
/ buyAndSell.ts
Created
June 13, 2020 20:43
You are given an array. Each element represents the price of a stock on that particular day. Calculate and return the maximum profit you can make from buying and selling that stock only once.
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 buy_and_sell = (values:number[]):number => { | |
| let maxProfit = 0; | |
| let minPrice = Number.MAX_SAFE_INTEGER; | |
| for(let val of values){ | |
| if(val<minPrice) { | |
| minPrice = val; | |
| }else if(val - minPrice > maxProfit){ | |
| maxProfit = val - minPrice; | |
| } | |
| } |
remi-bruguier
/ kalAsh.ts
Created
July 6, 2020 19:29
Trouvez une chaîne de 9 caractères (seulement constituées des lettres "acdegilmnoprstuw") telle que hash(la_string) soit 956446786872726 si le hash est défini par le code suivant :
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
| /* Int64 hash (String s) { | |
| Int64 h = 7 | |
| String letters = "acdegilmnoprstuw" | |
| for(Int32 i = 0; i < s.length; i++) { | |
| h = (h * 37 + letters.indexOf(s[i])) | |
| } | |
| return h | |
| } */ | |
remi-bruguier
/ remove_adjacent_dup.ts
Last active
October 31, 2020 14:37
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
| /** | |
| * Given a string, we want to remove 2 adjacent characters that are the same, and repeat the process with the new string until we can no longer perform the operation. | |
| * | |
| * @param base the original string | |
| * | |
| * @returns the `cleansed` string | |
| */ | |
| const remove_adjacent_dup = (base:string): string => { | |
| const adjacentDupRegex = new RegExp(/(\w)\1/g); | |
| while(adjacentDupRegex.test(base)){ |
OlderNewer