This algorithm to print m*n matrix diagonally. Algorithm going to take Big O(m*n/2) time
This algorithm is to generate random tree based on max integer value. This is very useful when you want tree for your algorithm.
Algorithm to find next greater element in array for current element. If we do linear search then it would take O(n^2) but here we are going to use stack to implement this algorithm. It will going to take O(n) time.
Here we are going to use runner techniques, where there will be a two pointers slow and fast. Fast will going to take double steps then slow one, Lets see in below image.
This algorithm to find peak element in an array, Peak element is an element which has greater value than its left and right element. one way to get peak element is using linear search which takes O(n), but we can also search using binary algo.
This example to generate balanced binary search tree from an array. A binary tree is balanced if for each node it holds that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.
This is to find lowest common ancestor node for two nodes in tree.
This is to find all possible paths starting from left top corner of matrix to right bottom corner But we have constrain on this. You can only move Right or bottom and we also have blocking, Here blocking means 0 and path means 1. You can move to particular right or bottom if we have… Read more
You can store, access and modify properties available in Velocity class. Velocity has its own default properties available at below path. “org/apache/velocity/runtime/defaults/velocity.properties”
In Apache velocity, There are three main ways to pass data from Java class to VM template. 1. Key and Value mapping 2. Key and Bean/POJO (Object) mapping 3. Key and Inner Map mapping