- Algorithm interview – Big O
Big O is about how long an algorithm takes to run from start to end and how well it scales based on the size of the input or dataset. Big O is mostly measured based on the worst-case scenario even though some algorithms might finish early based on some logic. Here is another graph […]
- Big O Notation
Big O is about how long an algorithm takes to run from start to end and how well it scales as the size of the input or dataset increases. Big O is mostly measured based on the worst-case scenario even though some algorithms might finish earlier than others. Here is another graph for more clarity.…
- Introduction
Data Structures A data structure is exactly what it sounds like — a structure that holds data. Unlike variables, which only hold a single point of data, data structures collect one or more points of data of the same type. Although a data structure can hold many points of data, a data structure,…
- MySQL Closure Table
Sometimes we are given a task where we need to model a hierarchy of different complexity levels and not really sure how to do that properly in the most efficient, reliable, and flexible way. Let’s review one of the data modeling patterns that give us some answers for that. Consider we have a…
- Java Best Practices
Writing Java code that compiles and runs is easy. Writing Java code that is readable, maintainable, secure, and performant — code that your teammates (and your future self) will thank you for — is a different challenge entirely. This tutorial distills the practices that separate production-quality…