## Noble integers in an array (count of greater elements is equal to value)

Given an array arr[], find a Noble integer in it. An integer x is said to be Noble in arr[] if the number of integers… Read More »

## K-Nearest Neighbours

K-Nearest Neighbors is one of the most basic yet essential classification algorithms in Machine Learning. It belongs to the supervised learning domain and finds intense… Read More »

## Calling an External Program in Java using Process and Runtime

Java contains the functionality of initiating an external process – an executable file or an existing application on the system, such as Google Chrome or… Read More »

## Count half nodes in a Binary tree (Iterative and Recursive)

Given A binary Tree, how do you count all the half nodes (which has only one child) without using recursion? Note leaves should not be… Read More »

## Number of substrings divisible by 6 in a string of integers

Given a string consisting of integers 0 to 9. The task is to count the number of substrings which when convert into integer are divisible… Read More »

## 3-way Merge Sort

Prerequisite – Merge Sort Merge sort involves recursively splitting the array into 2 parts, sorting and finally merging them. A variant of merge sort is… Read More »

## Tabulation vs Memoizatation

Prerequisite – Dynamic Programming, How to solve Dynamic Programming problems? There are following two different ways to store the values so that the values of… Read More »

## Minimum lines to cover all points

Given N points in 2-dimensional space, we need to print the count of the minimum number of lines which traverse through all these N points… Read More »

## Find the first repeated character in a string

Given a string, find the first repeated character in it. We need to find the character that occurs more than once and whose index of… Read More »

## Find original array from encrypted array (An array of sums of other elements)

Find original array from a given encrypted array of size n. Encrypted array is obtained by replacing each element of the original array by the… Read More »

## Daily life Linux Commands

Clear the Terminal : In our daily life, we use to work on Terminal if we are using LINUX. Continuous working on terminal make terminal screen full… Read More »

## How to solve a Dynamic Programming Problem ?

Dynamic Programming (DP) is a technique that solves some particular type of problems in Polynomial Time. Dynamic Programming solutions are faster than exponential brute method… Read More »

## Java.util.Locale Class in Java | Set 2

Java.util.Locale Class in Java | Set 1 More methods: getDisplayVariant() : java.util.Locale.getDisplayVariant() displays variant of the Locale Syntax : public final String getDisplayVariant() Parameters :… Read More »

## Java.util.Locale Class in Java | Set 1

As the name suggests util.Locale Class is used to perform locale task and provides locale information for the user. Declaration : public final class Locale… Read More »

## Multiples of 3 and 5 without using % operator

Write a short program that prints each number from 1 to n on a new line. For each multiple of 3, print “Multiple of 3”… Read More »