The 10 most important DP questions

How can you sort a LinkedList in O(n*logn) running time and less than O(n) space? Use merge sort. we will start with 2 subproblems and then combine it all for a valid solution. Firstly, merge two sorted list: If one of the lists is null then return the other one, else create…

So what exactly is serialization? Serialization is a mechanism of converting the state of an object into a byte stream. Deserialization is the reverse process where the byte stream is used to recreate the actual Java object in memory. This mechanism is used to persist the object. …

First the code public class SingletonDemo { private static SingletonDemo singleton = null; private SingletonDemo() { System.out.println("singleton created"); } public static SingletonDemo getInstance() { if (singleton == null) { singleton = new SingletonDemo(); } return singleton; } } The code above is an example of a lazy singleton.

Counting sort Counting sort is base on the assumption that the array contains only integers, and they are between 0 to k, where k is known!. …

A quick word about sorting using comparisons, each array with n items has n! permutations, if we look at the algorithm as a binary tree that each node to leaf is a premutation then the are n! …