jxlin

Array

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array

jxlin

-- 1. Find the names of all students who are friends with someone named Gabriel. 

SELECT H1.name
FROM Highschooler H1
INNER JOIN Friend ON H1.ID = Friend.ID1
INNER JOIN Highschooler H2 ON H2.ID = Friend.ID2
WHERE H2.name = "Gabriel";


-- 2. For every student who likes someone 2 or more grades younger than themselves, return that student's name and grade, and the name and grade of the student they like. 

jxlin

Udacity Self-Drive Car ND Equations in Latex

Equations in LaTex of the Udacity's Self-Drive Car Nanodegree lectures.

Term 2

MP Controller

State

[ x_1, y_1, \psi_1, v_1, cte_1, e\psi_1]

jxlin

+----------------------------------------------+---------------------+
|                 Company Name                 | Nbr of job postings |
+----------------------------------------------+---------------------+
|                  CivilMaps                   |          4          |
|             Booz Allen Hamilton              |          1          |
|                    Delphi                    |          15         |
|            ISP Optics Corporation            |          3          |
|                Stride Search                 |          7          |
|                 Rand McNally                 |          1          |
|                    Zemax                     |          1          |

jxlin

import java.io.*;
import java.util.*;

/** The class encapsulates an implementation of the Apriori algorithm
 * to compute frequent itemsets.
 * 
 * Datasets contains integers (>=0) separated by spaces, one transaction by line, e.g.
 * 1 2 3
 * 0 9
 * 1 9