rasmus4200 / algorithms101

A collection of commonly asked about data structures and algorithms for technical interviews

Algorithms 101

A collection of commonly asked about data structures and algorithms for technical interviews

algorithms101's Issues

Can not run unit test to start the course!

Hello,
I just registered for this course and I'm having trouble run any of the unit test and it's giving me the red circle by each one of the files I tried to take a screen shot but I couldn't attach it to my message.
SDK is been set up but still having problem.

Thanks

Solutions already implemented

While checking out https://www.udemy.com/data-structures-and-algorithms-bootcamp/learn/v4/t/lecture/8772568 I noticed that the code I was supposed to implement is already implemented.

I would propose removing the implementations from the the methods that should be part of the student exercises. The solutions could still be included in e.g. a different folder or separate branch of course.

OneAway() method contains a bug.

Relating to this challenge: There are three types of edits that can be performed on strings: insert a character, remove a character or replace a character. Given two strings, write a function to check if they are one or zero edits away.
A private method name OneEditReplace() is not working correctly because this line of code won't pass the test:

Assert.assertTrue(oneAwayDetector.oneAway("peter","peeer"));
or:
Assert.assertTrue(oneAwayDetector.oneAway("geaks","geeks"));

The correct implementation is:
private boolean OneEditReplace(String s1, String s2) {
boolean foundDifference = false;
for (int i = 0; i < s1.length(); i++) {
if (s1.charAt(i) != s2.charAt(i)) {
if (foundDifference) {
return false;
}
foundDifference = true;
}
}
return true;
}

👍

Delete DynamicArray

Hello,

While following this example: https://www.udemy.com/course/data-structures-and-algorithms-bootcamp/learn/lecture/16887116#questions

The array always hold tha last index:

after delete array.delete(1)

To solve this, a simple `else

public void delete(int index) {
        // Copy down
        for (int j = index; j < size - 1; j++) {
            data[j] = data[j + 1];
        }

        // Clear if last element in array
        if (index == size) {
            data[index] = null;
        }else {
            //Clear last value index
            data[size - 1] = null;
        }
        size--;
    }