mayashavin

function Queue(){
	var storage = {},
		head = 0,
		tail= 0;
    
	return {
		enQueue: function(item){
			storage[tail] = item;
		  	tail++;
		},

mayashavin

function Stack(){
  var stack = {};
  var stackSize = 0;
  
  return {
    push: function(item){
      stack[stackSize] = item;
      stackSize++;
    },
    pop: function(){

mayashavin

function deepEqual(a, b){
  if (typeof a === 'object' && a !== null && typeof b === 'object' && b !== null){
    	var isEqual = Object.keys(a).length === Object.keys(b).length;
      
      	if (isEqual){
          	for (var key in a){
              isEqual &= b.hasOwnProperty(key);
              
              if (isEqual){
                isEqual &= deepEqual(a[key], b[key]);

mayashavin

//Input: Array of Arrays of Cells
var grid = [['name', 'height', 'country'],
		['Kilimanjaro',5895, 'Tanzania'],
		['Everest',8848,'Nepal'],
		['Mount Fuji',3776,'Japan'],
		['Mont Blanc',4808,'Italy/France'],
		['Vaalserberg',323,'Netherlands'],
		['Denali', 6168,'United States'], 
		['Popocatepetl', 5465,'Mexico']];

mayashavin

function Node(value) {
  this.value = value;
  this.next = undefined;
}

function SLinkedList() {
  var head = undefined;
  var length = 0;

  return {

mayashavin

function Node(value) {
  this.value = value;
  this.next = undefined;
  this.prev = undefined;
}

function DLinkedList() {
  var head = undefined;
  var tail = undefined;
  var length = 0;

mayashavin

function isPermutation(strA, strB){
	var isValid = true;
	
	//First validity check
	if (!strA || !strB || strA.length !== strB.length){
		return !isValid;
	}
	
	//Get the map of characters and their occurences in strA
	var charsMap = getMap(strA);

mayashavin

function isPermutation(strA, strB){
	var isValid = true;
	
	//First validity check
	if (!strA || !strB || strA.length !== strB.length){
		return !isValid;
	}
	
	var sortedA = sort(strA), sortedB = sort(strB);
	

mayashavin

function Emitter(){
	var events = new Map();
	
	return {
		subscribe: function(event_name, callback){
			//If events has event_name, then get the event Subscription and push to it.
			//Else create new event, subscription and add to events.
			
			var isEventExisted = events.has(event_name), index = 0;
			

mayashavin

//Given 2 identical DOM trees (but not equal) and one element of the first DOM tree, 
//how would you find this element in the second DOM tree
//Questions to ask:
//1. Input: input node is inside DOM tree? Or need to check if it exists?
//2. Output node needs to be identical? Same tag?
//3. Are comments, texts considered as child nodes? - Yes, need to use childNodes, No, use children.
var sameLevelNodeIdenticalTrees = {
  getIndexOf: function(nodeList, node){
    return Array.prototype.indexOf.call(nodeList, node);
  },