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…

Match the braces and verify whether all the opening braces has the closing braces in right order. Input: String of…

The caterpillar problem. Input: int[] caterPillar = {2,4,5} int totalLeaves = 10 Here, you will have fixed size array with integer elements…

Problem: Finding the number of perfect squares between two integer range. Input: first integer and last integer -> int startInteger,…

Input: Integer array Diff: Integer difference Output: Total number of unique pairs having difference provided in the input. Here in…

Input: Integer array with 0 or more repeated values. Output: Total number of duplicate numbers present in the given array…

Input: X and Y are integer values, where X < Y N is the length of permutation Output: To print…

Input: array of integer value Output: print each iteration by subtracting the smallest elements till array becomes empty For example:…