Initial commit

Author: bogekt

.gitignore

@@ -0,0 +1,104 @@
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+lerna-debug.log*
+
+# Diagnostic reports (https://nodejs.org/api/report.html)
+report.[0-9]*.[0-9]*.[0-9]*.[0-9]*.json
+
+# Runtime data
+pids
+*.pid
+*.seed
+*.pid.lock
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+*.lcov
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (https://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# Bower dependency directory (https://bower.io/)
+bower_components
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (https://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules/
+jspm_packages/
+
+# TypeScript v1 declaration files
+typings/
+
+# TypeScript cache
+*.tsbuildinfo
+
+# Optional npm cache directory
+.npm
+
+# Optional eslint cache
+.eslintcache
+
+# Microbundle cache
+.rpt2_cache/
+.rts2_cache_cjs/
+.rts2_cache_es/
+.rts2_cache_umd/
+
+# Optional REPL history
+.node_repl_history
+
+# Output of 'npm pack'
+*.tgz
+
+# Yarn Integrity file
+.yarn-integrity
+
+# dotenv environment variables file
+.env
+.env.test
+
+# parcel-bundler cache (https://parceljs.org/)
+.cache
+
+# Next.js build output
+.next
+
+# Nuxt.js build / generate output
+.nuxt
+dist
+
+# Gatsby files
+.cache/
+# Comment in the public line in if your project uses Gatsby and *not* Next.js
+# https://nextjs.org/blog/next-9-1#public-directory-support
+# public
+
+# vuepress build output
+.vuepress/dist
+
+# Serverless directories
+.serverless/
+
+# FuseBox cache
+.fusebox/
+
+# DynamoDB Local files
+.dynamodb/
+
+# TernJS port file
+.tern-port

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Eugene Borys
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,2 @@
+# algo-expert
+Problems solutions to https://algoexpert.io

largestRange.js

@@ -0,0 +1,44 @@
+function largestRange(array) {
+  // Write your code here.
+	const set = new Set(array)
+	let i = 0
+	let start = -1;
+	let end = -1;
+	let totalLength = 0
+	let length = 0
+	
+	while (totalLength < set.size || i < array.length) {
+		if (
+			start === end
+			||
+			array[i] < start && array[i] > end
+		) {
+			let testStart = array[i]
+			let testEnd = array[i]
+			while (set.has(testStart - 1)) testStart--
+			while (set.has(testEnd + 1)) testEnd++
+			if (testEnd - testStart + 1 === set.size)
+				return [testStart, testEnd]
+			if (length < testEnd - testStart + 1) {
+				length = testEnd - testStart + 1
+				start = testStart
+				end = testEnd
+			}
+			totalLength += end - start + 1
+		} else {
+			totalLength++
+		}
+		i++
+	}
+		
+	return [start, end]
+}
+
+
+const test = true
+if (typeof test === 'boolean' && test) {
+	const { expect } = require('../leetCode/utils.js');
+	expect(largestRange([1, 11, 3, 0, 15, 5, 2, 4, 10, 7, 12, 6]) /*?*/, [0,7]) //?. $
+	expect(largestRange([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) /*?*/, [0,9]) //?. $
+	expect(largestRange([1, 1, 1, 3, 4], [3,4]) /*?*/, [3,4]) //?. $
+}

largestRange2.js

@@ -0,0 +1,40 @@
+function largestRange(array) {
+	// Write your code here.
+	const explored = array.reduce((acc, v) => (acc[v] = true, acc), {})
+	let start = -1
+	let end = -1
+	let bestLength = 0
+
+	for (let i = 0; i < array.length; i++) {
+		// is already explored
+		if (!explored[array[i]]) continue;
+		// find range for an item
+		let testStart = array[i]
+		let testEnd = array[i]
+		let testLength = 1
+		while (testStart - 1 in explored)
+			explored[--testStart] = false, testLength++
+		while (testEnd + 1 in explored)
+			explored[++testEnd] = false, testLength++
+		// is array an all range
+		if (testLength === Object.keys(explored).length)
+			return [testStart, testEnd]
+		// is new length is the best
+		if (testLength > bestLength) {
+			bestLength = testLength
+			start = testStart
+			end = testEnd
+		}
+	}
+
+	return [start, end]
+}
+
+const test = true
+if (typeof test === 'boolean' && test) {
+	const { expect } = require('../leetCode/utils.js');
+	expect(largestRange([1]) /*?*/, [1, 1]) //?. $
+	expect(largestRange([1, 11, 3, 0, 15, 5, 2, 4, 10, 7, 12, 6]) /*?*/, [0, 7]) //?. $
+	expect(largestRange([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) /*?*/, [0, 9]) //?. $
+	expect(largestRange([1, 1, 1, 3, 4], [3, 4]) /*?*/, [3, 4]) //?. $
+}

maxProfitWithKTransactions.js

@@ -0,0 +1,61 @@
+// [
+//  [0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0,    0] k = 0
+//  [0,   24,   24,   24,   24,   24,   35,   35,   39,   39,   40,   40] k = 1
+//  [0,   24,   24,   24,   24,   29,   48,   48,   61,   61,   62,   62] k = 2
+//  [0,   24,   24,   24,   24,   29,   48,   48,   74,   74,   75,   75] k = 3
+//  [0,   24,   24,   24,   24,   29,   48,   48,   74,   74,   84,   84] k = 4
+// ]
+//      25-1;  max   max   max   max  36-1   max  40-1   max  41-1   max k = 1
+//            <k*2   max   max  24+5 24+24   max 35+26   max 35+27   max k = 2
+//                        <k*3       35+26   max 48+26   max 48+27   max k = 3
+//                                    <k*4             74+10   max       k = 4
+//  prices[j] + max(prices((i - 1)*2, j) => profits[i - 1][index(p)] - p), 
+//  profits[i][j - 1],
+//  profits[i - 1][j],
+// ) = max(90 - 3 + 6, 63) = 93
+// where prices(i, j) = sliced i..j prices array
+// where index = index of min value
+function maxProfitWithKTransactions(prices, k) {
+	if (!prices || prices.length < 2) return 0
+	if (!k || k < 1) return 0
+
+	const profits = new Array(k + 1).fill().map(() => new Array(prices.length).fill(0))
+	for (let i = 1; i <= k; i++)
+		for (let j = 1; j < prices.length; j++)
+			profits[i][j] = Math.max(
+				prices[j] + Math.max(
+					...prices
+						.slice((i - 1)*2, j)
+						.map((p, l) => profits[i - 1][l + (i - 1)*2] - p)
+				), 
+				profits[i][j - 1],
+				profits[i - 1][j],
+			)
+			
+
+	return profits[k][prices.length - 1]
+}
+
+// Do not edit the line below.
+exports.maxProfitWithKTransactions = maxProfitWithKTransactions;
+
+const test = true
+if (typeof test === 'boolean' && test) {
+	const { expect } = require('../leetCode/utils.js');
+	let k
+	expect(maxProfitWithKTransactions([]) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 7]) /*?*/, 0) //?. $
+	k = 1
+	expect(maxProfitWithKTransactions([5], k) /*?*/, 0) //?
+	expect(maxProfitWithKTransactions([5, 3], k) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 87) //?. $
+	expect(maxProfitWithKTransactions([3, 2, 5, 7, 1, 3, 7], k) /*?*/, 6) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 40) //?. $
+	k = 2
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 62) //?.s $
+	k = 3
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	k = 4
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 84) //?.s $
+}

