Course About Upgrade

Course About Upgrade

Algorithm Analysis

Primitives

Bitwise operators

Bitwise addition

Arrays

Trade stock once

Find the smallest

Reorganize numbers

Maximum subarray

Container of water

Strings

Linked Lists

Find the Middle

Add Linked Lists

Reverse Linked List

Merge Linked Lists

Pivot Linked List

Hash Tables

Palindrome Check

Crypto Exchange

Distinct Subarray

Stacks & Queues

Implement Stack

Implement Queue

Valid stack sequence

Valid Parentheses

Trees & Graphs

Breadth first search

Depth first search

Inorder Traversal

Number of islands

Sorting & Searching

Implement binary search

Merge intervals

Kth largest in array

Intersection of Arrays

Search sorted matrix

Search row & col sorted matrix

Recursion & Dynamic Programming

Longest common subsequence

One edit away

Hard

Let's say you're given two strings a and b.

Write a function that determines if the strings are one or zero edits away from eachother.

Consider a single edit as one of the following:

An inserted character
A replaced character
A removed character

For example, given the two strings:

a = "car"
b = "bar"

Your function should return True, since there is only one character replaced.

Another example:

a = 'baby'
b = 'babies'

Your function should return False since a and b are more than 1 edit away from eachother.

Try it first

1def edit_distance(a: str, b: str) -> bool:
2    # implement edit_distance
3    return False
4

def edit_distance(a: str, b: str) -> bool:
    # implement edit_distance
    return False

Solution

6 Essential Strings Coding Interview Problems

Master Strings by trying the coding challenges below.

1.Reverse StringEasy
2.AnagramEasy
3.Reverse wordsMedium
4.String matchMedium
5.CompressionMedium
6.One edit awayHard

Previous LessonCompression Next LessonLinked List