dengjonathan

/*
You have a defined set of activities you can be doing during your job search
process.  Each activity has a cost (time that it takes you to complete the activity)
and each activity provides some value (XP, or experience points, 
that will increase your chances of finding a job).

Write a function that maximizes XP for a given input of time. Try to make your
solution as efficient as possible.
 */

dengjonathan

const redux = require('redux');

const reducer = (state={}, action) => {
  switch(action.type) {
    case 'START':
      return Object.assign({}, state, {start: Date.now(), interval: action.interval});
    case 'TICK':
      return Object.assign({}, state, {elapsed: action.currentTime - state.start});
    case 'STOP':
      return Object.assign({}, state, {interval: null});

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

const ACTIVITIES = [
  {name: 'side-project', time: 10, xp: 12},
  {name: 'algorithms', time: 3, xp: 7},
  {name: 'networking', time: 1, xp: 0.5},
  {name: 'exercise', time: 2, xp: 1.5},
  {name: 'systems design', time: 4, xp: 4},
  {name: 'making CSS codepens', time: 3, xp: 4}
];

/**

dengjonathan

/*
You have a defined set of activities you can be doing during your job search
process.  Each activity has a cost (time that it takes you to complete the activity)
and each activity provides some value (XP, or experience points, that will increase your chances of finding a job).

Write a function that maximizes XP for a given input of time. Try to make your
solution as efficient as possible.
 */

const ACTIVITIES = [

dengjonathan

function fakeAjax(url,cb) {
	var fake_responses = {
		"file1": "The first text",
		"file2": "The middle text",
		"file3": "The last text"
	};
	var randomDelay = (Math.round(Math.random() * 1E4) % 8000) + 1000;

	console.log("Requesting: " + url);