maxProfitWithKTransactions2.js

@@ -0,0 +1,47 @@
+function maxProfitWithKTransactions(prices, k, debug) {
+	if (!prices || prices.length < 2) return 0
+	if (!k || k < 1) return 0
+
+	const profits = [new Array(prices.length).fill(0)]
+	for (let t = 1; t <= k; t++) {
+		const oldProfitsWithoutPrices = prices.map((p, i) => profits[t - 1][i] - p)
+		profits[t] = new Array(prices.length).fill(0)
+		for (let d = 0; d < prices.length; d++)
+			profits[t][d] = d < (t - 1)*2 + 1 
+				? profits[t-1][d]
+				: Math.max(
+					prices[d] + Math.max(...oldProfitsWithoutPrices.slice((t - 1)*2, d)), 
+					profits[t][d - 1],
+				)
+		debug && console.log(t, profits[t])
+		delete profits[t - 1]
+	}
+
+	return profits[k][prices.length - 1]
+}
+
+// Do not edit the line below.
+exports.maxProfitWithKTransactions = maxProfitWithKTransactions;
+
+const test = true
+if (typeof test === 'boolean' && test) {
+	const { expect } = require('../leetCode/utils.js');
+	let k
+	expect(maxProfitWithKTransactions([]) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 7]) /*?*/, 0) //?. $
+	k = 1
+	expect(maxProfitWithKTransactions([5], k) /*?*/, 0) //?
+	expect(maxProfitWithKTransactions([5, 3], k) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 87) //?. $
+	expect(maxProfitWithKTransactions([3, 2, 5, 7, 1, 3, 7], k) /*?*/, 6) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 40) //?. $
+	k = 2
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 62) //?.s $
+	k = 3
+	expect(maxProfitWithKTransactions([1, 10], k, 1) /*?*/, 9) //?. $
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	k = 4
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k
+	) /*?*/, 84) //?.s $
+}

