Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18 Output: 4 Explanation: The longest…

Problem: Print all combinations of points from given a set of input that can compose a given number. (Recursive and…

Question: Suppose we have some input data describing a graph of relationships between parents and children over multiple generations. The…

Stack is an abstract data type. The basic operation of the stack can be: Push : Push object on top of stack. Throws an…

One of the simplest (in terms of understanding :P) sorting technique is Insertion Sort. You will find many sites giving…

Basic traversal on tree is best explained on http://en.wikipedia.org/wiki/Tree_traversal . In Order: Pre Order: Post Order: If anything is missing in explanation, you…

So here is another sorting algorithm, “Quick Sort” which I have implemented it using ArrayList which is inplace sorting algorithm. Worst case…

One more simple form of sorting algorithm is Selection Sort. For in-place implementation in java, starting from 1st index, find the smallest…

So here is another sorting algorithm, “Merge Sort” which I have implemented it using ArrayList. MergeSort follows the Divide and Conquer paradigm. Divide part…

We all know that a binary search tree operations are of O(log n). But there can be a worst scenario…