#java
Read more stories on Hashnode
Articles with this tag
The problem says that you are given an array of n size. The array is not sorted and your task is to find the kth smallest element in the array. So...
OK so the question is to find the Maximum and the minimum element in a given array, the array is not sorted. So since the array is not sorted you...
Given an array of size N, that contains only 0s, 1s, and 2s. Our task is to sort the array in ascending order, so that all the 0 comes first, followed...
You are given an array, and you will have to reverse the array elements. Pretty simple right? Well the brute force approach that comes to your mind is...
Write a program which prints the occurrences of each character in a string. It should not print duplicate characters. Below given example of...