Heapsort

Task: We have to sort an array of some values using Heapsort in Java. The time complexity of Heap Sort algorithm is O(n * log(n)) as in the average case so in worst and best cases. The essence of heap sort is in finding the maximum value in non-sorted part of the array, putting it […]

Read More

Java 9 Features

Here are all the Java 9 features that will be making to the release in July 2017. Process API Updates HTTP/2 Client (Incubator) Improve Contended Locking Unified JVM Logging Compiler Control Variable Handles Segmented Code Cache Smart Java Compilation, Phase Two The Modular JDK Modular Source Code Elide Deprecation Warnings on Import Statements Resolve Lint […]

Read More

Convert a string representing a duration, ie: 300ms, 20s, etc to to nanoseconds

Suppose you have a string in your application that has the duration of time using ns, us ms , s h, d. And you want to convert them all to nano seconds, then utility will of great help to you.

Read More

Longest Palindromic Subsequence – Leetcode Java

Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000. Example 1: Input:

Output:

One possible longest palindromic subsequence is “bbbb”. Example 2: Input:

Output:

One possible longest palindromic subsequence is “bb”. Java Solution

Read More