public void SampleArray1()
{
List <int> input = new List <int>()
{
0, 2, 3, 5, 4, 1
};
List <int> expectedOutput = new List <int>()
{
0, 1, 2, 3, 4, 5
};
var output = CyclicSort.Sort(input);
expectedOutput.Should().BeEquivalentTo(output);
}
private static void ExistingCases()
{
Console.WriteLine("This is DB practice session..");
Console.WriteLine("Press 1 for Binary search tree");
Console.WriteLine("Press 2 for two sum problem");
Console.WriteLine("Press 3 for Maximum Area Cake problem");
Console.WriteLine("Press 4 for Find Inflection point.");
Console.WriteLine("Press 5 for Max heap.");
Console.WriteLine("Press 6 for Longest substring.");
Console.WriteLine("Press 7 for Reverse linked list.");
Console.WriteLine("Press 8 for Reverse linked list.");
int option = 5;
switch (option)
{
case 1:
BinarySearchOperations();
break;
case 2:
RandomProblems.TwoSumProblem();
break;
case 3:
MaximumAreaCake.MaximumAreaCakeCaller();
break;
case 4:
CodeFindInflectionPoint.FindInflectionPoint();
break;
case 5:
MaxHeap.Test();
break;
case 6:
LongestSubstring.Test();
break;
case 7:
ReverseListSolution.Test();
break;
case 8:
SlidingWindows.Test();
break;
case 9:
SlowAndFastPointers.Tests();
break;
case 10:
CyclicSort.Tests();
break;
case 11:
FastAndSlowPointers.Tests();
break;
case 12:
MergeIntervals.Tests();
break;
default:
break;
}
}
