From 697449f79ccae600c363abd9e9745b65d3014f5a Mon Sep 17 00:00:00 2001 From: Kodir Amirov Date: Sat, 24 Jun 2023 16:14:15 +0900 Subject: [PATCH 1/3] 015 - typescript --- solutions/015.md | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) diff --git a/solutions/015.md b/solutions/015.md index 12ed2b5..fbdb5a2 100644 --- a/solutions/015.md +++ b/solutions/015.md @@ -50,5 +50,21 @@ class Solution: return total ``` +### Solution in Typescript + +```typescript + +function sumOfMultiples(n: number): number { + let sum = 0; + for(let i = 0; i <= n; i++) { + if((i % 3 === 0) || (i % 5 === 0) || (i % 7 === 0)) { + sum += i; + } + } + return sum; +} + +``` + ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. From 1438e97a0c68f8d6cefdfdbc4173cbb26c44716b Mon Sep 17 00:00:00 2001 From: Kodir Amirov Date: Sun, 25 Jun 2023 15:57:33 +0900 Subject: [PATCH 2/3] 017 - typescript --- solutions/017.md | 13 +++++++++++++ 1 file changed, 13 insertions(+) diff --git a/solutions/017.md b/solutions/017.md index 2bd55c0..77335f6 100644 --- a/solutions/017.md +++ b/solutions/017.md @@ -46,5 +46,18 @@ class Solution: def defangIPaddr(self, address: str) -> str: return "[.]".join(address.split(".")) ``` +# Typescript + +```typescript + +function defangIPaddr(address: string): string { + let result = ''; + for(let i = 0; i < address.length; i++) { + result += address[i] === '.' ? '[.]' : address[i] + } + return result; +}; + +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. From 5cf8ab673139b42982913fff8d3a8e1a9a276735 Mon Sep 17 00:00:00 2001 From: Kodir Amirov Date: Sun, 2 Jul 2023 01:56:52 +0900 Subject: [PATCH 3/3] TypeScript solutions --- solutions/019.md | 11 +++++++++++ solutions/021.md | 10 ++++++++++ solutions/022.md | 29 ++++++++++++++++++++++++++++- solutions/023.md | 9 +++++++++ solutions/024.md | 23 +++++++++++++++++++++++ solutions/025.md | 7 +++++++ solutions/026.md | 18 ++++++++++++++++++ solutions/027.md | 24 +++++++++++++++++++++++- solutions/029.md | 7 +++++++ solutions/030.md | 19 +++++++++++++++++++ solutions/031.md | 12 ++++++++++++ solutions/032.md | 9 ++++++++- 12 files changed, 175 insertions(+), 3 deletions(-) diff --git a/solutions/019.md b/solutions/019.md index c27eecc..2b652cc 100644 --- a/solutions/019.md +++ b/solutions/019.md @@ -76,5 +76,16 @@ class Solution: total += 1 return total ``` +#### TypeScript + +``` typescript +function finalValueAfterOperations(operations: string[]): number { + let res = 0 + for(let operation of operations){ + operation[1] === '+' ? res++ : res-- + } + return res; +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/021.md b/solutions/021.md index 8d8c706..60ebbe5 100644 --- a/solutions/021.md +++ b/solutions/021.md @@ -72,5 +72,15 @@ class Solution: greatest = max(candies) return [extraCandies+candy >= greatest for candy in candies] ``` +#### TypeScript +``` typescript +function kidsWithCandies(candies: number[], extraCandies: number): boolean[] { + return candies.map(candy => isGreaterAll(candies, candy + extraCandies)); +}; + +function isGreaterAll(array: number[], value: number): boolean { + return array.every(item => item <= value) +} +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/022.md b/solutions/022.md index 1aa2fb5..71ba886 100644 --- a/solutions/022.md +++ b/solutions/022.md @@ -76,5 +76,32 @@ class Solution: result.append(array) return result ``` - +#### TypeScript + +``` typescript +function findMatrix(nums: number[]): number[][] { + const result: number[][] = []; + const numberMap: Record = {}; + let count = 1; + for(let num of nums) { + if(numberMap[num]) { + numberMap[num] = numberMap[num] + 1 + } else { + numberMap[num] = 1 + } + } + + while(count <= Math.max(...Object.values(numberMap))) { + const subArray: number[] = [] + for(let key of Object.keys(numberMap)){ + if(numberMap[key] >= count) { + subArray.push(Number(key)) + } + } + result.push(subArray) + count++ + } + return result; +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/023.md b/solutions/023.md index df25729..4cbaef0 100644 --- a/solutions/023.md +++ b/solutions/023.md @@ -64,4 +64,13 @@ class Solution: return max(sum(account) for account in accounts) ``` +#### TypeScript + +``` typescript +function maximumWealth(accounts: number[][]): number { + let wealthes = accounts.map(account => account.reduce((a, b) => a + b, 0)) + return Math.max(...wealthes); +}; +``` + ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/024.md b/solutions/024.md index 0d123dc..cbd4dab 100644 --- a/solutions/024.md +++ b/solutions/024.md @@ -137,4 +137,27 @@ class SubrectangleQueries: # param_2 = obj.getValue(row,col) ``` +#### TypeScript + +``` typescript +class SubrectangleQueries { + rectangle:number[][]; + constructor(rectangle: number[][]) { + this.rectangle = rectangle + } + + updateSubrectangle(row1: number, col1: number, row2: number, col2: number, newValue: number): void { + for(let i = row1; i <= row2; i++) { + for(let j = col1; j <= col2; j++) { + this.rectangle[i][j] = newValue + } + } + } + + getValue(row: number, col: number): number { + return this.rectangle[row][col] + } +} +``` + ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/025.md b/solutions/025.md index 29bc140..e5cccc7 100644 --- a/solutions/025.md +++ b/solutions/025.md @@ -64,4 +64,11 @@ class Solution: return nums ``` +#### TypeScript + +``` typescript +function getConcatenation(nums: number[]): number[] { + return nums.concat(nums) +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/026.md b/solutions/026.md index acbbd5f..0ff7759 100644 --- a/solutions/026.md +++ b/solutions/026.md @@ -100,4 +100,22 @@ class Solution: return result ``` +#### TypeScript + +``` typescript +function minOperations(boxes: string): number[] { + const result: number[] = []; + for(let i = 0; i < boxes.length; i++) { + let steps = 0; + for(let j = 0; j< boxes.length; j++) { + if(+boxes[j] && j !== i) { + steps += Math.abs(j - i); + } + } + result.push(steps) + } + return result; +}; +``` + ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/027.md b/solutions/027.md index a39ed56..a5e3894 100644 --- a/solutions/027.md +++ b/solutions/027.md @@ -81,6 +81,28 @@ class Solution: left_sum -= num return answer ``` - +#### TypeScript + +``` typescript +function leftRightDifference(nums: number[]): number[] { + const answer = []; + const rightSums = []; + const leftSums = []; + const length = nums.length; + for(let i = 0; i < nums.length; i++) { + if(i === 0) { + leftSums.push(0); + rightSums.push(0); + } else { + leftSums.push(leftSums[i - 1] + nums[i - 1]); + rightSums.unshift(nums[nums.length - i] + rightSums[0]) + } + } + for(let i = 0; i < length; i++) { + answer[i] = Math.abs(leftSums[i] - rightSums[i]) + } + return answer +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/029.md b/solutions/029.md index 890c6a1..6faa1ec 100644 --- a/solutions/029.md +++ b/solutions/029.md @@ -70,4 +70,11 @@ class Solution: explnation_here +#### TypeScript + +``` typescript +function mostWordsFound(sentences: string[]): number { + return Math.max(...sentences.map(item => item.split(' ').length)) +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/030.md b/solutions/030.md index b9881da..e1a26b6 100644 --- a/solutions/030.md +++ b/solutions/030.md @@ -70,4 +70,23 @@ class Solution: return answer ``` +#### TypeScript + +``` typescript +function findArray(pref: number[]): number[] { + const result: number[] = []; + let pre = 0; + for(let i = 0; i < pref.length; i++) { + if(i === 0) { + result.push(pref[0]) + } else { + pre ^= result[i - 1] + result.push(pre ^ pref[i]) + } + } + return result; +}; + +``` + ***NB***: If you want to get community points please suggest solutions in other languages as merge requests. diff --git a/solutions/031.md b/solutions/031.md index 829e2a6..dd88213 100644 --- a/solutions/031.md +++ b/solutions/031.md @@ -63,4 +63,16 @@ class Solution: return result ``` +#### TypeScript + +``` typescript +function xorOperation(n: number, start: number): number { + let res = 0; + for(let i = 0; i List[List[int]]: return sorted(score, key=lambda x: x[k], reverse=True) ``` +#### TypeScript + +``` typescript +function sortTheStudents(score: number[][], k: number): number[][] { + return score.sort((a, b) => b[k]- a[k]); +}; +``` ***NB***: If you want to get community points please suggest solutions in other languages as merge requests.