maxProfitWithKTransactions3.js

@@ -0,0 +1,52 @@
+function maxProfitWithKTransactions(prices, k, debug) {
+	if (!prices || prices.length < 2) return 0
+	if (!k || k < 1) return 0
+
+	const profits = [new Array(prices.length).fill(0)]
+	for (let t = 1; t <= k; t++) {
+		let maxThusFar = -Infinity
+		profits[t] = new Array(prices.length).fill(0)
+		for (let d = 0; d < prices.length; d++)
+			profits[t][d] = d >= (t - 1)*2 + 1 
+				? Math.max(
+					prices[d] + (
+						maxThusFar = Math.max(
+							profits[t - 1][d - 1] - prices[d - 1], 
+							maxThusFar,
+						)
+					), 
+					profits[t][d - 1],
+				)
+				: profits[t-1][d]
+		debug && console.log(t, profits[t])
+		delete profits[t - 1]
+	}
+
+	return profits[k][prices.length - 1]
+}
+
+// Do not edit the line below.
+exports.maxProfitWithKTransactions = maxProfitWithKTransactions;
+
+const test = true
+if (typeof test === 'boolean' && test) {
+	const { expect } = require('../leetCode/utils.js');
+	let k
+	expect(maxProfitWithKTransactions([]) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 7]) /*?*/, 0) //?. $
+	k = 1
+	expect(maxProfitWithKTransactions([5], k) /*?*/, 0) //?
+	expect(maxProfitWithKTransactions([5, 3], k) /*?*/, 0) //?. $
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 87) //?. $
+	expect(maxProfitWithKTransactions([3, 2, 5, 7, 1, 3, 7], k) /*?*/, 6) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 40) //?. $
+	k = 2
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k) /*?*/, 62) //?.s $
+	k = 3
+	expect(maxProfitWithKTransactions([1, 10], k, 1) /*?*/, 9) //?. $
+	expect(maxProfitWithKTransactions([5, 11, 3, 50, 60, 90], k) /*?*/, 93) //?. $
+	k = 4
+	expect(maxProfitWithKTransactions([1, 25, 24, 23, 12, 17, 36, 14, 40, 31, 41, 5], k
+	) /*?*/, 84) //?.s $
+}