RyanOkamuro

i18n state
https://glitch.com/edit/#!/cute-crack?path=public/index.html:1:0

CRUD reducer
https://glitch.com/edit/#!/whimsical-literature?path=src/store.js:5:0

RyanOkamuro

Interest calculator I: Connecting
https://glitch.com/edit/#!/flowery-index?path=src/components/interest-calculator.js:35:13

Interest calculator II: Dispatching
https://glitch.com/edit/#!/diamond-amusement?path=src/components/interest-calculator.js:10:44

RyanOkamuro

Find the latest newsfeed on China’s tech industry in one central location from American resources.

RyanOkamuro

1)	Post new tech news articles
2)	Edit news articles to make corrections to article headline, image, spelling, comments
3)	Post comments under articles
4)	Delete posts 
5)	Like articles
6)	Search for keywords in article headlines
7)	Show related news feed articles

RyanOkamuro

1)	Post new tech news articles
2)	Edit news articles to make corrections to article headline, image, spelling, comments
3)	Post comments under articles
4)	Delete posts 
5)	Like articles
6)	Search for keywords in article headlines

RyanOkamuro

https://app.box.com/s/ck0qq6x87ocuwfrn36mzex9132gyw818
https://repl.it/@RyanOkamuro/Landing-Page
https://repl.it/@RyanOkamuro/Content
https://repl.it/@RyanOkamuro/AddPage

RyanOkamuro

Page was not redirecting after submit add new deal
Page would not load the latest information after deal was added or edited
App layout needs to change for mobile 

RyanOkamuro

For the categories & stores pages, add a subtitle. 
  ie. Categories for electronics should have "Electronics" as the subtitle
  ie. Macys should have "Macys" as the subtitle
The Mobile formatting for "details page" should be similar to stores/categories. 

RyanOkamuro

Even or Odd: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Are you here?: Polynomial time O(n^k) //has nested loops
Doubler: Linear time O(n) //Given input a and input b, where b is twice as large as a, it will take a linear algorithm twice as long to process b compared to a.
Naive Search: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Creating pairs: Polynomial time O(n^k) //has nested loops
Computing fibonaccis: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
correct-----Linear time O(n) //Given input a and input b, where b is twice as large as a, it will take a linear algorithm twice as long to process b compared to a
An Efficient Search: Logarithmic time O(log(n)) //cut the problem size in half each round through
Random element: Constant time O(1) //doesn't matter what the input size is it doesn't effect the algorithm's run time
Is it prime?: 

RyanOkamuro

https://maps.googleapis.com/maps/api/js?key=AIzaSyAOVYRIgupAurZup5y1PRh8Ismb1A3lLao&libraries=places&callback=initMap