Sergei Demchenko antrix1989
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
| // | |
| // main.m | |
| // alg | |
| // | |
| // Created by Sergey Demchenko on 10/6/16. | |
| // Copyright © 2016 Antrix. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
antrix1989
/ Implement an algorithm to print all valid (e.g., properly opened and closed) combi- nations of n-pairs of parentheses.
Created
April 25, 2017 23:14
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
| // | |
| // main.m | |
| // alg | |
| // | |
| // Created by Sergey Demchenko on 10/6/16. | |
| // Copyright © 2016 Antrix. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
antrix1989
/ 1.7 Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0.
Created
April 24, 2017 17:04
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
| // | |
| // main.m | |
| // alg | |
| // | |
| // Created by Sergey Demchenko on 10/6/16. | |
| // Copyright © 2016 Antrix. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
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
| // | |
| // main.m | |
| // alg | |
| // | |
| // Created by Sergey Demchenko on 10/6/16. | |
| // Copyright © 2016 Antrix. All rights reserved. | |
| // | |
| #import <Foundation/Foundation.h> |
antrix1989
/ 225. Implement Stack using Queues
Created
April 19, 2017 02:17
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
| #import <Foundation/Foundation.h> | |
| //225. Implement Stack using Queues | |
| @interface NSMutableArray (QueueAdditions) | |
| - (id) dequeue; | |
| - (void)enqueue:(id)obj; | |
| @end |
antrix1989
/ 98. Validate Binary Search Tree
Created
April 18, 2017 05:46
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
| #import <Foundation/Foundation.h> | |
| //Given a binary tree, return all root-to-leaf paths. | |
| // | |
| //For example, given the following binary tree: | |
| // | |
| // 1 | |
| // / \ | |
| // 2 3 | |
| // \ |
antrix1989
/ 257. Binary Tree Paths
Created
April 14, 2017 04:27
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
| #import <Foundation/Foundation.h> | |
| //Given a binary tree, return all root-to-leaf paths. | |
| // | |
| //For example, given the following binary tree: | |
| // | |
| // 1 | |
| // / \ | |
| // 2 3 | |
| // \ |
antrix1989
/ 112. Path Sum
Created
April 14, 2017 03:54
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
| #import <Foundation/Foundation.h> | |
| //Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. | |
| // | |
| //For example: | |
| //Given the below binary tree and sum = 22, | |
| // 5 | |
| // / \ | |
| // 4 8 | |
| // / / \ |
antrix1989
/ Same Tree
Created
April 14, 2017 03:36
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
| #import <Foundation/Foundation.h> | |
| //Same Tree. | |
| @interface Node: NSObject | |
| @property (nonatomic) Node *left; | |
| @property (nonatomic) Node *right; | |
| @property (nonatomic) NSString *value; | |
| @end |
antrix1989
/ Maximum Depth of Binary Tree
Created
April 14, 2017 03:09
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
| #import <Foundation/Foundation.h> | |
| //Given a binary tree, find its maximum depth. | |
| @interface Node: NSObject | |
| @property (nonatomic) Node *left; | |
| @property (nonatomic) Node *right; | |
| @property (nonatomic) NSString *value; | |
| @end |
NewerOlder