update

Author: stephenhuh

Diff for: algorithms

@@ -0,0 +1 @@
+Subproject commit 43eb9660394525c2204b96c19d0337681202f870

Diff for: cpp/3

@@ -0,0 +1,15 @@
+#include <iostream>
+#include <cstdio>
+using namespace std;
+
+int main() {
+	int a;
+	long b;
+	long long c;
+	char d;
+	float e;
+	double f;
+	scanf("%d %ld %lld %c %f %lf", &a, &b, &c, &d, &e, &f); 
+	printf("%d %ld %lld %c %f %lf", a, b, c, d, e, f );
+	return 0;
+}

Diff for: cpp/a.out

@@ -0,0 +1,16 @@
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+
+int main() {
+	int a, b, c, sum;
+	cin >> a >> b >> c;
+	sum = a + b + c;
+	cout << a+b+c;
+    return 0;
+}
+

Diff for: cpp/basicdatatypes.cpp

@@ -0,0 +1,62 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct Node{
+		int data;
+		Node* next;
+};
+
+/*
+Node* Insert(Node* head, int data){
+	Node* curr = head;
+	Node* add = new Node;
+	add->data = data;
+	add->next = NULL;
+	while (curr->next != NULL){ //trying to access null object right here
+		curr=curr->next;	
+	}
+	curr->next = add;
+	if (!head)
+		head = add;
+	return head;
+};
+*/
+
+Node* Insert(Node* head, int data){
+	Node* add = new Node;
+	add->data = data;
+	add->next = NULL;
+	//empty case
+	if (!head){
+		//account
+		head = add;	
+	} else {
+		Node* curr = head;
+		while (curr->next){
+			curr = curr->next;
+		}
+		curr->next = add;
+	}
+	return head;
+}
+
+
+void Print (Node *head) {
+	Node* curr = head;
+	while (curr){
+		printf("%d\n", curr->data);
+		curr=curr->next;
+	}
+}
+
+int main(){
+	Node* test = new Node();
+	test->data = 4;
+	test->next = NULL; 
+
+	Insert(Insert(Insert(test, 3), 9),0);
+	Print(test);
+
+	Print(Insert(NULL, 2));
+	return 0;
+}

Diff for: cpp/inputoutput.cpp

@@ -11,15 +11,8 @@ Node* Insert(Node *head, int data){
 		Node* curr = head;
 		Node* addon = new Node();
 		addon->data = data;
-		curr->next = addon;
-		if (!head)
-			return addon;
-		
-		while (curr->next){
-			curr = curr->next;	
-		}
-
-		return head;
+		addon->next = curr;
+		return addon;
 }
 
 void Print (Node *head) {

Diff for: datastructures/1

@@ -0,0 +1,44 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct Node{
+		int data;
+		Node* next;
+};
+
+
+Node* Insert(Node *head, int data, int position){
+	Node* curr = head;
+	Node* addon = new Node();
+	addon->data = data;
+	for (int i = 0; i < position; i++){
+		curr = curr->next;	
+	
+	}
+
+
+	return head;
+}
+
+void Print (Node *head) {
+	Node* curr = head;
+	while (curr){
+		printf("%d\n", curr->data);
+		curr=curr->next;
+	}
+}
+
+int main(){
+	Node* test = new Node();
+	test->data = 4;
+	test->next = NULL; 
+
+	Node* test2 = new Node();
+	test2->data = 2;
+	test2->next = test; 
+
+	Insert(Insert(Insert(test2, 3), 4), 1);
+	Print(test2);
+
+	return 0;
+}

Diff for: datastructures/insertendll.cpp

@@ -0,0 +1,30 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+struct Node{
+		int data;
+		Node* next;
+};
+
+
+Node* InsertNth(Node* head, int data, int position){
+	//create new node
+	Node* add = new Node();
+	add->data = data;
+	add->next = NULL;
+	//empty list
+	if (!head){
+		head = add;
+	} else {
+		Node* curr = head;
+		while (curr->next)
+			curr = curr->next;
+		
+	
+	
+	
+	
+	
+	};
+	return head;
+};

Diff for: datastructures/linkedlist-2.cpp renamed to datastructures/insertheadll.cpp

@@ -7,7 +7,6 @@ struct Node {
 	struct Node* next;
 };
 
-
 void Print (Node *head) {
 	Node* curr = head;
 	while (curr){

Diff for: datastructures/insertnthposll.cpp

@@ -0,0 +1,22 @@
+oct 10 - finish linked lists, start BST, one chapter C++, three problems from CTCI
+oct 11 - BST, review Facebook working environment, one chapter C++, three problems from cTCI
+oct 12 - BST, review Facebook's working tools, one chapter C++, three problems form CTCI
+oct 13 - algorithms, read on glassdoor, review Javascript Definitive Guide stuff, three problems from CTCI
+oct 14 - 
+oct 15
+oct 16
+apply to other internships:
+dropbox
+airbnb
+apple
+amazon
+linkedin
+paypal
+intel
+xerox
+cisco
+oracle
+hp
+uber
+
+