public void CountDivTest()
{
Console.WriteLine("Start");
int t1, t2;
for (int a = 100; a < 200; a++)
{
for (int b = 100; b < 200; b++)
{
if (b < a)
{
continue;
}
for (int k = 1; k < 101; k++)
{
t1 = CountDiv.solution1(a, b, k);
t2 = CountDiv.solution(a, b, k);
Assert.AreEqual(t1, t2, 0, $"Result: {a}-{b}-{k}: [ex:{t1} ,go: {t2}]");
}
}
}
CountDiv.solution1(1, 1, 1);
// Random r = new Random(DateTime.Now.Millisecond);
Assert.AreEqual(BinaryGap.solution(1041), 5);
Assert.AreEqual(BinaryGap.solution(12343), 6);
}
public void CountShouldReturnNumberOfDivisibleNumbersWhenGivenAandB(int a, int b, int k, int expected)
{
CountDiv counter = new CountDiv();
int actual = counter.Count(a, b, k);
Assert.AreEqual(expected, actual);
}
public void CountDivSolutionTest()
{
var countDiv = new CountDiv();
int result = countDiv.Solve(6, 11, 2);
Assert.AreEqual(3, result);
result = countDiv.Solve(7, 11, 2);
Assert.AreEqual(2, result);
result = countDiv.Solve(7, 11, 3);
Assert.AreEqual(1, result);
result = countDiv.Solve(98, 100, 3);
Assert.AreEqual(1, result);
result = countDiv.Solve(10, 20, 15);
Assert.AreEqual(1, result);
result = countDiv.Solve(0, 1, 1);
Assert.AreEqual(2, result);
result = countDiv.Solve(0, 2000000000, 1);
Assert.AreEqual(2000000001, result);
}
public void test_solution_GivenRangeAndDevider_retunsNumberOfDivisibles(int A, int B, int K, int expected)
{
var target = new CountDiv();
var actual = target.solution(A, B, K);
Assert.AreEqual(expected, actual);
}
public void WhenSendind6And11And2ShouldReturn3()
{
var expectedValue = 3;
var countDiv = new CountDiv();
var actualValue = countDiv.Solution(6, 11, 2);
Assert.AreEqual(expectedValue, actualValue);
}
public void WhenSendind10And10And7ShouldReturn0()
{
var expectedValue = 0;
var countDiv = new CountDiv();
var actualValue = countDiv.Solution(10, 10, 7);
Assert.AreEqual(expectedValue, actualValue);
}
public void CountDiv_Should_Process_Min_Min_Range()
{
CountDiv subject = new CountDiv();
int result = subject.solution(0, 0, 11);
Assert.Equal(1, result);
}
public void WhenSendind11And345And17ShouldReturn20()
{
var expectedValue = 20;
var countDiv = new CountDiv();
var actualValue = countDiv.Solution(11, 345, 17);
Assert.AreEqual(expectedValue, actualValue);
}
public void CountDiv_Should_Process_Simple_Range()
{
CountDiv subject = new CountDiv();
int result = subject.solution(6, 11, 2);
Assert.Equal(3, result);
}
public void WhenSendind0And0And11ShouldReturn1()
{
var expectedValue = 1;
var countDiv = new CountDiv();
var actualValue = countDiv.Solution(0, 0, 11);
Assert.AreEqual(expectedValue, actualValue);
}
public void CountDiv_Should_Process_Alternate_Range()
{
CountDiv subject = new CountDiv();
int result = subject.solution(11, 345, 17);
Assert.Equal(20, result);
}
public void SolutionSimpleThreeTest()
{
// Arrange
int A = 1, B = 24, K = 5;
// Action
int actual = CountDiv.Solution(A, B, K);
// Assert
int expected = 4;
Assert.AreEqual(expected, actual);
}
public void SolutionSimpleTest()
{
// Arrange
int A = 6, B = 11, K = 2;
// Action
int actual = CountDiv.Solution(A, B, K);
// Assert
int expected = 3;
Assert.AreEqual(expected, actual);
}
static void Main(string[] args)
{
PassingCars cars = new PassingCars();
Stopwatch timer = new Stopwatch();
timer.Start();
var test = cars.solution(new[] { 0, 1, 0, 1, 1 });
timer.Stop();
Console.WriteLine("passing cars: " + test);
Console.WriteLine(timer.Elapsed);
timer.Reset();
GenomicRangeQuery query = new GenomicRangeQuery();
timer.Start();
var testArray = query.solution("CAGCCTA", new[] { 2,5,0 }, new []{4,5,6});
timer.Stop();
Console.Write("Genomic range query: ");
foreach (var item in testArray)
{
Console.Write(item + ", ");
}
Console.WriteLine();
Console.WriteLine(timer.Elapsed);
timer.Reset();
MinAvgTwoSlice avg = new MinAvgTwoSlice();
timer.Start();
test = avg.solution(new []{4258,4258,2000,6515,1,50226,10325});
timer.Stop();
Console.Write("minimal average start: " + test);
Console.WriteLine();
Console.WriteLine(timer.Elapsed);
timer.Reset();
CountDiv div = new CountDiv();
timer.Start();
test = div.solution(6, 11, 2);
timer.Stop();
Console.Write("num of divs: " + test);
Console.WriteLine();
Console.WriteLine(timer.Elapsed);
timer.Reset();
}
public void Solution_SmallNumbers_Correct()
{
//Arrange - Given
var startNumer = 5;
var endNumber = 11;
var dividedBy = 2;
//Act - When
var result = CountDiv.Solution(startNumer, endNumber, dividedBy);
//Assert - Then
var expectedResult = 3;
Assert.Equal(expectedResult, result);
}
public int Test(int A, int B, int K)
{
var result = CountDiv.solution3(A, B, K);
return(result);
}
public void Initialize()
{
_countDiv = new CountDiv();
}
static void Main(string[] args)
{
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(9)}");
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(529)}");
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(20)}");
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(15)}");
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(32)}");
Console.WriteLine($"BinaryGap is {BinaryGap.Solution(1041)}");
Console.WriteLine(Environment.NewLine);
var result = CyclicRotation.Solution(new[] { 1, 2, 3, 4 }, 2);
Console.WriteLine($"CyclicRotation: {string.Join('-', result)}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"OddOccurrencesInArray: {OddOccurrencesInArray.Solution(new[] {1, 1, 2, 2, 3, 4, 4})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"FrogJmp: {FrogJmp.Solution(10, 85, 30)}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"PermMissingElem: {PermMissingElem.Solution(new[] {6, 7, 8, 1, 2, 4, 5})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"TapeEquilibrium: {TapeEquilibrium.Solution(new[] {3,1,2,4,3})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"FrogRiverOne: {FrogRiverOne.Solution(5,new[] {1,3,1,4,2,3,6,5,4})}");
Console.WriteLine(Environment.NewLine);
var maxCounter = MaxCounters.Solution(5, new[] { 3, 4, 4, 6, 1, 4, 4 });
Console.WriteLine($"MaxCounters: {string.Join('-', maxCounter)}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"MissingInteger: {MissingInteger.Solution(new []{1, 3, 6, 4, 1, 2})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"PermCheck: {PermCheck.Solution(new []{4,1,3,2})}");
Console.WriteLine($"PermCheck: {PermCheck.Solution(new []{4,1,3})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"CountDiv: {CountDiv.Solution(11, 345, 17)}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"PassingCars: {PassingCars.Solution(new []{0,1,0,1,1})}");
Console.WriteLine(Environment.NewLine);
// Console.WriteLine($"MinAvgTwoSlice: {MinAvgTwoSlice.Solution(new []{4,2,2,5,1,5,8})}");
// Console.WriteLine(Environment.NewLine);
//
Console.WriteLine($"MaxProductOfThree: {MaxProductOfThree.Solution(new []{-3,1,2,-2,5,6})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"Triangle: {Triangle.Solution(new []{10,2,5,1,8,20})}");
Console.WriteLine($"Triangle: {Triangle.Solution(new []{10,50,5,1})}");
Console.WriteLine(Environment.NewLine);
Console.WriteLine($"Brackets: {Brackets.Solution("{[()()]}")}");
Console.WriteLine($"Brackets: {Brackets.Solution("([)()]")}");
Console.WriteLine(Environment.NewLine);
}
public void CountDivSolutionTestWithValueZero()
{
CountDiv countDivTest = new CountDiv();
Assert.AreEqual(1, countDivTest.Solution(0, 0, 11));
}
public void CountDivSolutionTestWithValueEquals()
{
CountDiv countDivTest = new CountDiv();
Assert.AreEqual(0, countDivTest.Solution(10, 10, 7));
}
public void DevidingByOneTest()
{
Assert.AreEqual(7, CountDiv.Solution(4, 10, 1));
}
public void JustOneTest()
{
Assert.AreEqual(1, CountDiv.Solution(6, 10, 5));
}
public void OtherExampeTest()
{
Assert.AreEqual(2, CountDiv.Solution(7, 11, 2));
}
public void ExampleTest()
{
Assert.AreEqual(3, CountDiv.Solution(6, 11, 2));
}
public void FromZeroGotZeroTest()
{
Assert.AreEqual(1, CountDiv.Solution(0, 8, 10));
}
public void CountDivSolutionTest()
{
CountDiv countDivTest = new CountDiv();
Assert.AreEqual(1, countDivTest.Solution(6, 11, 7));
}
public CountDivTest()
{
_cd = new CountDiv();
}
public void DevidingBy2Test()
{
Assert.AreEqual(5, CountDiv.Solution(0, 8, 2));
}
