Your Coding Teacher

One hour of coding a day keeps unemployment away

Bad developers are afraid to look dumb Good developers are afraid not to ask enough questions

People still haven't realized that coding 3 times a week is a thousand times harder than coding every day.

If you like to help people, You will love building a Twitter account.

Don't envy money. Envy people whose code compiles at the first attempt.

Learning to code is simple Things you don't need: - A genius IQ - A MacBook - Three screens - An expensive chair - Buying 2000 courses - A degree Things you need: - 1 or 2 good books/courses - Consistency - Patience

As a developer, these two acronyms are important: - CI: Continuous Integration - CD: Continuous Deployment But the most important one is CL: Continuous Learning

The best developers are really just philosophers in disguise. Always asking why.

30 minutes of coding on your own will do more for your skills than 3 hours of watching tutorials.

When you learn to code, not being "smart enough" is not the problem. The problem is using it as an excuse.

Learning to code gives you so many options: * Full-time employee * Remote work * Freelancer * Building your own SaaS What are you waiting for?

The better you code, the less worried you are about having a job.

Buggy code that is blazingly fast is still buggy code.

If you find coding hard, you're thinking too much. If you find coding easy, you're thinking too little.

As a developer, it starts with "This should be a small and easy change" and it ends as one of your worst nightmares.

"There are those who will say terrible things about the JavaScript language. Many of these things are true." - Douglas Crockford

VPC Service Control helps prevent data exfiltration. It allows you to define a perimeter around resources you want to protect. You can define what services and from what networks these resources can be accessed.

Design patterns in 1 tweet Iterator: Provide sequential access to a collection of objects Ex: Next/Previous buttons in Youtube.

A skip list is a linked list that is augmented with a number of additional pointers. Each dictionary operation runs in expected time O(logN) on a skip list of N items. Skip lists provide an alternative to balanced binary search trees.

There is a great satisfaction in building good tools for others to use.