function editDistance(a, b) {
const m = a.length, n = b.length
function minEdits(i, j) {
if (i == m) return n - j;
if (j == n) return m - i;
if (a[i] == b[j]) {
return minEdits(i + 1, j + 1)
} else {
return Math.min(
minEdits(i + 1, j),
minEdits(i + 1, j + 1),
minEdits(i, j + 1)
) + 1
}
}
return minEdits(0, 0)
}
editDistance('cat', 'cat')
editDistance('horse', 'ros')
editDistance('recursion', 'iteration')
function editDistanceM(a, b) {
const m = a.length, n = b.length
let mem = {}
function minEdits(i, j) {
if (i == m) return n-j;
if (j == n) return m-i;
if (i in mem && j in mem[i]) return mem[i][j]
let temp
if (a[i] == b[j]) {
temp = minEdits(i+1, j+1)
} else {
temp = Math.min(
minEdits(i+1,j),
minEdits(i+1,j+1),
minEdits(i,j+1)
) + 1
}
mem[i] = mem[i] || {}
mem[i][j] = temp
return temp
}
return minEdits(0,0)
}
editDistanceM('recursion', 'I personally like this problem because it looks very hard')
editDistanceM('The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.','I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).')
function editDistanceL(a, b) {
const m = a.length, n = b.length
let minEdits = new Array(m+1)
.fill(0)
.map(() => new Array(n+1).fill(0))
for (let i = m; i >= 0; i--) {
minEdits[i][n] = m - i;
}
for (let j = n; j >= 0; j--) {
minEdits[m][j] = n - j;
}
for (let i = m-1; i >= 0; i--) {
for (let j = n-1; j >= 0; j--) {
if (a[i] == b[j]) {
minEdits[i][j] = minEdits[i+1][j+1]
} else {
minEdits[i][j] = Math.min(
minEdits[i+1][j],
minEdits[i+1][j+1],
minEdits[i][j+1]
) + 1
}
}
}
return minEdits[0][0]
}
editDistanceL('The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.','I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).')
editDistanceL('The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.The size of each problem can vary. Be careful when you are using letter `n`, because it can be used already for other purpose.', 'I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).I personally like this problem because it looks very hard, yet the solution is surprisingly simple and beautiful. Though its a rare algorithm, its is very useful (yech, I recognize that many algorithm problems are not very useful).')
One platform to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.