Data structures, amongst other things, are used to store and organize data. Different types of data are more efficiently organized using particular data structures. Trees are non-linear data structures which are quite often used to represent hierarchical data such as the employee organizational structure in a company. Structure of a Tree A tree is…

Concepts and Examples. Object-Oriented Programming is a concept that is usually taught in one of the initial lessons or courses in computer science. This is because it lies the foundation for how upcoming languages will work (fundamentally). …

This week I decided to backtrack from front-end development for a bit to brush up my Ruby on Rails skills (mainly to test if I may have forgotten anything). Thus, I began an Instagram clone application that includes all CRUD fundamentals. Not to my surprise(well, maybe kind of) I sailed…

What it is and why use it. Natural Language Processing, or NLP for short, is broadly defined as the automatic manipulation of natural language, like speech and text, by software. The study of natural language processing has been around for more than 50 years and grew out of the field…

The sliding window algorithm is used to perform the required operation on a specific window size of a given large buffer or array. The window starts from the 1st element and keeps shifting right by one element. The objective is to find the minimum k numbers present in each window…

A quick summary and intro (simplified) Docker: a tool that can package software into containers that run reliably in any environment. But, what is a container and why do you need one? Let’s imagine we build an app with Cobol that runs on some weird flavor of Linux; you want…

Firebase Authentication…using Google(for free) I recently completed a chat application closely mapping Whatsapp web to play around with realtime web-chats and navigate different ways of user authentication. Interestingly enough, integrating google authentication was one of the quicker/easier parts of my application! Here I will walk through what all I had…

Given a graph and a source vertex in the graph, find shortest paths from source to all vertices in the given graph. One algorithm for finding the shortest path from a starting node to a target node in a weighted graph is Dijkstra’s algorithm. …

What are they? And when are they useful. This week I put some time aside to study and garner a deeper understanding of a certain data structure that we weren’t taught in bootcamp — but comes up quite often in interview practice questions: binary trees or more specifically binary search…