CareerCup

Given the following filename/rules:

johndoe_sdfjkldfj_ldfjlkfdsjfds_dfdjklfdsjs.txt

Rules:
johndoe is a distinct identifier (not a constant)
any following items are tacked on with underscores separating them and each token contains a key value pair. The key is the first character and the value is the remaining characters.

Parse this filename and return a dictionary/hashtable of values, removing any file extensions but also keeping in mind that this filename could end up with incorrect characters or incorrect amounts of characters.

Example input:
johndoe_sdfjkldfj_ldfjlkfdsjfds_dfdjklfdsjs.txt

Example output:

@{ @"NAME" : @"johndoe",
@"s" : @"dfjkldfj",
@"l" : @"dfjlkfdsjfds",
@"d": @"fdjklfdsjs"
};

Followup: How would you handle it if you found multiple tokens with the same key?

Design and code the logic software for an elevator, pretending like the hardware is already there for you with the following APIs:
- OpenDoor()
- GotoFloor()

Given 2 sorted lists that are of even and equal size, output the median. If there is no middle number, return the average of the 2 middle numbers

Given an array of words, write a method that determines whether there are any words in this array that are anagrams of each other.

Sample #1: @[@"bag", @"bat", @"tab"]; // output TRUE

Sample #2: @[@"gab", @"bat", @"laf"]; // output FALSE

An UIView A2 is subclassed from the same parent as an UIView A1.

Given inputs of A1, A2, and an UIView that is in the tree of UIViews of A1 somewhere, return the exact UIView that mirrors this in A2.

Example setup:

A1------------
| |
UIView UIView
|
UIView <-- Given this

A2------------
| |
UIView UIView
|
UIView <-- Find/return this

Given a list of n sorted lists of numbers, write a method that returns one giant list of all the numbers in order.

Example input:

NSArray* input = @[
@[@2, @5, @10],
@[@25, @100, @105],
@[@7, @56, @42],
.......
];

Given the following hashmap for numeric to alpha translation of a telephone keypad:

NSDictionary* dict = @{@2: @[@"A", @"B", @"C"],
@3: @[@"D", @"E", @"F"],
@4: @[@"G", @"H", @"I"],
@5: @[@"J", @"K", @"L"],
@6: @[@"M", @"N", @"O"],
@7: @[@"P", @"Q", @"R", @"S"],
@8: @[@"T", @"U", @"V"],
@9: @[@"W", @"X", @"Y", @"Z"]};

Write a method that takes a phone number as input and returns all possible letter combinations for that phone number.