private static void AmazonProblem4()
{
//Problem 4
//Find LCA of a BST
var lcaBinarySTree = new BinaryTree(20);
lcaBinarySTree.left = new BinaryTree(8);
lcaBinarySTree.left.left = new BinaryTree(4);
lcaBinarySTree.left.right = new BinaryTree(12);
lcaBinarySTree.left.right.left = new BinaryTree(10);
lcaBinarySTree.left.right.right = new BinaryTree(14);
lcaBinarySTree.right = new BinaryTree(22);
var lcabst = new LCABST();
lcabst.FindLCA(lcaBinarySTree, 10, 14);
}
static void Main(string[] args)
{
MaxSlidingWindowSolution.Test();
MinWindowString.Test();
LCABST.Test();
IList <IList <int> > final = new List <IList <int> >(1000);
List <int> current = new List <int>();
Solution sl = new Solution();
Coding.ListNode head = new Coding.ListNode(3);
head.next = new Coding.ListNode(4);
head.next.next = new Coding.ListNode(1);
//head.next.next.next = new Array.ListNode(4);
head = sl.SortList(head);
int[] test = { -1, -1, -2, -2 };
sl.MaxProductInt(test);
char[,] m = new char[2, 2];
m[0, 0] = '0';
m[0, 1] = '1';
m[1, 0] = '1';
m[1, 1] = '0';
sl.MaximalSquare(m);
sl.MaximalRectangle(m);
bool m1 = sl.IsMatch("abefcdgiescdfimde", "ab*cd?i*de");
bool m2 = sl.IsMatch2("abefcdgiescdfimde", "ab*cd?i*de");
m1 = sl.IsMatch2("ab", "*?*?*");
m1 = sl.IsMatchRegex("aaa", "ab*a*c*a");
//MinStack ms = new MinStack();
//ms.Push(-2);
//ms.Push(0);
//ms.Push(-1);
//Console.WriteLine(ms.GetMin());
//Console.WriteLine(ms.Top());
//ms.Pop();
//Console.WriteLine(ms.GetMin());
//Triangle.TestTriangle();
//MaxSumOfSubArray.Test();
//MousesandHoles.Test();
//UniqueBST.Test();
//BASH_Brace.Test();
//Calculator.Test();
//MaxSubProduction.TestMaxSubProduction();
//DecodingWays.Test();
//MousesandHoles.Test();
//FindMaxSubArraySumWithDuplicate.Test();
//FindConnectedGraph.Test();
//H2O.Simulate();
//WordsLadderLength.TestGetLadderLength();
//UniquePath.Test();
//MinPath.Test();
//Interleave.Test();
//DistinctSubSequences.Test();
//PrintParathesies.Test();
//MaxRectangle.Test();
//RegexMatch.Test();
//SumRootToLeafNumbers.Test();
//ValidateBST.Test();
//MaxBitWindowFlip.Test();
//Console.WriteLine(Palindrome.IsPalindrom("a b c d e f gGrF!,ED C B A"));
//Stock.TestMaxProfit();
//ReverseWordsInString.TestReverseWordsInString();
//MaxTreeNodePathSum.TestFindMaxPath();
//FindClosestShareFather.TestclosestFather();
//Permutation.TestFullPermutation();
//MaxSubProduction.TestMaxSubProduction();
//Combination.TestFullCombination();
//SubSet.TestSubSet();
//Triangle.TestTriangle();
//Parethesis.TestValidParathesisString();
//UniqueBST.TestNumOfUniqueBST();
//MaxNumOfCars.TestMaxNumOfCars();
//Sorting.Test();
//Palindrome.Test();
//MaxBitWindowFlip.Test();
//HighestInterval.Test();
//TreeNextRightPointers.Test();
//GroupNumbers.Test();
//MakeChange.Test();
//FirstMissingInteger.Test();
//MaxAccendingSubSeq.Test();
//CloneGraphI.Test();
//SortLinkedList.Test();
//WordBreaker.Test();
//CombineMaxSolution.Test();
}