RyanOkamuro

Subject: Help Ryan Okamuro Find Software Engineer Job

Hi friends and colleagues, 

I recently completed an accelerated web development program and am currently searching for jobs.  If you have any leads or contacts that you can refer me to, I would appreciate it. 

I am currently seeking for a position as an entry level Front-End Web Developer/Software Engineer in the Greater Los Angeles/ San Diego/ New York Area.  I am searcing for positions in the following industries: e-commerce, news feeds, traveling, and digital marketing.  I would prefer working in an established company where I can grow in the company and utilize my newly acquired coding skills as well as leverage my Project Management experience. 

Attached is my resume and portfolio link for reference. 

RyanOkamuro

Morning: Practice coding/build basic apps
Noon: Eat 
Afternoon: Apply for jobs online/cold emails
Evening: Attend networking events in LA area including Pasadena, downtown LA, and Silicon Beach

RyanOkamuro

When clicking "back", the highlighted "nav page" doesn't change.  

RyanOkamuro

Headline:
I'm Ryan Okamuro, a full stack web developer with a background in NPI system project management.  

Bio:
For the past 6 years, I have been living abroad in Asia and now I am back in America to follow my passion in web development.  
Back in the day, I used to tinker websites using Dreamweaver; but now, I can build from scratch using React, Node, Javascript, jQuery, HTML5, and CSS3! 

When I'm not coding, I'm reading Engadget about the latest news in tech, traveling every chance I get, or out trying to meet new people!
______________

RyanOkamuro

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

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

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

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

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

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