Assuming you meant B A C on three lines (plus no typo on main method name): namespace ConsoleApplication1 { public class BaseHome { static BaseHome() { Console.WriteLine(“B”); AppDomain.CurrentDomain.ProcessExit += new EventHandler(OnProcessExit); } public static void Main() { Console.WriteLine(“A”); } private static void OnProcessExit(object sender, EventArgs e) { Console.WriteLine(“C”); Console.Read(); } } }
The interesting thing here is how you can do it in the least amount of drops possible. Going to the 50th floor and dropping the first would be disastrous if the breaking floor is the 49th, resulting in us having to do 50 drops. We should drop the first marble at floor n, where n … Read more
If you want O(n) time and no extra memory usage (since array was specified), use the algorithm from Jon Bentley’s book, “Programming Pearls 2nd Edition”. It swaps all the elements twice. Not as fast as using linked lists but uses less memory and is conceptually simple. shiftArray( theArray, M ): size = len( theArray ) … Read more
The fastest (O(n)) and most memory efficient (O(1)) way is with the XOR operation. In C: int arr[] = {3, 2, 5, 2, 1, 5, 3}; int num = 0, i; for (i=0; i < 7; i++) num ^= arr[i]; printf(“%i\n”, num); This prints “1”, which is the only one that occurs once. This works … Read more
The algorithm only works when the set has a majority — more than half of the elements being the same. AAACCBB in your example has no such majority. The most frequent letter occurs 3 times, the string length is 7.
You have to tell the compiler which version to use. In C++, you can do it three ways. Explicitly differentiate the calls by typing You somewhat cheated because you sent an integer to a function waiting for a char, and wrongly sent the number six when the char value of ‘6’ is not 6 but … Read more
Sounds like a standard reduce to me: Python: def excel2num(x): return reduce(lambda s,a:s*26+ord(a)-ord(‘A’)+1, x, 0) C#: int ExcelToNumber(string x) { return x.Aggregate(0, (s, c) => s * 26 + c – ‘A’ + 1 ); }
Under the assumption numbers less than one are not allowed and there are no duplicates, there is a simple summation identity for this – the sum of numbers from 1 to m in increments of 1 is (m * (m + 1)) / 2. You can then sum the array and use this identity. You … Read more
Statistics. The de facto standard for testing RNGs is the Diehard suite (originally available at http://stat.fsu.edu/pub/diehard). Alternatively, the Ent program provides tests that are simpler to interpret but less comprehensive. As for shuffling algorithms, use a well-known algorithm such as Fisher-Yates (a.k.a “Knuth Shuffle”). The shuffle will be uniformly random so long as the underlying … Read more
Project Euler It’s not Java specific, but a good Programming Challenge site for any language.