Introduction
This series of articles is from the online sessions I conduct for working professionals as a part of the data structures and algorithm subject. I will keep posting each session's article here so that it can be used by everyone who is not able to attend the sessions.
On the other hand if you are interested in watching a video for this article, you can subscribe our Youtube Channel.
What are data structures?
Data is the basis of information, in today’s e-age information is the most important asset. An important and un-deniable fact about data is that its volume is exponent...

Read More
# online classes

## Count Binary Search Trees created from N unique elements

[nextpage title="Introduction"]
This is the third article for Binary Search Trees, to read more about the previous article, please check the topic Binary Search Tree Basics – a detailed discussion. To get updates on the coming articles in the series, please use the Subscribe feature on the right panel.
Purpose of article
This article explains few more aspects of binary search tree (BST). In the last article we learnt to construct a BST and then we revisited our technique to construct a better BST with the same. So this means that there can be more than one BST possible with a given set of e...

Read More
## Building Binary Search Trees – detailed discussion

Introduction
This is the second article for Binary Search Trees, to read more about the previous article, please check the topic Binary Search Tree Basics – a detailed discussion. To get updates on the coming articles in the series, please use the Subscribe feature on the right panel.
Purpose of article
This article will resume from where we concluded in the first article, this is primarily to understand how to build a BST and understand the problems which arise after building Binary Search Trees. Then we will improve over it and find out ways to build better BSTs.
Do remember there is a...

Read More
## Binary Search Tree Basics – a detailed discussion

Introduction
The article Binary Search Tree Basics - a detailed discussion is the first article for Binary Search Trees and the ninth article in the series of non-linear data structures, to read more about the previous article, please check the topic Operations on a binary tree – Hierarchical Datastructure. To get updates on the coming articles in the series, please use the Subscribe feature on the right panel.
Purpose of article
This article is to discuss Binary Search Tree in Detail, mostly the theory behind a binary search tree and how it is different from a Binary Tree and what all does...

Read More
## Interview Question – Sorting Time Strings

Introduction
This is a pretty famous problem asked in most of the interviews, "Sorting the dates". This is not a complicated one but sometimes, it becomes real confusing or starts giving unexpected results, if not properly taken care of. To learn more about similar problems, please visit the Interview Section.
Do not forget to use the Subscribe feature on the right to get updates on new articles.
Problem Statement- Sorting Time Strings
You are given an array of Time objects in which the times are in the following format "13:24:56.123" i.e. "HH:mm:SS.Z" and you need to sort them in ascendin...

Read More
## Object Oriented Programming – Inheritance in detail

Introduction
This article is in relation to the interview questions asked to the java candidates in particular. I have been interviewing candidates and I find them very confused between the features of OOP. Most of the time people are not very clear about Inheritance. We will discuss this in detail. To read more about my articles on java and it's concepts, please visit Java Articles.
Purpose of the article
This article is for the novice and the experts as well, I always believe that the concepts are something which has to be read and brushed up again, here we will discuss Inheritance in d...

Read More
## Dynamic Programming – Minimum Number of Coins

[nextpage title="Introduction"]This is the third post in Dynamic Programming - Online Classes.
This is another article which demonstrates the usage of dynamic programming to solve a different problem in hand. To learn the basics of dynamic programming check my first article on dynamic programming.
Purpose of the post
The purpose of this article is to solve another problem using dynamic programming, this is a very famous interview question which is asked in multiple interviews. So without wasting any time, let us jump into the problem and ways to solve the same.
Find minimum number of coi...

Read More