In this post, we will see simple and efficient ant build file for creating a war file in web applications in Java.
A Multiset is a collection that is similar to Set, but it may have duplicate elements. It supports duplicate elements by maintaining a count of number of times an element appears in the collection. In this post, we will see how to use Multiset provided by Google’s Guava Library.
Given two integers x and n where n is non-negative, efficiently compute the value of power function pow(x, n).
Given an array of integers, find out minimum and maximum element present using minimum comparisons.
Given an array of integers, find maximum sum subarray among all subarrays possible.
Given an array, find peak element in it. A peak element is an element that is greater than its neighbors.
Given a sorted binary array, efficiently find the number of 1’s in it.
Given a nearly sorted array such that each of the N elements may be misplaced by no more than one position from the correct sorted order, efficiently search a given element in it. Report if the element is not present in the input array.
Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceil map the given number to the largest previous or the smallest following integer, respectively.
Given a sorted array of distinct non-negative integers, find smallest missing element in it.
Given a sorted array of integers containing duplicates, count occurrences of a number provided. If the element is not found in the array, report that as well.
Given a string, print it in reverse using recursion. For example, consider the input string “Techie Delight”. The output should be “thgileD eihceT”.