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.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var Node = function (val) { | |
this.val = val || null; | |
this.next = null; | |
}; | |
var SinglyLinkedList = function () { | |
this.head = null; | |
this.tail = null; | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Node{ | |
int val; | |
Node left; | |
Node right; | |
} | |
class Tree{ | |
Node root; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* 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 { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var checkPrime = function(n) { | |
"use strict"; | |
if (n === 1) { | |
return false; | |
} | |
var isPrime = true; | |
for (let i = 2; i < n;) { | |
if (n % i === 0) { | |
isPrime = false; | |
} |
##mailinglists
##list of speakers
OlderNewer