As a freshman taking part in my first major robotics competition one of the first problems I had to solve was making it figure out how to go from one location to another faster than the rest. The naive idea of simply taking locally steps towards the goal proved to be futile as expected, it’s never that easy.

In a previous post, I talked about how OOP principles like encapsulation were necessary components from a software design perspective. Design patterns are certain conventions of project structuring that have been battle tested to produce robust results

Segment trees are what the cool kids in Samsung use to solve problems.

In the previous article we looked at images, which can be considered as 2D signals.

CNN is fake news.

Cool story bro.

Been away from a while.

If you’re someone with a serious case of OCD then you’re all too familiar with how difficult it is to keep things perfectly organized. The binary search tree is a data structure that can solve many of such woes.

Whenever we come across an introductory or somewhat intermediate text on object oriented programming there’s always someone there to remind us of the importance of encapsulating an object’s member variables. In layman’s terms, that means to make sure that you don’t allow direct access to an object’s members but instead make use of getters and setters. This is of course important, in fact it is one of the four principles of OOP which are-

One of the best ways to learn a new programming language is to ask yourself two important questions-