Harshita hkasera

Reference Links

Apart from the official and the best android resource (http://developer.android.com/develop/index.html), here are few links to help one get started with android.

Udacity courses

I have two accounts on github, one is personal account and other is office account. I typically face this problem to manage pushing to different repos using these different accounts.

I found a great way of doing it without any hassle.

Step 1 : Generate different ssh keys for both the accounts

Suppose my personal id is [email protected] and office account is [email protected]

Follow the steps mentioned here to generate ssh keys : https://help.github.com/articles/generating-ssh-keys/

	/* This makes the transition smooth.Add it globally. */
	div {
	-webkit-transition: all 0.3s ease-in-out 0s; /* Chrome, Safari 3.1+ */
	-moz-transition: all 0.3s ease-in-out 0s; /* Firefox 3.5+ */
	-ms-transition: all 0.3s ease-in-out 0s; /* IE 9 */
	-o-transition: all 0.3s ease-in-out 0s; /* Opera 10.50-12.00 */
	transition: all 0.3s ease-in-out 0s; /* Firefox 16+, IE 10+, Opera 12.10+ */;
	}

	.circular {

	var conn = new Mongo();
	db = conn.getDB(<DB_NAME>);
	var cursor = db.<COLLECTION>.find();
	var items = [];
	items = cursor.toArray();
	var dbstruc = {};
	for (var i = 0; i < items.length; ++i) {
	var target = items[i];
	getKP(target,dbstruc);
	}

	var getCells = function (num) {
	var cellArray = [];
	for (var i = 0; i < num; ++i) {
	cellArray.push(cellAt(i + 1));
	}
	return cellArray;
	};
	var cellAt = function (num) {
	if (num <= 26) {
	return String.fromCharCode(97 + num - 1);

	var BinaryTree = function (val) {
	'use strict';
	this.val = val \|\| null;
	this.left = null;
	this.right = null;
	};
	BinaryTree.prototype.create = function (num) {
	'use strict';
	var i;
	for (i = 0; i <= num; i = i + 1) {

	var Node = function (val) {
	this.val = val \|\| null;
	this.next = null;
	};

	var SinglyLinkedList = function () {
	this.head = null;
	this.tail = null;
	};

	class Node{
	int val;
	Node left;
	Node right;
	}

	class Tree{
	Node root;
	}

	var a = "{{{}}}}";
	var ts = [];
	var mismatch = false;
	for (var i = 0; i < a.length; ++i) {
	if (a[i] === '{') {
	ts.push('{');
	}
	if (a[i] === '}') {
	if (ts.length == 0) {
	mismatch = true;