dautermann

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--;
    }

dautermann

/*
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

dautermann

- (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];

dautermann

@interface EncryptDecrypt (NSString)

- (NSString *) encrypt;

- (NSString *) decrypt;

@end

@implementation EncryptDecrypt {

dautermann

// The way I would approach this problem would be to save a set of two distinct dates to 
// NSUserDefaults and if these three days (the two days from the set plus today's third date) lie within the last five days,
// I'll show the alert.  If we have two dates in the set, replace the oldest with the newest/current date.

// I'm using NSSet because it's distinct dates, versus an array where we might have duplicate dates.

// I'm making JetDate as a subclass of NSDate where the time component of NSDate (02-17-2015 00:00:00 GMTz) 
// is dropped and only the date is considered

- (BOOL) shouldShowRatingAlert

dautermann

//  Copyright © 2016 Envoy. All rights reserved.

/*
 
 Write a Swift playground that takes an n x n grid of integers. Each integer can be either 1 or 0.
 
 The playground then outputs an n x n grid where each block indicates the number of 1's around that block, (excluding the block itself) . For Block 0 on row 0, surrounding blocks are (0,1) (1,0) and (1,1). Similary for block (1,1) all the blocks around it are to be counted as surrounding blocks.
 
 Requirements:

dautermann

/* The following was a coding question given during an interview for LinkedIn in March, 2017 */

/* This class will be given a list of words (such as might be tokenized
 * from a paragraph of text), and will provide a method that takes two
 * words and returns the shortest distance (in words) between those two
 * words in the provided text.
 * Example:
 *   WordDistanceFinder finder = new WordDistanceFinder(Arrays.asList("the", "quick", "brown", "fox", "quick"));
 *   assert(finder.distance("fox", "the") == 3);
 *   assert(finder.distance("quick", "fox") == 1);

dautermann

// A telephone keypad has letters associated with each number  (e.g. 2 = abc, 3 = def).
// Given a passphrase of "fb1" (e.g. one that you might use to log into a bank account),
// come up with an algorithm that would assemble an array that contains all the
// different possible letter combinations that, when typed into a telephone dial pad,
// would be equivalent to the original passphrase.  That is, "fb1" equals "321" numerically;
// matching equivalent combinations include: "da1", "db1", "dc1", "ea1", "eb1", "ec1", "fa1" and "fc1".

// This can be dropped into an iOS Playground in Xcode

dautermann

// 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;

dautermann

#import <Cocoa/Cocoa.h>

@interface AddAliasToDesktopUtility : NSObject {

}
    
- (BOOL) addAliasNow;

@end