onlineclasses

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

Operations on a binary tree – Hierarchical Datastructure

Introduction This is the eighth article in the series of non-linear data structures, to read more about the previous article, please check the topic Binary Tree – Print all paths in a tree. 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 mostly about operations on a binary tree, writing code to delete a binary tree, mirror a binary tree, finding the height of a node and finding the depth of a node. We will use the same tree which we have used till now for all these operations. The tree is shown belo...
Read More

Binary Tree – Print all paths in a tree

Introduction This is the seventh article in the series of non-linear data structures, to read more about the previous article, please check the topic Hierarchical Datastructure – Tree Traversals. 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 mostly about using our knowledge of tree to find out ways to solve real world problems and also perform some operations on the tree. We visit the problem to Print all paths in a tree. Common Operations on a Tree Here we assume that we already have a tree bui...
Read More