Points to keep in mind to make the perfect commit As a developer, you might have sat someday pondering “What does a perfect commit look like?” If yes, then this article is for you! Please bear in mind that these are solely my views. These may differ from developer to…

An introduction to Spectrograms and Mel-spectrograms What is Sound? In essence, the sound is a signal. A signal is nothing more than the variation of a certain quantity over time. In the case of sound, the quantity is air pressure. Sound is essentially a vibration that propagates through a medium thus causing a…

A comprehensive introduction to Segment Tree 1. What is a Segment Tree? Let’s say we have an array A of size N. A segment of the array is a contiguous part of an array in form A[i : j] such that 0 ≤ i ≤ j ≤ N-1. A segment tree is essentially a binary tree…

Dynamic Programming Problem #3 : Equal Sum Partition — Before starting up with the Equal Sum Partition Problem, I would highly recommend you to read this introduction to Dynamic Programming. Here I have covered the basic method on how to approach a DP based problem. We will be using the same concepts to solve the Equal Sum Partition Problem…

Dynamic Programming Problem #2 : Subset Sum — Before starting up with the Subset Sum Problem, I would highly recommend you to read this introduction to Dynamic Programming. Here I have covered the basic method on how to approach a DP based problem. We will be using the same concepts to solve the Subset Sum problem. …

Dynamic Programming Problem #1 : 0–1 Knapsack — Before starting up with the Knapsack Problem, I would highly recommend you to read this introduction to Dynamic Programming. Here I have covered the basic method on how to approach a DP based problem. We will be using the same concepts to solve the Knapsack problem. With that being said…

Getting started with Dynamic Programming — 1. What is Dynamic Programming ? In simple words, one can say that it is an optimization over plain recursion technique. This is achieved by reducing the number of recursive calls, either by storing the intermediate computed values or by deriving the final computation based on some kind of logical relation. …

Getting started with STL in C++ — What are Maps in STL ? Maps are nothing but a type of associative container which stores elements in the form of key-value pairs. For those of you who are familiar with python, you can think of maps like a dictionary in python. A key in map is used to uniquely identify the element and the…

Getting started with STL in C++ — The Standard Template Library (STL) is a very useful set of template classes containing various containers. One among these containers is Lists. Today we’ll be having a look at Lists in STL. …