OmkarRajam

/**
 * Calculates if a given point `point` lies above a given line `p1p2`
 * THIS FUNCTION DOES NOT RETURN BOOLEANS. It has three different return values, above = 1, below = -1, on the line = 0.
 * @param  {[x, y]} point The point to test for
 * @param  {[x, y]} p1    The starting point of a line
 * @param  {[x, y]} p2    The ending point of a line
 * @return {number}       1 = above, -1 = below, 0 = exactly on the line
 */
function pointAboveLine(point, p1, p2) {
    // first, horizontally sort the points in the line

OmkarRajam

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.