This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Given an array (for example, [ 1, 0, 2, 0, 0, 3, 4 ]), implement a method that | |
1. returns the number of non-zero elements (4) | |
2. moves the non-zero elements to the beginning of the array (the rest of the elements don't matter) | |
-> both [ 1, 2, 3, 4, 0, 0, 0] and [ 4, 1, 3, 2, X, Y, Z ] are valid | |
*/ | |
@interface FB : NSObject |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
for family in UIFont.familyNames { | |
Swift.print("family is \(family)") | |
let specificFamilyName = family as String | |
for fontName in UIFont.fontNames(forFamilyName: specificFamilyName) | |
{ | |
Swift.print("family name is \(fontName)") | |
} | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
reverseString(char *array, int start, int end) | |
{ | |
int rightIndex = end; | |
for(int leftIndex = start; leftIndex < rightIndex; leftIndex++) | |
{ | |
char swapChar = array(rightIndex); | |
array(rightIndex) = array(leftIndex); | |
array(leftIndex) = swapChar; | |
rightIndex--; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
My first attempt was a brute force attempt. I didn't even try to come up with the (time) complexity of this, at least while I was on-site. | |
// in Objective C everything is 0 (zero) based... but on my white board | |
// my tic-tac-toe grid object was 1 based... | |
// we might want to check if the game is valid even before | |
// we waste time looking to see if there's a winning set of three | |
- (BOOL) isValidGame: (Grid *) grid | |
{ | |
int totX = 0; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- (NSComparisonResult)fileNameCompare:(NSString *)aString | |
{ | |
NSComparisonResult result; | |
// split string1 and string2 each into two halves | |
// | |
// then compare string1 and string2's halves with each other | |
NSString * firstHalfOfSelf = [NSString getFirstHalfOf: self]; | |
NSString * firstHalfOfOtherString = [NSString getFirstHalfOf: aString]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// instructions for actually running & trying this out are at the bottom of this file... | |
@interface LList : NSObject | |
{ | |
NSInteger _currentValue; | |
LList * _next; | |
} | |
- (void) insert: (NSInteger) valueToInsert; | |
- (void) printValue; |
NewerOlder