RationalAsh

import Data.List (sort, group)
import qualified Data.Map as M
import Control.Monad

sampleStr = "CJQUIZKNOWBEVYOFDPFLUXALGORITHMS" :: String

sampleN = 103 :: Integer
sampleNums =  [217, 1891, 4819, 2291, 2987, 3811, 1739, 2491, 4717, 445, 65, 1079, 8383, 5353, 901, 187, 649, 1003, 697, 3239, 7663, 291, 123, 779, 1007, 3551, 1943, 2117, 1679, 989, 3053] :: [Integer]
sampleNums2 = [9, 9, 9, 21, 217, 1891, 4819, 2291, 2987, 3811, 1739, 2491, 4717, 445, 65, 1079, 8383, 5353, 901, 187, 649, 1003, 697, 3239, 7663, 291, 123, 779, 1007, 3551, 1943, 2117, 1679, 989, 3053] :: [Integer]
sampleNums3 = [15, 15, 15, 35, 217, 1891, 4819, 2291, 2987, 3811, 1739, 2491, 4717, 445, 65, 1079, 8383, 5353, 901, 187, 649, 1003, 697, 3239, 7663, 291, 123, 779, 1007, 3551, 1943, 2117, 1679, 989, 3053] :: [Integer]

RationalAsh

import Control.Monad

sampleMoves = "EESSSESE"

applyMove :: (Int, Int) -> Char -> (Int, Int)
applyMove (row, col) move
    | move == 'S' = (row+1, col)
    | move == 'E' = (row, col+1)
    | otherwise = (row, col)

RationalAsh

import Control.Monad

getA :: [Char] -> [Char]
getA n = map (\x -> if x == '4' then '2' else '0') n

getB :: [Char] -> [Char]
getB n = map (\x -> if x == '4' then '2' else x) n

solveCase :: [Char] -> (String, String)
solveCase n = (getA n, getB n)

RationalAsh

#!/usr/bin/python

#My implementation of self organizing maps

import numpy as np
import matplotlib.pyplot as plt
from scipy.spatial.distance import pdist, cdist
import time

RationalAsh

#!/usr/bin/python

import numpy as np
from numpy import dot, random
import matplotlib.pyplot as plt
import time

def softmax(x):
    exps = np.nan_to_num(np.exp(x))
    return exps/np.nan_to_num(np.sum(exps))

RationalAsh

#!/usr/bin/python

import numpy as np
import matplotlib.pyplot as plt

def create_number_spiral(N):
    '''Creates a number spiral as
    a square matrix of size N'''

    X = np.ndarray((N,N))

RationalAsh

#!/usr/bin/python

import numpy as np
import matplotlib.pyplot as plt
from scipy.signal import square

#Mean Square error function
def costf(X, y, theta):
    m = y.shape[0]
    #print m

RationalAsh

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.