Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion .idea/misc.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

78 changes: 60 additions & 18 deletions .idea/workspace.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

Binary file not shown.
Binary file not shown.
1 change: 1 addition & 0 deletions src/main/BonusBinarySearch.java
Original file line number Diff line number Diff line change
Expand Up @@ -28,3 +28,4 @@ public static int binarySearch(int[] sortedNumbers, int n) {
}

}

50 changes: 45 additions & 5 deletions src/test/BalancedBracketsTest.java
Original file line number Diff line number Diff line change
@@ -1,16 +1,56 @@
package test;

import main.BalancedBrackets;
import org.junit.Test;

import static org.junit.Assert.*;

public class BalancedBracketsTest {

//TODO: add tests here
@Test
public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsFalse2() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[ ][[[[[[[[[[]a[bcdef[ghij]klm[]no]p]]]]"));
}
@Test
public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsFalse1() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[[]a[bcdef[ghij]klm[]no]p]]]]"));
}
@Test
public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsTrue2() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[[[][[]a[bcdef[ghij]klm[]no]p]]]"));
}
@Test
public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsTrue1() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[[]a[bcdef[ghij]klm[]no]p]"));
}
@Test
public void onlyOnePairBracketsWithSomeCharactersInsideAndAroundReturnsTrue() {
assertTrue(BalancedBrackets.hasBalancedBrackets("abcdef[ghij]klmnop"));
}
@Test
public void onlyOnePairBracketsWithSomeCharactersAroundReturnsTrue() {
assertTrue(BalancedBrackets.hasBalancedBrackets("abcdefghij[]klmnop"));
}
@Test
public void onlyOnePairBracketsWithSomeCharactersOutsideReturnsTrue() {
assertTrue(BalancedBrackets.hasBalancedBrackets("abcdefghijklmnop[]"));
}
@Test
public void onlyOnePairBracketsWithSomeCharactersInsideReturnsTrue() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[abcdefghijklmnop]"));
}
@Test
public void onlyOneClosedBracketsReturnsFalse() {
assertFalse(BalancedBrackets.hasBalancedBrackets("]"));
}
@Test
public void onlyOneOpenBracketsReturnsFalse() {
assertFalse(BalancedBrackets.hasBalancedBrackets("["));
}
@Test
public void onlyBracketsReturnsTrue() {
assertTrue(BalancedBrackets.hasBalancedBrackets("[]"));
}
@Test
public void emptyTest() {
assertEquals(true, true);
}


}
71 changes: 71 additions & 0 deletions src/test/BonusBinarySearchTest.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,71 @@
package test;

import org.junit.Test;

import static main.BonusBinarySearch.binarySearch;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;

public class BonusBinarySearchTest {

@Test
public void invalidTestTrue4() {
assertEquals(-1, binarySearch(new int[]{}, 10));
}

@Test
public void invalidTestTrue3() {
assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000} , 10000000));
}

@Test
public void invalidTestTrue2() {
assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10));
}

@Test
public void invalidTestTrue1() {
assertEquals(-1, binarySearch(new int[] {1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10));
}

@Test
public void invalidTestFalse3() {
assertEquals(-1, binarySearch(new int[] {1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10));
}

@Test
public void invalidTestFalse2() {
assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100}, 10));
}

@Test
public void invalidTestFalse1() {
assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1}, 19839));
}

@Test
public void validTest4() {
assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,-1}, -1));
}

@Test
public void validTest3() {
assertEquals(19835, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1}, 19835));
}

@Test
public void validTest2() {
assertEquals(10, binarySearch(new int[]{10,1,2,3,1,1,1,1,1}, 10));
}

@Test
public void validTest1() {
assertEquals(10, binarySearch(new int[]{1,2,3,10}, 10));
}

@Test
public void emptyTest() {
assertEquals(10, 10, .001);
assertEquals(true, true);
}
}