Skip to content

Instantly share code, notes, and snippets.

View antrix1989's full-sized avatar

Sergei Demchenko antrix1989

22 followers · 11 following
  • Microsoft
  • Vancouver, BC
View GitHub Profile
@antrix1989
antrix1989 / Remove Duplicates from Sorted Array
Created April 11, 2017 01:17
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 5.1 You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting at j)
Created November 27, 2016 06:04
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.8 You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to start at the root.
Created November 27, 2016 01:03
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.7 You have two very large binary trees: T1, with millions of nodes, and T2, with hun- dreds of nodes. Create an algorithm to decide if T2 is a subtree of T1.
Created November 26, 2016 21:44
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.6 Design an algorithm and write code to findnd the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data structure. NOTE: This is not necessarily a binary search tree.
Created November 25, 2016 01:13
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.5 Write an algorithm to nd the ‘next’ node (i.e., in-order successor) of a given node in a binary search tree where each node has a link to its parent.
Created November 24, 2016 04:51
@antrix1989
antrix1989 / 4.4 Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, you’ll have D linked lists).
Last active November 23, 2016 06:34
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.3 Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.
Created November 23, 2016 03:51
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / 4.1 Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is de ned to be a tree such that no two leaf nodes di er in distance from the root by more than one.
Created November 23, 2016 02:05
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>
@antrix1989
antrix1989 / Symbol table.
Last active November 22, 2016 04:53
//
// main.m
// alg
//
// Created by Sergey Demchenko on 10/6/16.
// Copyright © 2016 Antrix. All rights reserved.
//
#import <Foundation/Foundation.h>