rxmichael

Keybase proof

I hereby claim:

• I am rxmichael on github.
• I am michaeleid (https://keybase.io/michaeleid) on keybase.
• I have a public key ASA6opLz6bjl67QoVoBSnlRGlCA6D0dmLXCbvd9_uGcx7Qo

To claim this, I am signing this object:

rxmichael

Keybase proof

I hereby claim:

• I am teressaeid on github.
• I am teressaeid (https://keybase.io/teressaeid) on keybase.
• I have a public key ASC6YNW4FoMLYpqOWM-WWUQtaG4enMn3BdYDC9AOe1kBoQo

To claim this, I am signing this object:

rxmichael

#!/bin/bash

sources="https://github.com/CocoaPods/Specs.git"
podRepo="INSERT YOUR PRIVATE POD REPO HERE"

echo "--------tag list--------"
git tag -l
echo "--------tag list--------"

rxmichael

/** 
This is an example of a REST API Network Manager. We have implemented the retreive method to work via an HTTP GET request to the API
Alamofire is used for simplicity of showing the request
**/
import Foundation
import Alamofire

class APIManager: NetworkManagaer {
	
	

rxmichael

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

rxmichael

import Foundation
import UIKit

/** Extends UIColor to initialize UIColor using hex values, f.e. UIColor(hex: 0x8046A2) */
extension UIColor {
    convenience init(hex: Int, alpha: CGFloat) {
        let r = CGFloat((hex & 0xFF0000) >> 16)/255
        let g = CGFloat((hex & 0xFF00) >> 8)/255
        let b = CGFloat(hex & 0xFF)/255
        self.init(red: r, green: g, blue: b, alpha: alpha)

rxmichael

import java.util.HashMap;
import java.util.Iterator;
public class LRUCache<K,V>
{
	// generic node class used to store key/value
	class Node <K,V> {
		K key;
		V value;
		Node next;
		Node prev;