Nathan Arnold nbarnold01
nbarnold01
/ Hacker Rank: Pairs
Created
November 11, 2015 09:25
This file contains 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
| #import <Foundation/Foundation.h> | |
| int main(int argc, const char * argv[]) { | |
| @autoreleasepool { | |
| // insert code here... | |
| int numberOfIntegers = 0; | |
| scanf("%d", &numberOfIntegers); |
nbarnold01
/ Hacker Rack: Swap Nodes [Algo]
Created
November 10, 2015 13:25
This file contains 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
| // | |
| // main.cpp | |
| // Swap Nodes [Algo] | |
| // | |
| // Created by Nathan Arnold on 11/10/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #include <cmath> | |
| #include <cstdio> |
nbarnold01
/ Hacker Rank: Sherlock and Array
Created
November 9, 2015 20:40
This file contains 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
| // | |
| // main.m | |
| // Sherlock and Array | |
| // | |
| // Created by Nathan Arnold on 11/9/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
nbarnold01
/ Hacker Rank: Sherlock and the Beast
Created
November 9, 2015 15:50
This file contains 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
| // | |
| // main.m | |
| // Sherlock and the Beast | |
| // | |
| // Created by Nathan Arnold on 11/9/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
nbarnold01
/ Hacker Rank: Angry Professor
Created
November 9, 2015 14:28
This file contains 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
| // | |
| // main.m | |
| // Angry Professor | |
| // | |
| // Created by Nathan Arnold on 11/9/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
nbarnold01
/ Hacker Rank: Breadth First Search: Shortest Reach
Created
November 9, 2015 14:09
This file contains 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
| //Enter your code here. Read input from STDIN. Print output to STDOUT// | |
| // main.m | |
| // Breadth First Search: Shortest Reach | |
| // | |
| // Created by Nathan Arnold on 11/1/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
nbarnold01
/ Hacker Rank: Alternating Characters
Created
November 4, 2015 11:02
This file contains 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
| #import <Foundation/Foundation.h> | |
| int deletionsRequiredForString (char buffer[], int length) { | |
| int deletions = 0; | |
| if (length > 1) { | |
nbarnold01
/ Hacker Rank: Gemstones
Created
November 2, 2015 10:35
This file contains 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
| #import <Foundation/Foundation.h> | |
| int main(int argc, const char * argv[]) { | |
| @autoreleasepool { | |
| // insert code here... | |
| int numOfStones = 0; | |
| scanf("%d", &numOfStones); | |
| NSMutableArray *stoneList = [NSMutableArray arrayWithCapacity:numOfStones]; | |
nbarnold01
/ Hacker Rank: Stock Maximize
Created
November 1, 2015 14:51
This file contains 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
| // | |
| // main.m | |
| // Stock Maximize | |
| // | |
| // Created by Nathan Arnold on 11/1/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
nbarnold01
/ Hacker Rank: Flipping Bits
Created
November 1, 2015 12:11
This file contains 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
| // | |
| // main.m | |
| // Flipping Bits | |
| // | |
| // Created by Nathan Arnold on 11/1/15. | |
| // Copyright © 2015 Nathan Arnold. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
NewerOlder