Your Coding Teacher

Big O analysis tip Big O notation describes the rate of increase of an algorithm. It could be possible for O(N) code to be faster than 0(1) code for *some inputs*. O(N^2) sorting algorithms are generally good for small inputs.

If you don't have a job, get something to pay the bills. And design a plan to transition to a better job. Ex: use the tools you need for the next job to build something at your current job. You'll develop skills while being paid and help your team

GCP has machine families with predefined amounts of RAM and CPU - General. Best price/perf for many tasks - Memory-optimized. For memory-intensive tasks - Compute-optimized. Highest perf/core - Shared-core. Cost-effective for small apps You can create custom machines too

Programming is at the heart of evolution

"Software is like sex. It's better when it's free.." - Linus Torvalds

Special cases aren't special enough to break the rules - The Zen of Python

Interview question. Write a function to check if a string s is a palindrome Python be like: return s == s[::-1]

Do not code if you are tired You'll end up redoing what you did Double waste of time

Copy-Paste is the root of all evil.

Always Be Coding

What is your favourite text editor and why is it Vim?

Tutorials are useless if you don't build anything

Beginner programmers like writing code. The real pros like deleting code.

If you don't get comments in a pull request, your code is very good Or very bad

Being in the right part of twitter will change your life

Developers who like to learn have an advantage over everyone else

Remember: You don't always need a database. Sometimes files are enough.

Just because you don't like a technology is no reason to say it's shit

Writing code to make your colleagues think how brilliant you are is the stupidest mistake a programmer can make.

It's a beautiful day to start writing cleaner code