public static Node FindKthToLastNode(DoublyLinkedList list, int k)
{
int N = list.Length;
if (k > N)
{
return(null);
}
else if (k == N)
{
return(list.Head);
}
//N - k = nth node
//find node k+1 from last, get its next
Node kthPlus1Node = FindKthToLastNode(list, k + 1);
Node kthNode = kthPlus1Node.Next;
return(kthNode);
}
public override void ViewDidLoad()
{
base.ViewDidLoad();
this.DoRemoveDuplicates();
this.DoBuildOrder();
var threeSumList = new List <int> {
-1, 0, 1, 2, -1, -4
};
var sets = BBB.ThreeSum(threeSumList);
var set = new HashSet <string> {
"a", "aa", "aaa"
};
var strDeletion = LeetcodeApp.StringDeletion("abaacdefa", set);
//var str1 = LeetcodeApp.Compress("aaabbbcdeee");
//var combos = LeetcodeApp.GetAllParenthesisCombos("1|0&1");
DoKthMostFrequentString();
//DoShortestPathBBB16();
var graph = new Graph();
graph.AddVertex(0);
graph.AddVertex(1);
graph.AddVertex(2);
graph.AddVertex(3);
graph.AddVertex(4);
graph.AddVertex(5);
graph.AddVertex(6);
graph.AddUndirectedEdge(0, 1);
graph.AddUndirectedEdge(0, 2);
graph.AddUndirectedEdge(1, 3);
graph.AddUndirectedEdge(1, 2);
graph.AddUndirectedEdge(2, 4);
graph.AddUndirectedEdge(3, 4);
graph.AddUndirectedEdge(4, 5);
graph.AddUndirectedEdge(5, 6);
var arrMagic = new int[] { -10, -5, -2, 0, 1, 2, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13 };
var magicIndex = LeetcodeApp.GetMagicIndexDups(arrMagic);
var consecutiveCount = LeetcodeApp.ConsecutiveArray(arrMagic);
var arr1 = new int[] { 2, 4, 6 };
var arr2 = new int[] { 1, 3, 5 };
var median = LeetcodeApp.GetMedianOfArrays(arr1, arr2);
var array2D = new int[, ] {
{ -1, 2, 3 }, { 4, 5, -6 }, { 7, 8, 9 }
};
var maxProd = LeetcodeApp.MaxProduct(array2D, 3, 3);
var leet = new LeetcodeApp();
var list = new DoublyLinkedList(1);
list.Append(2);
list.Append(3);
list.Append(5);
list.Append(7);
list.ReverseR(list.Head);
list.PrintList();
list.PrintHeadAndTailVals();
var node = LeetcodeApp.FindKthToLastNode(list, 4);
var r = 5;
var c = 5;
var maze = new int[5, 5];// { { 1,2,3,4,5},{4,5,6,7,8 }};
var numways = LeetcodeApp.WaysToNavigateMaze(maze, r, c);
//var a = new List<int> { 1, 2, 3 ,4, 5, -43,1,-5,-3,4,2};
//var subsets = LeetcodeApp.GetAllSubsets(a, 0);
//var permutations = leet.Permute(new int[] { 1, 2, 3 }, null);
var perms = leet.GetPerms("123");
LeetcodeApp.NextPermutation(new int[] { 3, 2, 1 });
Debug.WriteLine("kth: " + LeetcodeApp.KthGrammar(4, 1));
var str = "aeifjlkjaasdfsdytvka";
Debug.WriteLine("longest substring of " + str + ": " + LeetcodeApp.LengthOfLongestSubstring(str));
var list1 = new DoublyLinkedList(4);
list1.Append(6);
list1.Append(7);
list1.Append(8);
var list2 = new DoublyLinkedList(7);
list2.Append(2);
list2.Append(9);
list2.Append(8);
list2.Append(4);
list2.Append(3);
var sum = LeetcodeApp.AddTwoNumbersR(list1.Head, list2.Head);
var arr = new int[] { 3, 5, -1, 8, 12 };
//Debug.WriteLine(SortingOps.ArrayAddition(arr));
//var math = new MyMath();
//Debug.WriteLine(math.GetFibonacciNumber(7));
//Debug.WriteLine(GetFibonacciNumber(5));
//Debug.WriteLine(StringOperations.ReverseStringRecursive("fokie a doogie"));
//var nums = new List<int> { 0,3,2,8,5,9,6,4,7,1,8 };
//var numsSorted = SortingOps.MergeSort(nums);
//foreach (int num in numsSorted)
//{
// Debug.WriteLine(num);
//}
DoTreeStuff();
}